We set up a general context in which one can prove Sauer–Shelah type lemmas. We apply our general results to answer a question of Bhaskar [1] and give a slight improvement to a result of Malliaris and Terry [7]. We also prove a new Sauer–Shelah type lemma in the context of $ \operatorname {\textrm{op}}$ -rank, a notion of Guingona and Hill [4].

We investigate which part of Brouwer’s Intuitionistic Mathematics is finitistically justifiable or guaranteed in Hilbert’s Finitism, in the same way as similar investigations on Classical Mathematics (i.e., which part is equiconsistent with $\textbf {PRA}$ or consistent provably in $\textbf {PRA}$ ) already done quite extensively in proof theory and reverse mathematics. While we already knew a contrast from the classical situation concerning the continuity principle, more contrasts turn out: we show that several principles are finitistically justifiable or guaranteed which are classically not. Among them are: (i) fan theorem for decidable fans but arbitrary bars; (ii) continuity principle and the axiom of choice both for arbitrary formulae; and (iii) $\Sigma _2$ induction and dependent choice. We also show that Markov’s principle MP does not change this situation; that neither does lesser limited principle of omniscience LLPO (except the choice along functions); but that limited principle of omniscience LPO makes the situation completely classical.

We prove a number of results about countable Borel equivalence relations with forcing constructions and arguments. These results reveal hidden regularity properties of Borel complete sections on certain orbits. As consequences they imply the nonexistence of Borel complete sections with certain features.

We explore the possibilities for elementary embeddings $j : M \to N$ , where M and N are models of ZFC with the same ordinals, $M \subseteq N$ , and N has access to large pieces of j. We construct commuting systems of such maps between countable transitive models that are isomorphic to various canonical linear and partial orders, including the real line ${\mathbb R}$ .

Our main result is that there exist structures which cannot be computably recovered from their tree of tuples. This implies that there are structures with no computable copies which nevertheless cannot code any information in a natural/functorial way.

We show in ZFC that the existence of completely separable maximal almost disjoint families of subsets of $\omega $ implies that the modal logic $\mathbf {S4.1.2}$ is complete with respect to the Čech–Stone compactification of the natural numbers, the space $\beta \omega $ . In the same fashion we prove that the modal logic $\mathbf {S4}$ is complete with respect to the space $\omega ^*=\beta \omega \setminus \omega $ . This improves the results of G. Bezhanishvili and J. Harding in [4], where the authors prove these theorems under stronger assumptions ( $\mathfrak {a=c}$ ). Our proof is also somewhat simpler.

Descriptive set theory and computability theory are closely-related fields of logic; both are oriented around a notion of descriptive complexity. However, the two fields typically consider objects of very different sizes; computability theory is principally concerned with subsets of the naturals, while descriptive set theory is interested primarily in subsets of the reals. In this paper, we apply a generalization of computability theory, admissible recursion theory, to consider the relative complexity of notions that are of interest in descriptive set theory. In particular, we examine the perfect set property, determinacy, the Baire property, and Lebesgue measurability. We demonstrate that there is a separation of descriptive complexity between the perfect set property and determinacy for analytic sets of reals; we also show that the Baire property and Lebesgue measurability are both equivalent in complexity to the property of simply being a Borel set, for $\boldsymbol {\Sigma ^{1}_{2}}$ sets of reals.

It is a classic result in modal logic, often referred to as Jónsson-Tarski duality, that the category of modal algebras is dually equivalent to the category of descriptive frames. The latter are Kripke frames equipped with a Stone topology such that the binary relation is continuous. This duality generalizes the celebrated Stone duality for boolean algebras. Our goal is to generalize descriptive frames so that the topology is an arbitrary compact Hausdorff topology. For this, instead of working with the boolean algebra of clopen subsets of a Stone space, we work with the ring of continuous real-valued functions on a compact Hausdorff space. The main novelty is to define a modal operator on such a ring utilizing a continuous relation on a compact Hausdorff space.

Our starting point is the well-known Gelfand duality between the category ${\sf KHaus}$ of compact Hausdorff spaces and the category $\boldsymbol {\mathit {uba}\ell }$ of uniformly complete bounded archimedean $\ell $ -algebras. We endow a bounded archimedean $\ell $ -algebra with a modal operator, which results in the category $\boldsymbol {\mathit {mba}\ell }$ of modal bounded archimedean $\ell $ -algebras. Our main result establishes a dual adjunction between $\boldsymbol {\mathit {mba}\ell }$ and the category ${\sf KHF}$ of what we call compact Hausdorff frames; that is, Kripke frames equipped with a compact Hausdorff topology such that the binary relation is continuous. This dual adjunction restricts to a dual equivalence between ${\sf KHF}$ and the reflective subcategory $\boldsymbol {\mathit {muba}\ell }$ of $\boldsymbol {\mathit {mba}\ell }$ consisting of uniformly complete objects of $\boldsymbol {\mathit {mba}\ell }$ . This generalizes both Gelfand duality and Jónsson-Tarski duality.

A problem is a multivalued function from a set of instances to a set of solutions. We consider only instances and solutions coded by sets of integers. A problem admits preservation of some computability-theoretic weakness property if every computable instance of the problem admits a solution relative to which the property holds. For example, cone avoidance is the ability, given a noncomputable set A and a computable instance of a problem ${\mathsf {P}}$ , to find a solution relative to which A is still noncomputable.

In this article, we compare relativized versions of computability-theoretic notions of preservation which have been studied in reverse mathematics, and prove that the ones which were not already separated by natural statements in the literature actually coincide. In particular, we prove that it is equivalent to admit avoidance of one cone, of $\omega $ cones, of one hyperimmunity or of one non- $\Sigma ^{0}_1$ definition. We also prove that the hierarchies of preservation of hyperimmunity and non- $\Sigma ^{0}_1$ definitions coincide. On the other hand, none of these notions coincide in a nonrelativized setting.

In [20] Krajíček and Pudlák discovered connections between problems in computational complexity and the lengths of first-order proofs of finite consistency statements. Later Pudlák [25] studied more statements that connect provability with computational complexity and conjectured that they are true. All these conjectures are at least as strong as $\mathsf {P}\neq \mathsf {NP}$ [23–25].One of the problems concerning these conjectures is to find out how tightly they are connected with statements about computational complexity classes. Results of this kind had been proved in [20, 22].In this paper, we generalize and strengthen these results. Another question that we address concerns the dependence between these conjectures. We construct two oracles that enable us to answer questions about relativized separations asked in [19, 25] (i.e., for the pairs of conjectures mentioned in the questions, we construct oracles such that one conjecture from the pair is true in the relativized world and the other is false and vice versa). We also show several new connections between the studied conjectures. In particular, we show that the relation between the finite reflection principle and proof systems for existentially quantified Boolean formulas is similar to the one for finite consistency statements and proof systems for non-quantified propositional tautologies.

The notion of a complete type can be generalized in a natural manner to allow assigning a value in an arbitrary Boolean algebra $\mathcal {B}$ to each formula. We show some basic results regarding the effect of the properties of $\mathcal {B}$ on the behavior of such types, and show they are particularity well behaved in the case of NIP theories. In particular, we generalize the third author’s result about counting types, as well as the notion of a smooth type and extending a type to a smooth one. We then show that Keisler measures are tied to certain Boolean types and show that some of the results can thus be transferred to measures—in particular, giving an alternative proof of the fact that every measure in a dependent theory can be extended to a smooth one. We also study the stable case. We consider this paper as an invitation for more research into the topic of Boolean types.

We show that the statement “every universally Baire set of reals has the perfect set property” is equiconsistent modulo ZFC with the existence of a cardinal that we call virtually Shelah for supercompactness (VSS). These cardinals resemble Shelah cardinals and Shelah-for-supercompactness cardinals but are much weaker: if $0^\sharp $ exists then every Silver indiscernible is VSS in L. We also show that the statement $\operatorname {\mathrm {uB}} = {\boldsymbol {\Delta }}^1_2$ , where $\operatorname {\mathrm {uB}}$ is the pointclass of all universally Baire sets of reals, is equiconsistent modulo ZFC with the existence of a $\Sigma _2$ -reflecting VSS cardinal.

We give several new characterizations of the continuous enumeration degrees. The main one proves that an enumeration degree is continuous if and only if it is not half of a nontrivial relativized $\mathcal {K}$ -pair. This leads to a structural dichotomy in the enumeration degrees.

Ramsey’s theorem asserts that every k-coloring of $[\omega ]^n$ admits an infinite monochromatic set. Whenever $n \geq 3$ , there exists a computable k-coloring of $[\omega ]^n$ whose solutions compute the halting set. On the other hand, for every computable k-coloring of $[\omega ]^2$ and every noncomputable set C, there is an infinite monochromatic set H such that $C \not \leq _T H$ . The latter property is known as cone avoidance.

In this article, we design a natural class of Ramsey-like theorems encompassing many statements studied in reverse mathematics. We prove that this class admits a maximal statement satisfying cone avoidance and use it as a criterion to re-obtain many existing proofs of cone avoidance. This maximal statement asserts the existence, for every k-coloring of $[\omega ]^n$ , of an infinite subdomain $H \subseteq \omega $ over which the coloring depends only on the sparsity of its elements. This confirms the intuition that Ramsey-like theorems compute Turing degrees only through the sparsity of its solutions.

Kristiansen and Murwanashyaka recently proved that Robinson arithmetic, Q, is interpretable in an elementary theory of full binary trees, T. We prove that, conversely, T is interpretable in Q by producing a formal interpretation of T in an elementary concatenation theory QT+, thereby also establishing mutual interpretability of T with several well-known weak essentially undecidable theories of numbers, strings, and sets. We also introduce a “hybrid” elementary theory of strings and trees, WQT*, and establish its mutual interpretability with Robinson’s weak arithmetic R, the weak theory of trees WT of Kristiansen and Murwanashyaka, and the weak concatenation theory WTCε of Higuchi and Horihata.

We study the following natural strong variant of destroying Borel ideals: $\mathbb {P}$ $+$ -destroys $\mathcal {I}$ if $\mathbb {P}$ adds an $\mathcal {I}$ -positive set which has finite intersection with every $A\in \mathcal {I}\cap V$ . Also, we discuss the associated variants

$$ \begin{align*} \mathrm{non}^*(\mathcal{I},+)=&\min\big\{|\mathcal{Y}|:\mathcal{Y}\subseteq\mathcal{I}^+,\; \forall\;A\in\mathcal{I}\;\exists\;Y\in\mathcal{Y}\;|A\cap Y|<\omega\big\},\\ \mathrm{cov}^*(\mathcal{I},+)=&\min\big\{|\mathcal{C}|:\mathcal{C}\subseteq\mathcal{I},\; \forall\;Y\in\mathcal{I}^+\;\exists\;C\in\mathcal{C}\;|Y\cap C|=\omega\big\} \end{align*} $$

Among other results, (1) we give a simple combinatorial characterisation when a real forcing $\mathbb {P}_I$ can $+$ -destroy a Borel ideal $\mathcal {J}$ ; (2) we discuss many classical examples of Borel ideals, their $+$ -destructibility, and cardinal invariants; (3) we show that the Mathias–Prikry, $\mathbb {M}(\mathcal {I}^*)$ -generic real $+$ -destroys $\mathcal {I}$ iff $\mathbb {M}(\mathcal {I}^*)\ +$ -destroys $\mathcal {I}$ iff $\mathcal {I}$ can be $+$ -destroyed iff $\mathrm {cov}^*(\mathcal {I},+)>\omega $ ; (4) we characterise when the Laver–Prikry, $\mathbb {L}(\mathcal {I}^*)$ -generic real $+$ -destroys $\mathcal {I}$ , and in the case of P-ideals, when exactly $\mathbb {L}(\mathcal {I}^*)$ $+$ -destroys $\mathcal {I}$ ; and (5) we briefly discuss an even stronger form of destroying ideals closely related to the additivity of the null ideal.

We investigate the structure of ultrafilters on Boolean algebras in the framework of Tukey reducibility. In particular, this paper provides several techniques to construct ultrafilters which are not Tukey maximal. Furthermore, we connect this analysis with a cardinal invariant of Boolean algebras, the ultrafilter number, and prove consistency results concerning its possible values on Cohen and random algebras.

Let $\kappa $ be a regular uncountable cardinal, and a cardinal greater than or equal to $\kappa $ . Revisiting a celebrated result of Shelah, we show that if is close to $\kappa $ and (= the least size of a cofinal subset of ) is greater than , then can be represented (in the sense of pcf theory) as a pseudopower. This can be used to obtain optimal results concerning the splitting problem. For example we show that if and , then no $\kappa $ -complete ideal on is weakly -saturated.

We investigate, in ZFC, the behavior of abstract elementary classes (AECs) categorical in many successive small cardinals. We prove for example that a universal $\mathbb {L}_{\omega _1, \omega }$ sentence categorical on an end segment of cardinals below $\beth _\omega $ must be categorical also everywhere above $\beth _\omega $ . This is done without any additional model-theoretic hypotheses (such as amalgamation or arbitrarily large models) and generalizes to the much broader framework of tame AECs with weak amalgamation and coherent sequences.

In this paper, we give an axiomatization of the ordinal number system, in the style of Dedekind’s axiomatization of the natural number system. The latter is based on a structure $(N,0,s)$ consisting of a set N, a distinguished element $0\in N$ and a function $s\colon N\to N$ . The structure in our axiomatization is a triple $(O,L,s)$ , where O is a class, L is a class function defined on all s-closed ‘subsets’ of O, and s is a class function $s\colon O\to O$ . In fact, we develop the theory relative to a Grothendieck-style universe (minus the power set axiom), as a way of bringing the natural and the ordinal cases under one framework. We also establish a universal property for the ordinal number system, analogous to the well-known universal property for the natural number system.