Caches hide the growing latency of accesses to the main memory from the processor by storing the most recently used data on-chip. To limit the search time through the caches, they are organized in a direct mapped or set-associative way. Such an organization introduces many conflict misses that hamper performance. This paper studies randomizing set index functions, a technique to place the data ...

IFG logic [1] is a variant of the independence-friendly logic of Hintikka and Sandu [3, 2]. We answer the question: " Which IFG-formulas are equivalent to ordinary first-order formulas? " We use the answer to show that the ordinary cylindric set algebra over a structure can be embedded into a reduct of the IFG-cylindric set algebra over the structure.

We give an accessible presentation to the foundations of nominal techniques, lying between Zermelo-Fraenkel set theory and Fraenkel-Mostowski set theory, and which has several nice properties including being consistent with the Axiom of Choice. We give two presentations of equivariance, accompanied by detailed yet user-friendly discussions of its theoretical significance and practical application.

We consider two related approaches to quantizing general relativity which involve replacing point set topology with category theory as the foundation for the theory. The ideas of categorical topology are introduced in a way we hope is physicist friendly.