Related papers: Biba's trick, with applications

In 1983 A. Suslin proved the Quillen-Lichtenbaum conjecture about algebraic K-theory of algebraically closed fields. The proof was based on a theorem called the Suslin rigidity theorem. In the present paper we prove the rigidity theorem for…

We show that countable increasing unions preserve a large family of well-studied covering properties, which are not necessarily sigma-additive. Using this, together with infinite-combinatorial methods and simple forcing theoretic methods,…

Linear logic was conceived in 1987 by Girard and, in contrast to classical logic, restricts the usage of the structural inference rules of weakening and contraction. With this, atoms of the logic are no longer interpreted as truth, but as…

Let $\Gamma$ be a weakly irreducible higher rank lattice. In this paper, we will prove various rigidity results for the $\Gamma$-action following a philosophy of the Zimmer program. We provide new rigidity results including local and global…

We discuss the mechanism of truncations driven by the imposition of constraints. We show how the consistency of such truncations is controlled, and give general theorems that establish conditions for the correct uplifting of solutions. We…

We introduce the family of axioms, denoted $\operatorname{Slice}_\kappa$, that claim the existence of strictly increasing decompositions of the form $$2^{\delta}=\bigcup_{\alpha<\kappa} 2^{\delta}\cap M_\alpha,$$ where $\delta<\kappa$, and…

We give a new proof of the NIP arithmetic regularity lemma for finite groups (due to the authors and Pillay), which describes the approximate structure of "NIP sets" in finite groups, i.e., subsets whose collection of left translates has…

This article describes a Turing machine which can solve for $\beta^{'}$ which is RE-complete. RE-complete problems are proven to be undecidable by Turing's accepted proof on the Entscheidungsproblem. Thus, constructing a machine which…

In this paper, using the canonical correspondence between the idempotents and clopens, we obtain several new results on lifting idempotents. The Zariski clopens of the maximal spectrum are precisely determined, then as an application,…

We use the theta lift to study the multiplicity with which certain automorphic representations of cohomological type occur in a family of congruence covers of an arithmetic manifold. When the family of covers is a so-called `p-adic…

In this paper the lightface $\Pi^{1}_{1}$-Comprehension axiom is shown to be proof-theoretically strong even over $\mbox{RCA}_{0}^{*}$, and we calibrate the proof-theoretic ordinals of weak fragments of the theory $\mbox{ID}_{1}$ of…

We prove a structural result for sets of integers with doubling at most $4 + \delta$, with $\delta>0$ sufficiently small. This generalises earlier work of Eberhard--Green--Manners which dealt with sets of integers with doubling strictly…

We develop a rigidity theory for frameworks in $\mathbb{R}^3$ which have two coincident points but are otherwise generic and only infinitesimal motions which are tangential to a family of cylinders induced by the realisation are considered.…

We introduce an algorithm that conjectures the structure of a permutation class in the form of a disjoint cover of "rules"; similar to generalized grid classes. The cover is usually easily verified by a human and translated into an…

After surveying classical results, we introduce a generalized notion of inference system to support structural recursion on non-well-founded data types. Besides axioms and inference rules with the usual meaning, a generalized inference…

We introduce a new combinatorial object called tower diagrams and prove fundamental properties of these objects. We also introduce an algorithm that allows us to slide words to tower diagrams. We show that the algorithm is well-defined only…

These are lecture notes from a course I gave at the University of Wisconsin during the Spring semester of 1993. Part 1 is concerned with Borel hierarchies. Section 13 contains an unpublished theorem of Fremlin concerning Borel hierarchies…

We formulate a division problem for a class of overdetermined systems introduced by L. H{\"o}rmander, and establish an effective divisibility criterion. In addition, we prove a coherence theorem which extends Nadel's coherence theorem from…

We prove various iteration theorems for forcing classes related to subproper and subcomplete forcing, introduced by Jensen. In the first part, we use revised countable support iterations, and show that 1) the class of subproper,…

We introduce bounded category forcing axioms for well-behaved classes $\Gamma$. These are strong forms of bounded forcing axioms which completely decide the theory of some initial segment of the universe $H_{\lambda_\Gamma^+}$ modulo…