Related papers: The set-theoretic Kaufmann-Clote question

Answering a question of Kaye, we show that the compositional truth theory with a full collection scheme is conservative over Peano Arithmetic. We demonstrate it by showing that countable models of compositional truth which satisfy the…

Let $T$ be a complete theory of fields, possibly with extra structure. Suppose that model-theoretic algebraic closure agrees with field-theoretic algebraic closure, or more generally that model-theoretic algebraic closure has the exchange…

This work is motivated by the problem of finding the limit of the applicability of the first incompleteness theorem ($\sf G1$). A natural question is: can we find a minimal theory for which $\sf G1$ holds? We examine the Turing degree…

What are the collections of sets ${A}_i\subset\mathbb{Z}$ such that any $n\in\mathbb{Z}$ has exactly one representation as $n=a_0+a_1+\dotsb$ with $a_i\in{A}_i$? The answer for $\mathbb{N}_0$ instead of $\mathbb{Z}$ is given by a theorem of…

Ehrenfeucht's lemma (1973) asserts that whenever one element of a model of Peano arithmetic is definable from another, then they satisfy different types. We consider here the analogue of Ehrenfeucht's lemma for models of set theory. The…

Our theme is that not every interesting question in set theory is independent of $ZFC$. We give an example of a first order theory $T$ with countable $D(T)$ which cannot have a universal model at $\aleph_1$ without CH; we prove in $ZFC$ a…

A first-order theory $T$ is a model-complete core theory if every first-order formula is equivalent modulo $T$ to an existential positive formula; the core companion of a theory $T$ is a model-complete core theory $S$ such that every model…

We make use of generalized iterations of Jensen forcing to define a cardinal-preserving generic model of ZF for any $n\ge 1$ and each of the following four Choice hypotheses: (1)…

Let $F=\{\mathbf{p}_0,\ldots,\mathbf{p}_n\}$ be a collection of points in $\mathbb{R}^d.$ The set $F$ naturally gives rise to a family of iterated function systems consisting of contractions of the form $$S_i(\mathbf{x})=\lambda \mathbf{x}…

Let $C, W \subseteq \mathbb{Z}$. If $C + W = \mathbb{Z}$, then the set $C$ is called an additive complement to $W$ in $\mathbb{Z}$. If no proper subset of $C$ is an additive complement to $W$, then $C$ is called a minimal additive…

Part 2 of 3 from master's thesis: Modeling Compact Objects with Effective Field Theory. Using the Effective Field Theory framework for extended objects, we build the effective theory of a binary system made up of the most general compact…

We show that the decidability of the first-order theory of the language that combines Boolean algebras of sets of uninterpreted elements with Presburger arithmetic operations. We thereby disprove a recent conjecture that this theory is…

The celebrated Bell's no-go theorem rules out the hidden-variable theories falling in the hypothesis of locality and causality, by requiring the theory to model the quantum correlation-at-a-distance phenomena. Here I develop an independent…

We prove Los conjecture = Morley theorem in ZF, with the same characterization (of first order countable theories categorical in aleph_alpha for some (equivalently for every) ordinal alpha>0. Another central result here is, in this context:…

A special final coalgebra theorem, in the style of Aczel's, is proved within standard Zermelo-Fraenkel set theory. Aczel's Anti-Foundation Axiom is replaced by a variant definition of function that admits non-well-founded constructions.…

We demonstrate that the classical Michael selection theorem for l.s.c. mappings with a collectionwise normal domain can be reduced only to compact-valued mappings modulo Dowker's extension theorem for such spaces. The idea used to achieve…

The structures $\langle M,\subseteq^M\rangle$ arising as the inclusion relation of a countable model of sufficient set theory $\langle M,\in^M\rangle$, whether well-founded or not, are all isomorphic. These structures $\langle…

Let \phi be a first order formula and M be a countable model. \phi^M denotes the set of all assignments that satisfy \phi in M. Let M, N be countable models. A formula \phi distinguishes these models if |\phi^M|\neq |\phi^N|. We show that…

We propose a set theory strong enough to interpret powerful type theories underlying proof assistants such as LEGO and also possibly Coq, which at the same time enables program extraction from its constructive proofs. For this purpose, we…

We generalize the small object argument in order to allow for its application to proper classes of maps (as opposed to sets of maps in Quillen's small object argument). The necessity of such a generalization arose with appearance of several…