In the study of the arithmetic degrees the $\omega \text {-REA}$ sets play a role analogous to the role the r.e. degrees play in the study of the Turing degrees. However, much less is known about the arithmetic degrees and the role of the $\omega \text {-REA}$ sets in that structure than about the Turing degrees. Indeed, even basic questions such as the existence of an $\omega \text {-REA}$ set of minimal arithmetic degree are open. This paper makes progress on this question by demonstrating that some promising approaches inspired by the analogy with the r.e. sets fail to show that no $\omega \text {-REA}$ set is arithmetically minimal. Finally, it constructs a $\prod ^0_{2}$ singleton of minimal arithmetic degree. Not only is this a result of considerable interest in its own right, constructions of $\prod ^0_{2}$ singletons often pave the way for constructions of $\omega \text {-REA}$ sets with similar properties. Along the way, a number of interesting results relating arithmetic reducibility and rates of growth are established.

We initiate a systematic study of generic stability independence and introduce the class of treeless theories in which this notion of independence is particularly well behaved. We show that the class of treeless theories contains both binary theories and stable theories and give several applications of the theory of independence for treeless theories. As a corollary, we show that every binary NSOP$_{3}$ theory is simple.

We present the true stages machinery and illustrate its applications to descriptive set theory. We use this machinery to provide new proofs of the Hausdorff–Kuratowski and Wadge theorems on the structure of $\mathbf {\Delta }^0_\xi $, Louveau and Saint Raymond’s separation theorem, and Louveau’s separation theorem.

A partition is finitary if all its members are finite. For a set A, $\mathscr {B}(A)$ denotes the set of all finitary partitions of A. It is shown consistent with $\mathsf {ZF}$ (without the axiom of choice) that there exist an infinite set A and a surjection from A onto $\mathscr {B}(A)$. On the other hand, we prove in $\mathsf {ZF}$ some theorems concerning $\mathscr {B}(A)$ for infinite sets A, among which are the following:

1. (1) If there is a finitary partition of A without singleton blocks, then there are no surjections from A onto $\mathscr {B}(A)$ and no finite-to-one functions from $\mathscr {B}(A)$ to A.

2. (2) For all $n\in \omega $, $|A^n|<|\mathscr {B}(A)|$.

3. (3) $|\mathscr {B}(A)|\neq |\mathrm {seq}(A)|$, where $\mathrm {seq}(A)$ is the set of all finite sequences of elements of A.

Let $\Omega $ be a complex lattice which does not have complex multiplication and $\wp =\wp _\Omega $ the Weierstrass $\wp $-function associated with it. Let $D\subseteq \mathbb {C}$ be a disc and $I\subseteq \mathbb {R}$ be a bounded closed interval such that $I\cap \Omega =\varnothing $. Let $f:D\rightarrow \mathbb {C}$ be a function definable in $(\overline {\mathbb {R}},\wp |_I)$. We show that if f is holomorphic on D then f is definable in $\overline {\mathbb {R}}$. The proof of this result is an adaptation of the proof of Bianconi for the $\mathbb {R}_{\exp }$ case. We also give a characterization of lattices with complex multiplication in terms of definability and a nondefinability result for the modular j-function using similar methods.

The one-variable fragment of a first-order logic may be viewed as an “S5-like” modal logic, where the universal and existential quantifiers are replaced by box and diamond modalities, respectively. Axiomatizations of these modal logics have been obtained for special cases—notably, the modal counterparts $\mathrm {S5}$ and $\mathrm {MIPC}$ of the one-variable fragments of first-order classical logic and first-order intuitionistic logic, respectively—but a general approach, extending beyond first-order intermediate logics, has been lacking. To this end, a sufficient criterion is given in this paper for the one-variable fragment of a semantically defined first-order logic—spanning families of intermediate, substructural, many-valued, and modal logics—to admit a certain natural axiomatization. More precisely, an axiomatization is obtained for the one-variable fragment of any first-order logic based on a variety of algebraic structures with a lattice reduct that has the superamalgamation property, using a generalized version of a functional representation theorem for monadic Heyting algebras due to Bezhanishvili and Harding. An alternative proof-theoretic strategy for obtaining such axiomatization results is also developed for first-order substructural logics that have a cut-free sequent calculus and admit a certain interpolation property.

Consider a variant of the usual story about the iterative conception of sets. As usual, at every stage, you find all the (bland) sets of objects which you found earlier. But you also find the result of tapping any earlier-found object with any magic wand (from a given stock of magic wands).

By varying the number and behaviour of the wands, we can flesh out this idea in many different ways. This paper's main Theorem is that any loosely constructive way of fleshing out this idea is synonymous with a ZF-like theory.

This Theorem has rich applications; it realizes John Conway's (1976) Mathematicians' Liberation Movement; and it connects with a lovely idea due to Alonzo Church (1974).

We investigate whether ordinary quantification over objects is an extensional phenomenon, or rather creates non-extensional contexts; each claim having been propounded by prominent philosophers. It turns out that the question only makes sense relative to a background theory of syntax and semantics (here called a grammar) that goes well beyond the inductive definition of formulas and the recursive definition of satisfaction. Two schemas for building quantificational grammars are developed, one that invariably constructs extensional grammars (in which quantification, in particular, thus behaves extensionally) and another that only generates non-extensional grammars (and in which quantification is responsible for the failure of extensionality). We then ask whether there are reasons to favor one of these grammar schemas over the other, and examine an argument according to which the proper formalization of deictic utterances requires adoption of non-extensional grammars.

We study a version of the Craig interpolation theorem formulated in the framework of the theory of institutions. This formulation proved crucial in the development of a number of key results concerning foundations of software specification and formal development. We investigate preservation of interpolation properties under institution extensions by new models and sentences. We point out that some interpolation properties remain stable under such extensions, even if quite arbitrary new models and sentences are permitted. We give complete characterisations of such situations for institution extensions by new models, by new sentences, as well as by new models and sentences, respectively.

The original Specker–Blatter theorem (1983) was formulated for classes of structures $\mathcal {C}$ of one or several binary relations definable in Monadic Second Order Logic MSOL. It states that the number of such structures on the set $[n]$ is modularly C-finite (MC-finite). In previous work we extended this to structures definable in CMSOL, MSOL extended with modular counting quantifiers. The first author also showed that the Specker–Blatter theorem does not hold for one quaternary relation (2003).

If the vocabulary allows a constant symbol c, there are n possible interpretations on $[n]$ for c. We say that a constant c is hard-wired if c is always interpreted by the same element $j \in [n]$. In this paper we show:

1. (i) The Specker–Blatter theorem also holds for CMSOL when hard-wired constants are allowed. The proof method of Specker and Blatter does not work in this case.

2. (ii) The Specker–Blatter theorem does not hold already for $\mathcal {C}$ with one ternary relation definable in First Order Logic FOL. This was left open since 1983.

Using hard-wired constants allows us to show MC-finiteness of counting functions of various restricted partition functions which were not known to be MC-finite till now. Among them we have the restricted Bell numbers $B_{r,A}$, restricted Stirling numbers of the second kind $S_{r,A}$ or restricted Lah-numbers $L_{r,A}$. Here r is a non-negative integer and A is an ultimately periodic set of non-negative integers.

We give three counterexamples to the folklore claim that in an arbitrary theory, if a complete type p over a set B does not divide over $C\subseteq B$, then no extension of p to a complete type over $\operatorname {acl}(B)$ divides over C. Two of our examples are also the first known theories where all sets are extension bases for nonforking, but forking and dividing differ for complete types (answering a question of Adler). One example is an $\mathrm {NSOP}_1$ theory with a complete type that forks, but does not divide, over a model (answering a question of d’Elbée). Moreover, dividing independence fails to imply M-independence in this example (which refutes another folklore claim). In addition to these counterexamples, we summarize various related properties of dividing that are still true. We also address consequences for previous literature, including an earlier unpublished result about forking and dividing in free amalgamation theories, and some claims about dividing in the theory of generic $K_{m,n}$-free incidence structures.

The aim of this paper is to study supersoluble skew braces, a class of skew braces that encompasses all finite skew braces of square-free order. It turns out that finite supersoluble skew braces have Sylow towers and that in an arbitrary supersoluble skew brace B many relevant skew brace-theoretical properties are easier to identify: For example, a centrally nilpotent ideal of B is B-centrally nilpotent, a fact that simplifies the computational search for the Fitting ideal; also, B has finite multipermutational level if and only if $(B,+)$ is nilpotent.

Given a finite presentation of the structure skew brace $G(X,r)$ associated with a finite nondegenerate solution of the Yang–Baxter equation (YBE), there is an algorithm that decides if $G(X,r)$ is supersoluble or not. Moreover, supersoluble skew braces are examples of almost polycyclic skew braces, so they give rise to solutions of the YBE on which one can algorithmically work on.

We prove an effective version of the Lopez-Escobar theorem for continuous domains. Let $Mod(\tau )$ be the set of countable structures with universe $\omega $ in vocabulary $\tau $ topologized by the Scott topology. We show that an invariant set $X\subseteq Mod(\tau )$ is $\Pi ^0_\alpha $ in the Borel hierarchy of this topology if and only if it is definable by a $\Pi ^p_\alpha $-formula, a positive $\Pi ^0_\alpha $ formula in the infinitary logic $L_{\omega _1\omega }$. As a corollary of this result we obtain a new pullback theorem for positive computable embeddings: Let $\mathcal {K}$ be positively computably embeddable in $\mathcal {K}'$ by $\Phi $, then for every $\Pi ^p_\alpha $ formula $\xi $ in the vocabulary of $\mathcal {K}'$ there is a $\Pi ^p_\alpha $ formula $\xi ^{*}$ in the vocabulary of $\mathcal {K}$ such that for all $\mathcal {A}\in \mathcal {K}$, $\mathcal {A}\models \xi ^{*}$ if and only if $\Phi (\mathcal {A})\models \xi $. We use this to obtain new results on the possibility of positive computable embeddings into the class of linear orderings.

We extend the Becker–Kechris topological realization and change-of-topology theorems for Polish group actions in several directions. For Polish group actions, we prove a single result that implies the original Becker–Kechris theorems, as well as Sami’s and Hjorth’s sharpenings adapted levelwise to the Borel hierarchy; automatic continuity of Borel actions via homeomorphisms and the equivalence of ‘potentially open’ versus ‘orbitwise open’ Borel sets. We also characterize ‘potentially open’ n-ary relations, thus yielding a topological realization theorem for invariant Borel first-order structures. We then generalize to groupoid actions and prove a result subsuming Lupini’s Becker–Kechris-type theorems for open Polish groupoids, newly adapted to the Borel hierarchy, as well as topological realizations of actions on fiberwise topological bundles and bundles of first-order structures.

Our proof method is new even in the classical case of Polish groups and is based entirely on formal algebraic properties of category quantifiers; in particular, we make no use of either metrizability or the strong Choquet game. Consequently, our proofs work equally well in the non-Hausdorff context, for open quasi-Polish groupoids and more generally in the point-free context, for open localic groupoids.

We introduce a natural two-cardinal version of Bagaria’s sequence of derived topologies on ordinals. We prove that for our sequence of two-cardinal derived topologies, limit points of sets can be characterized in terms of a new iterated form of pairwise simultaneous reflection of certain kinds of stationary sets, the first few instances of which are often equivalent to notions related to strong stationarity, which has been studied previously in the context of strongly normal ideals. The non-discreteness of these two-cardinal derived topologies can be obtained from certain two-cardinal indescribability hypotheses, which follow from local instances of supercompactness. Additionally, we answer several questions posed by the first author, Holy and White on the relationship between Ramseyness and indescribability in both the cardinal context and in the two-cardinal context.

We prove that, for any countable acylindrically hyperbolic group G, there exists a generating set S of G such that the corresponding Cayley graph $\Gamma (G,S)$ is hyperbolic, $|\partial \Gamma (G,S)|>2$, the natural action of G on $\Gamma (G,S)$ is acylindrical and the natural action of G on the Gromov boundary $\partial \Gamma (G,S)$ is hyperfinite. This result broadens the class of groups that admit a non-elementary acylindrical action on a hyperbolic space with a hyperfinite boundary action.

We investigate the notion of a semi-retraction between two first-order structures (in typically different signatures) that was introduced by the second author as a link between the Ramsey property and generalized indiscernible sequences. We look at semi-retractions through a new lens establishing transfers of the Ramsey property and finite Ramsey degrees under quite general conditions that are optimal as demonstrated by counterexamples. Finally, we compare semi-retractions to the category theoretic notion of a pre-adjunction.

We prove that the opposite of the category of coalgebras for the Vietoris endofunctor on the category of compact Hausdorff spaces is monadic over $\mathsf {Set}$. We deliver an analogous result for the upper, lower, and convex Vietoris endofunctors acting on the category of stably compact spaces. We provide axiomatizations of the associated (infinitary) varieties. This can be seen as a version of Jónsson–Tarski duality for modal algebras beyond the zero-dimensional setting.

This paper initiates the reverse mathematics of social choice theory, studying Arrow’s impossibility theorem and related results including Fishburn’s possibility theorem and the Kirman–Sondermann theorem within the framework of reverse mathematics. We formalise fundamental notions of social choice theory in second-order arithmetic, yielding a definition of countable society which is tractable in ${\mathsf {RCA}}_0$. We then show that the Kirman–Sondermann analysis of social welfare functions can be carried out in ${\mathsf {RCA}}_0$. This approach yields a proof of Arrow’s theorem in ${\mathsf {RCA}}_0$, and thus in $\mathrm {PRA}$, since Arrow’s theorem can be formalised as a $\Pi ^0_1$ sentence. Finally we show that Fishburn’s possibility theorem for countable societies is equivalent to ${\mathsf {ACA}}_0$ over ${\mathsf {RCA}}_0$.

We develop the theory of cofinal types of ultrafilters over measurable cardinals and establish its connections to Galvin’s property. We generalize fundamental results from the countable to the uncountable, but often in surprisingly strengthened forms, and present models with varying structures of the cofinal types of ultrafilters over measurable cardinals.