Sahlqvist theory is extended to the fragments of the intuitionistic propositional calculus that include the conjunction connective. This allows us to introduce a Sahlqvist theory of intuitionistic character amenable to arbitrary protoalgebraic deductive systems. As an application, we obtain a Sahlqvist theorem for the fragments of the intuitionistic propositional calculus that include the implication connective and for the extensions of the intuitionistic linear logic.

Reverse Mathematics (RM hereafter) is a program in the foundations of mathematics where the aim is to identify the minimal axioms needed to prove a given theorem from ordinary, i.e., non-set theoretic, mathematics. This program has unveiled surprising regularities: the minimal axioms are very often equivalent to the theorem over the base theory, a weak system of ‘computable mathematics’, while most theorems are either provable in this base theory, or equivalent to one of only four logical systems. The latter plus the base theory are called the ‘Big Five’ and the associated equivalences are robust following Montalbán, i.e., stable under small variations of the theorems at hand. Working in Kohlenbach’s higher-order RM, we obtain two new and long series of equivalences based on theorems due to Bolzano, Weierstrass, Jordan, and Cantor; these equivalences are extremely robust and have no counterpart among the Big Five systems. Thus, higher-order RM is much richer than its second-order cousin, boasting at least two extra ‘Big’ systems.

In this paper, we characterize the possible cofinalities of the least $\lambda $-strongly compact cardinal. We show that, on the one hand, for any regular cardinal, $\delta $, that carries a $\lambda $-complete uniform ultrafilter, it is consistent, relative to the existence of a supercompact cardinal above $\delta $, that the least $\lambda $-strongly compact cardinal has cofinality $\delta $. On the other hand, provably the cofinality of the least $\lambda $-strongly compact cardinal always carries a $\lambda $-complete uniform ultrafilter.

Several different versions of the theory of numerosities have been introduced in the literature. Here, we unify these approaches in a consistent frame through the notion of set of labels, relating numerosities with the Kiesler field of Euclidean numbers. This approach allows us to easily introduce, by means of numerosities, ordinals and their natural operations, as well as the Lebesgue measure as a counting measure on the reals.

We obtain, for the first time, a modular many-valued semantics for combined logics, which is built directly from many-valued semantics for the logics being combined, by means of suitable universal operations over partial non-deterministic logical matrices. Our constructions preserve finite-valuedness in the context of multiple-conclusion logics, whereas, unsurprisingly, it may be lost in the context of single-conclusion logics. Besides illustrating our constructions over a wide range of examples, we also develop concrete applications of our semantic characterizations, namely regarding the semantics of strengthening a given many-valued logic with additional axioms, the study of conditions under which a given logic may be seen as a combination of simpler syntactically defined fragments whose calculi can be obtained independently and put together to form a calculus for the whole logic, and also general conditions for decidability to be preserved by the combination mechanism.

It is proved that for every positive integer n, the number of non-Tukey-equivalent directed sets of cardinality $\leq \aleph _n$ is at least $c_{n+2}$, the $(n+2)$-Catalan number. Moreover, the class $\mathcal D_{\aleph _n}$ of directed sets of cardinality $\leq \aleph _n$ contains an isomorphic copy of the poset of Dyck $(n+2)$-paths. Furthermore, we give a complete description whether two successive elements in the copy contain another directed set in between or not.

This paper seeks to build on the extensive connections that have arisen between automata theory, combinatorics on words, fractal geometry, and model theory. Results in this paper establish a characterization for the behavior of the fractal geometry of “k-automatic” sets, subsets of $[0,1]^d$ that are recognized by Büchi automata. The primary tools for building this characterization include the entropy of a regular language and the digraph structure of an automaton. Via an analysis of the strongly connected components of such a structure, we give an algorithmic description of the box-counting dimension, Hausdorff dimension, and Hausdorff measure of the corresponding subset of the unit box. Applications to definability in model-theoretic expansions of the real additive group are laid out as well.

Lindström’s theorem obviously fails as a characterization of first-order logic without identity ($\mathcal {L}_{\omega \omega }^{-} $). In this note, we provide a fix: we show that $\mathcal {L}_{\omega \omega }^{-} $ is a maximal abstract logic satisfying a weak form of the isomorphism property (suitable for identity-free languages and studied in [11]), the Löwenheim–Skolem property, and compactness. Furthermore, we show that compactness can be replaced by being recursively enumerable for validity under certain conditions. In the proofs, we use a form of strong upwards Löwenheim–Skolem theorem not available in the framework with identity.

Assuming the existence of suitable large cardinals, we show it is consistent that the Provability logic $\mathbf {GL}$ is complete with respect to the filter sequence of normal measures. This result answers a question of Andreas Blass from 1990 and a related question of Beklemishev and Joosten.

The uncountability of $\mathbb {R}$ is one of its most basic properties, known far outside of mathematics. Cantor’s 1874 proof of the uncountability of $\mathbb {R}$ even appears in the very first paper on set theory, i.e., a historical milestone. In this paper, we study the uncountability of ${\mathbb R}$ in Kohlenbach’s higher-order Reverse Mathematics (RM for short), in the guise of the following principle:

$$\begin{align*}\mathit{for \ a \ countable \ set } \ A\subset \mathbb{R}, \mathit{\ there \ exists } \ y\in \mathbb{R}\setminus A. \end{align*}$$

An important conceptual observation is that the usual definition of countable set—based on injections or bijections to ${\mathbb N}$—does not seem suitable for the RM-study of mainstream mathematics; we also propose a suitable (equivalent over strong systems) alternative definition of countable set, namely union over ${\mathbb N}$ of finite sets; the latter is known from the literature and closer to how countable sets occur ‘in the wild’. We identify a considerable number of theorems that are equivalent to the centred theorem based on our alternative definition. Perhaps surprisingly, our equivalent theorems involve most basic properties of the Riemann integral, regulated or bounded variation functions, Blumberg’s theorem, and Volterra’s early work circa 1881. Our equivalences are also robust, promoting the uncountability of ${\mathbb R}$ to the status of ‘big’ system in RM.

Tangled Type Theory was introduced by Randall Holmes in [3] as a new way of approaching the consistency problem for $\mathrm {NF}$. Although the task of finding models for this theory is far from trivial (considering it is equiconsistent with $\mathrm {NF}$), ways of constructing models for certain fragments of it have been discovered. In this article, we present a simpler way of constructing models of predicative Tangled Type Theory and consequently of predicative $\mathrm {NF}$. In these new models of predicative $\mathrm {NF}$, the universe is well-orderable and equinumerous to the set of singletons.

Orthogonality in model theory captures the idea of absence of non-trivial interactions between definable sets. We introduce a somewhat opposite notion of cohesiveness, capturing the idea of interaction among all parts of a given definable set. A cohesive set is indecomposable, in the sense that if it is internal to the product of two orthogonal sets, then it is internal to one of the two. We prove that a definable group in an o-minimal structure is a product of cohesive orthogonal subsets. If the group has dimension one, or it is definably simple, then it is itself cohesive. As an application, we show that an abelian group definable in the disjoint union of finitely many o-minimal structures is a quotient, by a discrete normal subgroup, of a direct product of locally definable groups in the single structures.

We study the isomorphism relation on Borel classes of locally compact Polish metric structures. We prove that isomorphism on such classes is always classifiable by countable structures (equivalently: Borel reducible to graph isomorphism), which implies, in particular, that isometry of locally compact Polish metric spaces is Borel reducible to graph isomorphism. We show that potentially $\boldsymbol {\Pi }^{0}_{\alpha + 1}$ isomorphism relations are Borel reducible to equality on hereditarily countable sets of rank $\alpha $, $\alpha \geq 2$. We also study approximations of the Hjorth-isomorphism game, and formulate a condition ruling out classifiability by countable structures.

We show the consistency, relative to the appropriate supercompactness or strong compactness assumptions, of the existence of a non-supercompact strongly compact cardinal $\kappa _0$ (the least measurable cardinal) exhibiting properties which are impossible when $\kappa _0$ is supercompact. In particular, we construct models in which $\square _{\kappa ^+}$ holds for every inaccessible cardinal $\kappa $ except $\kappa _0$, GCH fails at every inaccessible cardinal except $\kappa _0$, and $\kappa _0$ is less than the least Woodin cardinal.

We give a new characterization of the cardinal invariant $\mathfrak {d}$ as the minimal cardinality of a family $\mathcal {D}$ of tall summable ideals such that an ultrafilter is rapid if and only if it has non-empty intersection with all the ideals in the family $\mathcal {D}$. On the other hand, we prove that in the Miller model, given any family $\mathcal {D}$ of analytic tall p-ideals such that $\vert \mathcal {D}\vert <\mathfrak {d}$, there is an ultrafilter $\mathcal {U}$ which is an $\mathscr {I}$-ultrafilter for all ideals $\mathscr {I}\in \mathcal {D}$ at the same time, yet $\mathcal {U}$ is not a rapid ultrafilter. As a corollary, we obtain that in the Miller model, given any analytic tall p-ideal $\mathscr {I}$, $\mathscr {I}$-ultrafilters are dense in the Rudin–Blass ordering, generalizing a theorem of Bartoszyński and S. Shelah, who proved that in such model, Hausdorff ultrafilters are dense in the Rudin–Blass ordering. This theorem also shows some limitations about possible generalizations of a theorem of C. Laflamme and J. Zhu.

We show that under $\mathsf {BMM}$ and “there exists a Woodin cardinal,$"$ the nonstationary ideal on $\omega _1$ cannot be defined by a $\Pi _1$ formula with parameter $A \subset \omega _1$. We show that the same conclusion holds under the assumption of Woodin’s $(\ast )$-axiom. We further show that there are universes where $\mathsf {BPFA}$ holds and $\text {NS}_{\omega _1}$ is $\Pi _1(\{\omega _1\})$-definable. Lastly we show that if the canonical inner model with one Woodin cardinal $M_1$ exists, there is a generic extension of $M_1$ in which $\text {NS}_{\omega _1}$ is saturated and $\Pi _1(\{ \omega _1\} )$-definable, and $\mathsf {MA_{\omega _1}}$ holds.

Assume that M is a transitive model of $ZFC+CH$ containing a simplified $(\omega _1,2)$-morass, $P\in M$ is the poset adding $\aleph _3$ generic reals and G is P-generic over M. In M we construct a function between sets of terms in the forcing language, that interpreted in $M[G]$ is an $\mathbb R$-linear order-preserving monomorphism from the finite elements of an ultrapower of the reals, over a non-principal ultrafilter on $\omega $, into the Esterle algebra of formal power series. Therefore it is consistent that $2^{\aleph _0}>\aleph _2$ and, for any infinite compact Hausdorff space X, there exists a discontinuous homomorphism of $C(X)$, the algebra of continuous real-valued functions on X.

We answer a question of Usuba by showing that the combinatorial principle $\mathrm {UB}_\lambda $ can fail at a singular cardinal. Furthermore, $\lambda $ can be taken to be $\aleph _\omega .$

Let $\mathcal {S}$ be a family of nonempty sets with VC-codensity less than $2$. We prove that, if $\mathcal {S}$ has the $(\omega ,2)$-property (for any infinitely many sets in $\mathcal {S}$, at least two among them intersect), then $\mathcal {S}$ can be partitioned into finitely many subfamilies, each with the finite intersection property. If $\mathcal {S}$ is definable in some first-order structure, then these subfamilies can be chosen definable too.

This is a strengthening of the case $q=2$ of the definable $(p,q)$-conjecture in model theory [9] and the Alon–Kleitman–Matoušek $(p,q)$-theorem in combinatorics [6].

${\mathsf {CAC\ for\ trees}}$ is the statement asserting that any infinite subtree of $\mathbb {N}^{<\mathbb {N}}$ has an infinite path or an infinite antichain. In this paper, we study the computational strength of this theorem from a reverse mathematical viewpoint. We prove that ${\mathsf {CAC\ for\ trees}}$ is robust, that is, there exist several characterizations, some of which already appear in the literature, namely, the statement $\mathsf {SHER}$ introduced by Dorais et al. [8], and the statement $\mathsf {TAC}+\mathsf {B}\Sigma ^0_2$ where $\mathsf {TAC}$ is the tree antichain theorem introduced by Conidis [6]. We show that ${\mathsf {CAC\ for\ trees}}$ is computationally very weak, in that it admits probabilistic solutions.