We consider a real-valued function f defined on the set of infinite branches X of a countably branching pruned tree T. The function f is said to be a limsup function if there is a function $u \colon T \to \mathbb {R}$ such that $f(x) = \limsup _{t \to \infty } u(x_{0},\dots ,x_{t})$ for each $x \in X$. We study a game characterization of limsup functions, as well as a novel game characterization of functions of Baire class 1.

We examine the degree structure $\operatorname {\mathrm {\mathbf {ER}}}$ of equivalence relations on $\omega $ under computable reducibility. We examine when pairs of degrees have a least upper bound. In particular, we show that sufficiently incomparable pairs of degrees do not have a least upper bound but that some incomparable degrees do, and we characterize the degrees which have a least upper bound with every finite equivalence relation. We show that the natural classes of finite, light, and dark degrees are definable in $\operatorname {\mathrm {\mathbf {ER}}}$. We show that every equivalence relation has continuum many self-full strong minimal covers, and that $\mathbf {d}\oplus \mathbf {\operatorname {\mathrm {\mathbf {Id}}}_1}$ needn’t be a strong minimal cover of a self-full degree $\mathbf {d}$. Finally, we show that the theory of the degree structure $\operatorname {\mathrm {\mathbf {ER}}}$ as well as the theories of the substructures of light degrees and of dark degrees are each computably isomorphic with second-order arithmetic.

One prominent criticism of the abstractionist program is the so-called Bad Company objection. The complaint is that abstraction principles cannot in general be a legitimate way to introduce mathematical theories, since some of them are inconsistent. The most notorious example, of course, is Frege’s Basic Law V. A common response to the objection suggests that an abstraction principle can be used to legitimately introduce a mathematical theory precisely when it is stable: when it can be made true on all sufficiently large domains. In this paper, we raise a worry for this response to the Bad Company objection. We argue, perhaps surprisingly, that it requires very strong assumptions about the range of the second-order quantifiers; assumptions that the abstractionist should reject.

Cantor’s first set theory paper (1874) establishes the uncountability of ${\mathbb R}$. We study this most basic mathematical fact formulated in the language of higher-order arithmetic. In particular, we investigate the logical and computational properties of ${\mathsf {NIN}}$ (resp. ${\mathsf {NBI}}$), i.e., the third-order statement there is no injection resp. bijection from $[0,1]$ to ${\mathbb N}$. Working in Kohlenbach’s higher-order Reverse Mathematics, we show that ${\mathsf {NIN}}$ and ${\mathsf {NBI}}$ are hard to prove in terms of (conventional) comprehension axioms, while many basic theorems, like Arzelà’s convergence theorem for the Riemann integral (1885), are shown to imply ${\mathsf {NIN}}$ and/or ${\mathsf {NBI}}$. Working in Kleene’s higher-order computability theory based on S1–S9, we show that the following fourth-order process based on ${\mathsf {NIN}}$ is similarly hard to compute: for a given $[0,1]\rightarrow {\mathbb N}$-function, find reals in the unit interval that map to the same natural number.

A new characterization of tabularity in tense logic is established, namely, a tense logic L is tabular if and only if $\mathsf {tab}_n^T\in L$ for some $n\geq 1$. Two characterization theorems for the Post-completeness in tabular tense logics are given. Furthermore, a characterization of the Post-completeness in the lattice of all tense logics is established. Post numbers of some tense logics are shown.

The technique of forcing is almost ubiquitous in set theory, and it seems to be based on technicalities like the concepts of genericity, forcing names and their evaluations, and on the recursively defined forcing predicates, the definition of which is particularly intricate for the basic case of atomic first order formulas. In his [3], the first author has provided an axiomatic framework for set forcing over models of $\mathrm {ZFC}$ that is a collection of guiding principles for extensions over which one still has control from the ground model, and has shown that these axiomatics necessarily lead to the usual concepts of genericity and of forcing extensions, and also that one can infer from them the usual recursive definition of forcing predicates. In this paper, we present a more general such approach, covering both class forcing and set forcing, over various base theories, and we provide additional details regarding the formal setting that was outlined in [3].

Let P be a forcing notion and $G\subseteq P$ its generic subset. Suppose that we have in $V[G]$ a $\kappa{-}$complete ultrafilter1,2 W over $\kappa $. Set $U=W\cap V$.

The Hilbert program was actually a specific approach for proving consistency, a kind of constructive model theory. Quantifiers were supposed to be replaced by ε-terms. εxA(x) was supposed to denote a witness to $\exists xA(x)$, or something arbitrary if there is none. The Hilbertians claimed that in any proof in a number-theoretic system S, each ε-term can be replaced by a numeral, making each line provable and true. This implies that S must not only be consistent, but also 1-consistent (${\Sigma}_1^0$-correct). Here we show that if the result is supposed to be provable within S, a statement about all ${\Pi}_2^0$ statements that subsumes itself within its own scope must be provable, yielding a contradiction. The result resembles Gödel’s but arises naturally out of the Hilbert program itself.

We systematically study conservation theorems on theories of semi-classical arithmetic, which lie in-between classical arithmetic $\mathsf {PA}$ and intuitionistic arithmetic $\mathsf {HA}$. Using a generalized negative translation, we first provide a structured proof of the fact that $\mathsf {PA}$ is $\Pi _{k+2}$-conservative over $\mathsf {HA} + {\Sigma _k}\text {-}\mathrm {LEM}$ where ${\Sigma _k}\text {-}\mathrm {LEM}$ is the axiom scheme of the law-of-excluded-middle restricted to formulas in $\Sigma _k$. In addition, we show that this conservation theorem is optimal in the sense that for any semi-classical arithmetic T, if $\mathsf {PA}$ is $\Pi _{k+2}$-conservative over T, then ${T}$ proves ${\Sigma _k}\text {-}\mathrm {LEM}$. In the same manner, we also characterize conservation theorems for other well-studied classes of formulas by fragments of classical axioms or rules. This reveals the entire structure of conservation theorems with respect to the arithmetical hierarchy of classical principles.

Let R be a discrete valuation domain with field of fractions Q and maximal ideal generated by $\pi $. Let $\Lambda $ be an R-order such that $Q\Lambda $ is a separable Q-algebra. Maranda showed that there exists $k\in \mathbb {N}$ such that for all $\Lambda $-lattices L and M, if $L/L\pi ^k\simeq M/M\pi ^k$, then $L\simeq M$. Moreover, if R is complete and L is an indecomposable $\Lambda $-lattice, then $L/L\pi ^k$ is also indecomposable. We extend Maranda’s theorem to the class of R-reduced R-torsion-free pure-injective $\Lambda $-modules.

As an application of this extension, we show that if $\Lambda $ is an order over a Dedekind domain R with field of fractions Q such that $Q\Lambda $ is separable, then the lattice of open subsets of the R-torsion-free part of the right Ziegler spectrum of $\Lambda $ is isomorphic to the lattice of open subsets of the R-torsion-free part of the left Ziegler spectrum of $\Lambda $.

Furthermore, with k as in Maranda’s theorem, we show that if M is R-torsion-free and $H(M)$ is the pure-injective hull of M, then $H(M)/H(M)\pi ^k$ is the pure-injective hull of $M/M\pi ^k$. We use this result to give a characterization of R-torsion-free pure-injective $\Lambda $-modules and describe the pure-injective hulls of certain R-torsion-free $\Lambda $-modules.

Assuming $\mathrm{PFA}$, we shall use internally club $\omega _1$-guessing models as side conditions to show that for every tree T of height $\omega _2$ without cofinal branches, there is a proper and $\aleph _2$-preserving forcing notion with finite conditions which specialises T. Moreover, the forcing has the $\omega _1$-approximation property.

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.

It is proved in $\mathsf {ZF}$ (without the axiom of choice) that, for all infinite sets M, there are no surjections from $\omega \times M$ onto $\operatorname {\mathrm {\mathscr {P}}}(M)$.

We investigate the mathematics of a model of the human mind which has been proposed by the psychologist Jens Mammen. Mathematical realizations of this model consists of what the first author (A.T.) has called Mammen spaces, where a Mammen space is a triple $(U,\mathcal S,\mathcal C)$, where U is a non-empty set (“the universe”), $\mathcal S$ is a perfect Hausdorff topology on U, and $\mathcal C\subseteq \mathcal P(U)$ together with $\mathcal S$ satisfy certain axioms.

We refute a conjecture put forward by Hoffmann-Jørgensen, who conjectured that the existence of a “complete” Mammen space implies the Axiom of Choice, by showing that in the first Cohen model, in which ZF holds but AC fails, there is a complete Mammen space. We obtain this by proving that in the first Cohen model, every perfect topology can be extended to a maximal perfect topology.

On the other hand, we also show that if all sets are Lebesgue measurable, or all sets are Baire measurable, then there are no complete Mammen spaces with a countable universe.

Further, we investigate two new cardinal invariants $\mathfrak u_{M}$ and $\mathfrak u_{T}$ associated with complete Mammen spaces and maximal perfect topologies, and establish some basic inequalities that are provable in ZFC. Then we show $\mathfrak u_{M}=\mathfrak u_{T}=2^{\aleph _{0}}$ follows from Martin’s Axiom, and, contrastingly, we show that $\aleph _{1}=\mathfrak u_{M}=\mathfrak u_{T}<2^{\aleph _{0}}=\aleph _{2}$ in the Baumgartner–Laver model.

Finally, consequences for psychology are discussed.

We study model theory of fields with actions of a fixed finite group scheme. We prove the existence and simplicity of a model companion of the theory of such actions, which generalizes our previous results about truncated iterative Hasse–Schmidt derivations [13] and about Galois actions [14]. As an application of our methods, we obtain a new model complete theory of actions of a finite group on fields of finite imperfection degree.

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 introduce natural strengthenings of sequential compactness, the r-Ramsey property for each natural number $r\geq 1$. We prove that metrizable compact spaces are r-Ramsey for all r and give examples of compact spaces that are r-Ramsey but not $(r+1)$-Ramsey for each $r\geq 1$ (assuming Continuum Hypothesis (CH) for all $r>1$). Productivity of the r-Ramsey property is considered.

Let${\mathbb M}$ be an affine variety equipped with a foliation, both defined over a number field ${\mathbb K}$. For an algebraic $V\subset {\mathbb M}$ over ${\mathbb K}$, write $\delta _{V}$ for the maximum of the degree and log-height of V. Write $\Sigma _{V}$ for the points where the leaves intersect V improperly. Fix a compact subset ${\mathcal B}$ of a leaf ${\mathcal L}$. We prove effective bounds on the geometry of the intersection ${\mathcal B}\cap V$. In particular, when $\operatorname {codim} V=\dim {\mathcal L}$ we prove that $\#({\mathcal B}\cap V)$ is bounded by a polynomial in $\delta _{V}$ and $\log \operatorname {dist}^{-1}({\mathcal B},\Sigma _{V})$. Using these bounds we prove a result on the interpolation of algebraic points in images of ${\mathcal B}\cap V$ by an algebraic map $\Phi $. For instance, under suitable conditions we show that $\Phi ({\mathcal B}\cap V)$ contains at most $\operatorname {poly}(g,h)$ algebraic points of log-height h and degree g.

We deduce several results in Diophantine geometry. Following Masser and Zannier, we prove that given a pair of sections $P,Q$ of a nonisotrivial family of squares of elliptic curves that do not satisfy a constant relation, whenever $P,Q$ are simultaneously torsion their order of torsion is bounded effectively by a polynomial in $\delta _{P},\delta _{Q}$; in particular, the set of such simultaneous torsion points is effectively computable in polynomial time. Following Pila, we prove that given $V\subset {\mathbb C}^{n}$, there is an (ineffective) upper bound, polynomial in $\delta _{V}$, for the degrees and discriminants of maximal special subvarieties; in particular, it follows that the André–Oort conjecture for powers of the modular curve is decidable in polynomial time (by an algorithm depending on a universal, ineffective Siegel constant). Following Schmidt, we show that our counting result implies a Galois-orbit lower bound for torsion points on elliptic curves of the type previously obtained using transcendence methods by David.

Theorems of hyperarithmetic analysis (THAs) occupy an unusual neighborhood in the realms of reverse mathematics and recursion-theoretic complexity. They lie above all the fixed (recursive) iterations of the Turing jump but below ATR$_{0}$ (and so $\Pi _{1}^{1}$-CA$_{0}$ or the hyperjump). There is a long history of proof-theoretic principles which are THAs. Until the papers reported on in this communication, there was only one mathematical example. Barnes, Goh, and Shore [1] analyze an array of ubiquity theorems in graph theory descended from Halin’s [9] work on rays in graphs. They seem to be typical applications of ACA$_{0}$ but are actually THAs. These results answer Question 30 of Montalbán’s Open Questions in Reverse Mathematics [19] and supply several other natural principles of different and unusual levels of complexity.

This work led in [25] to a new neighborhood of the reverse mathematical zoo: almost theorems of hyperarithmetic analysis (ATHAs). When combined with ACA$_{0}$ they are THAs but on their own are very weak. Denizens both mathematical and logical are provided. Generalizations of several conservativity classes ($\Pi _{1}^{1}$, r-$\Pi _{1}^{1}$, and Tanaka) are defined and these ATHAs as well as many other principles are shown to be conservative over RCA$_{0}$ in all these senses and weak in other recursion-theoretic ways as well. These results answer a question raised by Hirschfeldt and reported in [19] by providing a long list of pairs of principles one of which is very weak over RCA$_{0}$ but over ACA$_{0}$ is equivalent to the other which may be strong (THA) or very strong going up a standard hierarchy and at the end being stronger than full second-order arithmetic.

A number of spectrum constructions have been devised to extract topological spaces from algebraic data. Prominent examples include the Zariski spectrum of a commutative ring, the Stone spectrum of a bounded distributive lattice, the Gelfand spectrum of a commutative unital C*-algebra and the Hofmann–Lawson spectrum of a continuous frame.

Inspired by the examples above, we define a spectrum for localic semirings. We use arguments in the symmetric monoidal category of suplattices to prove that, under conditions satisfied by the aforementioned examples, the spectrum can be constructed as the frame of overt weakly closed radical ideals and that it reduces to the usual constructions in those cases. Our proofs are constructive.

Our approach actually gives ‘quantalic’ spectrum from which the more familiar localic spectrum can then be derived. For a discrete ring this yields the quantale of ideals and in general should contain additional ‘differential’ information about the semiring.