Set Theory

Ein Beispiel für die Rezeption und Fortführung der schopenhauerschen Logik findet man in den Mathematiklehrbüchern Friedrich Adolph Wilhelm Diesterwegs (1790–1866), In diesem Aufsatz werden die historische und systematische Dimension dieser Anwendung von Logikdiagramme auf die Mathematik skizziert. In Kapitel 2 wird zunächst die frühe Rezeption der schopenhauerschen Logik und Philosophie der Mathematik vorgestellt. Dabei werden einige oftmals tradierte Vorurteile, die das Werk Schopenhauers betreffen, in Frage gestellt oder sogar ausgeräumt. In Kapitel 3 wird dann die Philosophie der Mathematik und der (...) Logik Schopenhauers vorgestellt. Es wird gezeigt, dass Schopenhauers Logikdiagramme auf Ideen der Mathematiker Leonhard Euler (1707–1783), Bernhard Friedrich Thibaut (1775–1832) und Franz Ferdinand Schweins (1780–1856) zurückgehen und dass Schopenhauer diese Logikdiagramme auch bereits zur Analyse mathematischer Begriffe verwendet. Kapitel 4 beschäftigt sich mit der Schopenhauer-Rezeption Diesterwegs. Es wird die Frage behandelt, inwieweit Diesterweg in der Mathematik von Schopenhauer beeinflusst war und welche Rolle dieser Einfluss auf sein Verständnis von Logik und Mathematik hatte. In Kapitel 5 wird schließlich gezeigt, dass Diesterweg die schopenhauersche Begriffsanalyse der Mathematik mit Hilfe von Logikdiagrammen aufgreift und weiterführt. Da Diesterweg einer der einflussreichsten Pädagogen und Mathematikdidaktiker des 20. Jahrhunderts war, ist anzunehmen, dass sich Spuren dieser Methode noch heute finden lassen. Inwiefern dies wahrscheinlich ist, wird in der Zusammenfassung (Kapitel 6) thematisiert. (shrink)

Journal of Mathematical Logic, Volume 22, Issue 03, December 2022. Hirschfeldt and Jockusch (2016) introduced a two-player game in which winning strategies for one or the other player precisely correspond to implications and non-implications between [math] principles over [math]-models of [math]. They also introduced a version of this game that similarly captures provability over [math]. We generalize and extend this game-theoretic framework to other formal systems, and establish a certain compactness result that shows that if an implication [math] between two (...) principles holds, then there exists a winning strategy that achieves victory in a number of moves bounded by a number independent of the specific run of the game. This compactness result generalizes an old proof-theoretic fact noted by H. Wang (1981), and has applications to the reverse mathematics of combinatorial principles. We also demonstrate how this framework leads to a new kind of analysis of the logical strength of mathematical problems that refines both that of reverse mathematics and that of computability-theoretic notions such as Weihrauch reducibility, allowing for a kind of fine-structural comparison between [math] principles that has both computability-theoretic and proof-theoretic aspects, and can help us distinguish between these, for example by showing that a certain use of a principle in a proof is “purely proof-theoretic”, as opposed to relying on its computability-theoretic strength. We give examples of this analysis to a number of principles at the level of [math], uncovering new differences between their logical strengths. (shrink)

In Part I of this series [A. Poveda, A. Rinot and D. Sinapova, Sigma-Prikry forcing I: The axioms, Canad. J. Math. 73(5) (2021) 1205–1238], we introduced a class of notions of forcing which we call [Formula: see text]-Prikry, and showed that many of the known Prikry-type notions of forcing that center around singular cardinals of countable cofinality are [Formula: see text]-Prikry. We showed that given a [Formula: see text]-Prikry poset [Formula: see text] and a [Formula: see text]-name for a non-reflecting (...) stationary set [Formula: see text], there exists a corresponding [Formula: see text]-Prikry poset that projects to [Formula: see text] and kills the stationarity of [Formula: see text]. In this paper, we develop a general scheme for iterating [Formula: see text]-Prikry posets and, as an application, we blow up the power of a countable limit of Laver-indestructible supercompact cardinals, and then iteratively kill all non-reflecting stationary subsets of its successor. This yields a model in which the singular cardinal hypothesis fails and simultaneous reflection of finite families of stationary sets holds. (shrink)

An increasing amount of contemporary philosophy of mathematics posits, and theorizes in terms of special kinds of mathematical modality. The goal of this paper is to bring recent work on higher-order metaphysics to bear on the investigation of these modalities. -/- The main focus of the paper will be views that posit mathematical contingency or indeterminacy about statements that concern the `width' of the set theoretic universe, such as Cantor's continuum hypothesis. In the higher-order framework I show that contingency about (...) the width of the set-theoretic universe refutes two orthodoxies concerning the structure of modal reality: the view that the broadest necessity has a logic of S5, and the `Leibniz biconditionals' stating that what is possible, in the broadest sense of possible, is what is true in some possible world. Nonetheless, I argue that the underlying picture of modal set-theory is coherent and has natural models. (shrink)

It is well known that the set of algebraic numbers (let us call it A) is countable. In this paper, instead of the usage of the classical terminology of cardinals proposed by Cantor, a recently introduced methodology using ①-based infinite numbers is applied to measure the set A (where the number ① is called grossone). Our interest to this methodology is explained by the fact that in certain cases where cardinals allow one to say only whether a set is countable (...) or it has the cardinality of the continuum, the ①-based methodology can provide a more accurate measurement of infinite sets. In this article, lower and upper estimates of the number of elements of A are obtained. Both estimates are expressed in ①-based numbers. (shrink)

In this paper, we generalize the soft set to the hypersoft set by transforming the function F into a multi-attribute function. Then we introduce the hybrids of Crisp, Fuzzy, Intuitionistic Fuzzy, Neutrosophic, and Plithogenic Hypersoft Set.

In this paper, one extends the single-valued complex neutrosophic set to the subsetvalued complex neutrosophic set, and afterwards to the subset-valued complex refined neutrosophic set.

J. L. Krivine developed a new method based on realizability to construct models of set theory where the axiom of choice fails. We attempt to recreate his results in classical settings, i.e., symmetric extensions. We also provide a new condition for preserving well ordered, and other particular type of choice, in the general settings of symmetric extensions.

The paper is concerned with the old conjecture that there are infinitely many twin primes. In the paper we show that this conjecture is true, that is, it is true in the standard model of arithmetic. The proof is based on Rasiowa–Sikorski Lemma. The key role are played by the derived notion of a Rasiowa–Sikorski set and the method of forcing adjusted to arbitrary first–order languages. This approach was developed in the papers Czelakowski [ 4, 5 ]. The central idea (...) consists in constructing an appropriate countable model \(\textbf{A}\) of Peano arithmetic by means of a Rasiowa–Sikorski set. This model validates the twin prime conjecture. Since \(\textbf{A}\) is elementarily equivalent to the standard model, the conjecture follows. Thus the standard model validates the twin primes conjecture. More generally, it is shown that de Polignac’s conjecture has a positive solution. The paper employs methods borrowed from the contemporary mathematical logic. Such a ’logical’ approach may be viewed as a useful addition to the dominant methodology in number theory based on mathematical analysis. (shrink)

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]. (shrink)

We examine topological dynamical systems on the Cantor set from the point of view of the continuous model theory of commutative C*-algebras. After some general remarks, we focus our attention on the generic homeomorphism of the Cantor set, as constructed by Akin, Glasner, and Weiss. We show that this homeomorphism is the prime model of its theory. We also show that the notion of “generic” used by Akin, Glasner, and Weiss is distinct from the notion of “generic” encountered in Fraïssé (...) theory. (shrink)

In many different ontological debates, anti-arbitrariness considerations push one towards two opposing extremes. For example, in debates about mereology, one may be pushed towards a maximal ontology (mereological universalism) or a minimal ontology (mereological nihilism), because any intermediate view seems objectionably arbitrary. However, it is usually thought that anti-arbitrariness considerations on their own cannot decide between these maximal or minimal views. I will argue that this is a mistake. Anti-arbitrariness arguments may be used to motivate a certain popular thesis in (...) the philosophy of mathematics that rules out the maximalist view in many different ontological debates. (shrink)

Cantor’s abstractionist account of cardinal numbers has been criticized by Frege as a psychological theory of numbers which leads to contradiction. The aim of the paper is to meet these objections by proposing a reassessment of Cantor’s proposal based upon the set theoretic framework of Bourbaki—called BK—which is a First-order set theory extended with Hilbert’s \-operator. Moreover, it is argued that the BK system and the \-operator provide a faithful reconstruction of Cantor’s insights on cardinal numbers. I will introduce first (...) the axiomatic setting of BK and the definition of cardinal numbers by means of the \-operator. Then, after presenting Cantor’s abstractionist theory, I will point out two assumptions concerning the definition of cardinal numbers that are deeply rooted in Cantor’s work. I will claim that these assumptions are supported as well by the BK definition of cardinal numbers, which will be compared to those of Zermelo–von Neumann and Frege–Russell. On the basis of these similarities, I will make use of the BK framework in meeting Frege’s objections to Cantor’s proposal. A key ingredient in the defence of Cantorian abstraction will be played by the role of representative sets, which are arbitrarily denoted by the \-operator in the BK definition of cardinal numbers. (shrink)

We provide a model theoretical and tree property-like characterization of $\lambda $ - $\Pi ^1_1$ -subcompactness and supercompactness. We explore the behavior of these combinatorial principles at accessible cardinals.

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. (shrink)

By the Galvin–Mycielski–Solovay theorem, a subset X of the line has Borel’s strong measure zero if and only if $M+X\neq \mathbb {R}$ for each meager set M.A set $X\subseteq \mathbb {R}$ is meager-additive if $M+X$ is meager for each meager set M. Recently a theorem on meager-additive sets that perfectly parallels the Galvin–Mycielski–Solovay theorem was proven: A set $X\subseteq \mathbb {R}$ is meager-additive if and only if it has sharp measure zero, a notion akin to strong measure zero.We investigate the (...) validity of this result in Polish groups. We prove, e.g., that a set in a locally compact Polish group admitting an invariant metric is meager-additive if and only if it has sharp measure zero. We derive some consequences and calculate some cardinal invariants. (shrink)

A Cantor series expansion for a real number x with respect to a basic sequence $Q=(q_1,q_2,\dots )$, where $q_i \geq 2$, is a generalization of the base b expansion to an infinite sequence of bases. Ki and Linton in 1994 showed that for ordinary base b expansions the set of normal numbers is a $\boldsymbol {\Pi }^0_3$ -complete set, establishing the exact complexity of this set. In the case of Cantor series there are three natural notions of normality: normality, ratio (...) normality, and distribution normality. These notions are equivalent for base b expansions, but not for more general Cantor series expansions. We show that for any basic sequence the set of distribution normal numbers is $\boldsymbol {\Pi }^0_3$ -complete, and if Q is $1$ -divergent then the sets of normal and ratio normal numbers are $\boldsymbol {\Pi }^0_3$ -complete. We further show that all five non-trivial differences of these sets are $D_2(\boldsymbol {\Pi }^0_3)$ -complete if $\lim _i q_i=\infty $ and Q is $1$ -divergent. This shows that except for the trivial containment that every normal number is ratio normal, these three notions are as independent as possible. (shrink)

There is a Turing functional $\Phi $ taking $A^\prime $ to a theory $T_A$ whose complexity is exactly that of the jump of A, and which has the property that $A \leq _T B$ if and only if $T_A \trianglelefteq T_B$ in Keisler’s order. In fact, by more elaborate means and related theories, we may keep the complexity at the level of A without using the jump.

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.

A key question of the ‘maverick’ tradition of the philosophy of mathematical practice is addressed, namely what is mathematical progress. The investigation is based on an article by Penelope Maddy devoted to this topic in which she considers only contributions ‘of some mathematical importance’ as progress. With the help of a case study from contemporary mathematics, more precisely from tropical geometry, a few issues with her proposal are identified. Taking these issues into consideration, an alternative account of ‘mathematical importance’, broadly (...) within the framework of progress Maddy offers, is developed with a special focus on mathematicians’ peer-review practice. (shrink)

A Leibniz class is a class of logics closed under the formation of term-equivalent logics, compatible expansions, and non-indexed products of sets of logics. We study the complete lattice of all Leibniz classes, called the Leibniz hierarchy. In particular, it is proved that the classes of truth-equational and assertional logics are meet-prime in the Leibniz hierarchy, while the classes of protoalgebraic and equivalential logics are meet-reducible. However, the last two classes are shown to be determined by Leibniz conditions consisting of (...) meet-prime logics only. (shrink)

Journal of Mathematical Logic, Volume 22, Issue 02, August 2022. We introduce bounded category forcing axioms for well-behaved classes [math]. These are strong forms of bounded forcing axioms which completely decide the theory of some initial segment of the universe [math] modulo forcing in [math], for some cardinal [math] naturally associated to [math]. These axioms naturally extend projective absoluteness for arbitrary set-forcing — in this situation [math] — to classes [math] with [math]. Unlike projective absoluteness, these higher bounded category forcing (...) axioms do not follow from large cardinal axioms but can be forced under mild large cardinal assumptions on [math]. We also show the existence of many classes [math] with [math] giving rise to pairwise incompatible theories for [math]. (shrink)

Journal of Mathematical Logic, Volume 22, Issue 02, August 2022. We generically construct a model in which the [math]-separation property is true, i.e. every pair of disjoint [math]-sets can be separated by a [math]-definable set. This answers an old question from the problem list “Surrealist landscape with figures” by A. Mathias from 1968. We also construct a model in which the (lightface) [math]-separation property is true.

Journal of Mathematical Logic, Volume 22, Issue 02, August 2022. Motivated by results of Bagaria, Magidor and Väänänen, we study characterizations of large cardinal properties through reflection principles for classes of structures. More specifically, we aim to characterize notions from the lower end of the large cardinal hierarchy through the principle [math] introduced by Bagaria and Väänänen. Our results isolate a narrow interval in the large cardinal hierarchy that is bounded from below by total indescribability and from above by subtleness, (...) and contains all large cardinals that can be characterized through the validity of the principle [math] for all classes of structures defined by formulas in a fixed level of the Lévy hierarchy. Moreover, it turns out that no property that can be characterized through this principle can provably imply strong inaccessibility. The proofs of these results rely heavily on the notion of shrewd cardinals, introduced by Rathjen in a proof-theoretic context, and embedding characterizations of these cardinals that resembles Magidor’s classical characterization of supercompactness. In addition, we show that several important weak large cardinal properties, like weak inaccessibility, weak Mahloness or weak [math]-indescribability, can be canonically characterized through localized versions of the principle [math]. Finally, the techniques developed in the proofs of these characterizations also allow us to show that Hamkin’s weakly compact embedding property is equivalent to Lévy’s notion of weak [math]-indescribability. (shrink)

We write $\mathcal {S}_n(A)$ for the set of permutations of a set A with n non-fixed points and $\mathrm {{seq}}^{1-1}_n(A)$ for the set of one-to-one sequences of elements of A with length n where n is a natural number greater than $1$. With the Axiom of Choice, $|\mathcal {S}_n(A)|$ and $|\mathrm {{seq}}^{1-1}_n(A)|$ are equal for all infinite sets A. Among our results, we show, in ZF, that $|\mathcal {S}_n(A)|\leq |\mathrm {{seq}}^{1-1}_n(A)|$ for any infinite set A if ${\mathrm {AC}}_{\leq n}$ is (...) assumed and this assumption cannot be removed. In the other direction, we show that $|\mathrm {{seq}}^{1-1}_n(A)|\leq |\mathcal {S}_{n+1}(A)|$ for any infinite set A and the subscript $n+1$ cannot be reduced to n. Moreover, we also show that “ $|\mathcal {S}_n(A)|\leq |\mathcal {S}_{n+1}(A)|$ for any infinite set A” is not provable in ZF. (shrink)

In [17], we introduced an extensional variant of generic realizability [22], where realizers act extensionally on realizers, and showed that this form of realizability provides inner models of $\mathsf {CZF}$ (constructive Zermelo–Fraenkel set theory) and $\mathsf {IZF}$ (intuitionistic Zermelo–Fraenkel set theory), that further validate $\mathsf {AC}_{\mathsf {FT}}$ (the axiom of choice in all finite types). In this paper, we show that extensional generic realizability validates several choice principles for dependent types, all exceeding $\mathsf {AC}_{\mathsf {FT}}$. We then show that adding (...) such choice principles does not change the arithmetic part of either $\mathsf {CZF}$ or $\mathsf {IZF}$. (shrink)

A Correction to this paper has been published: 10.1007/s11225-020-09933-y.

For odd and for even involutive, commutative residuated chains a representation theorem is presented in this paper by means of direct systems of abelian o-groups equipped with further structure. This generalizes the corresponding result of J. M. Dunnabout finite Sugihara monoids.

Category theory is often treated as an algebraic foundation for mathematics, and the widely known algebraization of ZF set theory in terms of this discipline is referenced as “categorical set theory” or “set theory for category theory”. The method of algebraization used in this theory has not been formulated in terms of universal algebra so far. In current paper, a _universal algebraic_ method, i.e. one formulated in terms of universal algebra, is presented and used for algebraization of a ground mereological (...) system described as “quantitative” (QMS) and of the standard set theories built upon it. The QMS is algebraized by using abelian generalized groups (AGGs) generalizing both abelian groups and Boolean algebras. To algebraize set theory, the AGG are enriched with operators to produce _extensional algebras_ (EA) of Tarskian “Boolean algebras with operators” type. EAs explicate the intuition of set theory’ universes (of discourse). The axiomatic set theory presented in this paper, named _extension theory_, previously went through an intuitive phase of development during its use by the author in computer science projects, where it served as the basis for development of a foundational data science framework and an extensional model of natural languages also outlined here. (shrink)

The main topics of this thesis are cardinal invariants, P -points and MAD families. Cardinal invariants of the continuum are cardinal numbers that are bigger than $\aleph _{0}$ and smaller or equal than $\mathfrak {c}.$ Of course, they are only interesting when they have some combinatorial or topological definition. An almost disjoint family is a family of infinite subsets of $\omega $ such that the intersection of any two of its elements is finite. A MAD family is a maximal almost (...) disjoint family. An ultrafilter $\mathcal {U}$ on $\omega $ is called a P-point if every countable $\mathcal {B\subseteq U}$ there is $X\in $ $\mathcal {U}$ such that $X\setminus B$ is finite for every $B\in \mathcal {B}.$ This kind of ultrafilters has been extensively studied, however there is still a large number of open questions about them.In the preliminaries we recall the principal properties of filters, ultrafilters, ideals, MAD families and cardinal invariants of the continuum. We present the construction of Shelah, Mildenberger, Raghavan, and Steprāns of a completely separable MAD family under $\mathfrak {s\leq a}.$ None of the results in this chapter are due to the author.The second chapter is dedicated to a principle of Sierpiński. The principle $\left $ of Sierpiński is the following statement: There is a family of functions $\left \{ \varphi _{n}:\omega _{1}\longrightarrow \omega _{1}\mid n\in \omega \right \} $ such that for every $I\in \left [ \omega _{1}\right ] ^{\omega _{1}}$ there is $n\in \omega $ for which $\varphi _{n}\left [ I\right ] =\omega _{1}.$ This principle was recently studied by Arnie Miller. He showed that this principle is equivalent to the following statement: There is a set $X=\left \{ f_{\alpha }\mid \alpha \alpha $ then $f_{\beta }\cap g$ is infinite. Miller showed that the principle of Sierpiński implies that non $\left =\omega _{1}.$ He asked if the converse was true, i.e., does non $\left =\omega _{1}$ imply the principle $\left $ of Sierpiński? We answer his question affirmatively. In other words, we show that non $\left =\omega _{1}$ is enough to construct an $\mathcal {IE}$ -Luzin set. It is not hard to see that the $\mathcal {IE}$ -Luzin set we constructed is meager. This is no coincidence, because with the aid of an inaccessible cardinal, we construct a model where non $\left =\omega _{1}$ and every $\mathcal {IE}$ -Luzin set is meager.The third chapter is dedicated to a conjecture of Hrušák. Michael Hrušák conjectured the following: Every Borel cardinal invariant is either at most non $\left $ or at least cov $\left $. Although the veracity of this conjecture is still an open problem, we were able to obtain some partial results: The conjecture is false for “Borel invariants of $\omega _{1}^{\omega }$ ” nevertheless, it is true for a large class of definable invariants. This is part of a joint work with Michael Hrušák and Jindřich Zapletal.In the fourth chapter we present a survey on destructibility of ideals and MAD families. We prove several classic theorems, but we also prove some new results. For example, we show that every almost disjoint family of size less than $\mathfrak {c}$ can be extended to a Cohen indestructible MAD family is equivalent to $\mathfrak {b=c}$. A MAD family $\mathcal {A}$ is Shelah–Steprāns if for every $X\subseteq \left [ \omega \right ] ^{<\omega }\setminus \left \{ \emptyset \right \} $ either there is $A\in \mathcal {I}\left $ such that $s\cap A\neq \emptyset $ for every $s\in X$ or there is $B\in \mathcal {I}\left $ that contains infinitely many elements of X $ denotes the ideal generated by $\mathcal {A}$ ). This concept was introduced by Raghavan which is connected to the notion of “strongly separable” introduced by Shelah and Steprāns. We prove that Shelah–Steprāns MAD families have very strong indestructibility properties: Shelah–Steprāns MAD families are indestructible for “many” definable forcings that does not add dominating reals. According to the author’s best knowledge, this is the strongest notion that has been considered in the literature so far. In spite of their strong indestructibility, Shelah–Steprāns MAD families can be destroyed by a ccc forcing that does not add unsplit or dominating reals. We also consider some strong combinatorial properties of MAD families and show the relationships between them.The fifth chapter is one of the most important chapters in the thesis. A MAD family $\mathcal {A}$ is called $+$ -Ramsey if every tree that branches into $\mathcal {I}\left $ -positive sets has an $\mathcal {I}\left $ -positive branch. Michael Hrušák’s first published question is the following: Is there a $+$ -Ramsey MAD family? It was previously known that such families can consistently exist. However, there was no construction of such families using only the axioms of ZFC. We solve this problem by constructing such a family without any extra assumptions.In the fourth and fifth chapters, we introduce several notions of MAD families, in the sixth chapter we prove several implications and non implications between them. We construct several MAD families with different properties.In the seventh chapter we build models without P -points. We show that there are no P -points after adding Silver reals either iteratively or by the side by side product. These results have some important consequences: The first one is that is its possible to get rid of P -points using only definable forcings. This answers a question of Michael Hrušák. We can also use our results to build models with no P -points and with arbitrarily large continuum, which was also an open question. These results were obtained with David Chodounský.prepared by Osvaldo Guzmán GonzálezE-mail : [email protected] : https://arxiv.org/abs/1810.09680. (shrink)

The complete characterisation of order types of non-standard models of Peano arithmetic and its extensions is a famous open problem. In this paper, we consider subtheories of Peano arithmetic, in particular, theories formulated in proper fragments of the full language of arithmetic. We study the order types of their non-standard models and separate all considered theories via their possible order types. We compare the theories with and without induction and observe that the theories without induction tend to have an algebraic (...) character that allows model constructions by closing a model under the relevant algebraic operations. (shrink)

We use exact saturation to study the complexity of unstable theories, showing that a variant of this notion called pseudo-elementary class (PC)-exact saturation meaningfully reflects combinatorial dividing lines. We study PC-exact saturation for stable and simple theories. Among other results, we show that PC-exact saturation characterizes the stability cardinals of size at least continuum of a countable stable theory and, additionally, that simple unstable theories have PC-exact saturation at singular cardinals satisfying mild set-theoretic hypotheses. This had previously been open even (...) for the random graph. We characterize supersimplicity of countable theories in terms of having PC-exact saturation at singular cardinals of countable cofinality. We also consider the local analog of PC-exact saturation, showing that local PC-exact saturation for singular cardinals of countable cofinality characterizes supershort theories. (shrink)

We investigate the interaction between compactness principles and guessing principles in the Radin forcing extensions. In particular, we show that in any Radin forcing extension with respect to a measure sequence on [Formula: see text], if [Formula: see text] is weakly compact, then [Formula: see text] holds. This provides contrast with a well-known theorem of Woodin, who showed that in a certain Radin extension over a suitably prepared ground model relative to the existence of large cardinals, the diamond principle fails (...) at a strongly inaccessible Mahlo cardinal. Refining the analysis of the Radin extensions, we consistently demonstrate a scenario where a compactness principle, stronger than the diagonal stationary reflection principle, holds yet the diamond principle fails at a strongly inaccessible cardinal, improving a result from [O. B. -Neria, Diamonds, compactness, and measure sequences, J. Math. Log. 19(1) (2019) 1950002]. (shrink)

If [Formula: see text] is regular and [Formula: see text], then the existence of a weakly presaturated ideal on [Formula: see text] implies [Formula: see text]. This partially answers a question of Foreman and Magidor about the approachability ideal on [Formula: see text]. As a corollary, we show that if there is a presaturated ideal [Formula: see text] on [Formula: see text] such that [Formula: see text] is semiproper, then CH holds. We also show some barriers to getting the tree (...) property and a saturated ideal simultaneously on a successor cardinal from conventional forcing methods. (shrink)

We introduce the $\Sigma _1$ -definable universal finite sequence and prove that it exhibits the universal extension property amongst the countable models of set theory under end-extension. That is, the sequence is $\Sigma _1$ -definable and provably finite; the sequence is empty in transitive models; and if M is a countable model of set theory in which the sequence is s and t is any finite extension of s in this model, then there is an end-extension of M to a (...) model in which the sequence is t. Our proof method grows out of a new infinitary-logic-free proof of the Barwise extension theorem, by which any countable model of set theory is end-extended to a model of $V=L$ or indeed any theory true in a suitable submodel of the original model. The main theorem settles the modal logic of end-extensional potentialism, showing that the potentialist validities of the models of set theory under end-extensions are exactly the assertions of S4. Finally, we introduce the end-extensional maximality principle, which asserts that every possibly necessary sentence is already true, and show that every countable model extends to a model satisfying it. (shrink)

We consider a seemingly weaker form of $\Delta ^{1}_{1}$ Turing determinacy.Let $2 \leqslant \rho < \omega _{1}^{\mathsf {CK}}$, $\textrm{Weak-Turing-Det}_{\rho }$ is the statement:Every $\Delta ^{1}_{1}$ set of reals cofinal in the Turing degrees contains two Turing distinct, $\Delta ^{0}_{\rho }$ -equivalent reals.We show in $\mathsf {ZF}^-$ : $\textrm{Weak-Turing-Det}_{\rho }$ implies: for every $\nu < \omega _{1}^{\mathsf {CK}}$ there is a transitive model ${M \models \mathsf {ZF}^{-} + \textrm{``}\aleph _{\nu } \textrm{ exists''.}}$ As a corollary:If every cofinal $\Delta ^{1}_{1}$ set of (...) Turing degrees contains both a degree and its jump, then for every $\nu < \omega_1^{\mathsf{CK}}$, there is atransitive model: $M \models \mathsf{ZF}^{-} + \textrm{``}\aleph_\nu \textrm{ exists''.}$ •With a simple proof, this improves upon a well-known result of Harvey Friedman on the strength of Borel determinacy.•Invoking Tony Martin’s proof of Borel determinacy, $\textrm{Weak-Turing-Det}_{\rho }$ implies $\Delta ^{1}_{1}$ determinacy.•We show further that, assuming $\Delta ^{1}_{1}$ Turing determinacy, or Borel Turing determinacy, as needed:–Every cofinal $\Sigma ^{1}_{1}$ set of Turing degrees contains a “hyp-Turing cone”: ${\{x \in \mathcal {D} \mid d_{0} \leqslant _{T} x \leqslant _{h} d_{0} \}}$.–For a sequence $_{k < \omega }$ of analytic sets of Turing degrees, cofinal in $\mathcal {D}$, $\bigcap _{k} A_{k}$ is cofinal in $\mathcal {D}$. (shrink)

The aim of this paper is to shed light on our understanding of large scale properties of infinite strings. We say that one string $\alpha $ has weaker large scale geometry than that of $\beta $ if there is color preserving bi-Lipschitz map from $\alpha $ into $\beta $ with small distortion. This definition allows us to define a partially ordered set of large scale geometries on the classes of all infinite strings. This partial order compares large scale geometries of (...) infinite strings. As such, it presents an algebraic tool for classification of global patterns. We study properties of this partial order. We prove, for instance, that this partial order has a greatest element and also possess infinite chains and antichains. We also investigate the sets of large scale geometries of strings accepted by finite state machines such as Büchi automata. We provide an algorithm that describes large scale geometries of strings accepted by Büchi automata. This connects the work with the complexity theory. We also prove that the quasi-isometry problem is a $\Sigma _2^0$ -complete set, thus providing a bridge with computability theory. Finally, we build algebraic structures that are invariants of large scale geometries. We invoke asymptotic cones, a key concept in geometric group theory, defined via model-theoretic notion of ultra-product. Partly, we study asymptotic cones of algorithmically random strings, thus connecting the topic with algorithmic randomness. (shrink)

In this paper we study the notion of $C^{}$ -supercompactness introduced by Bagaria in [3] and prove the identity crises phenomenon for such class. Specifically, we show that consistently the least supercompact is strictly below the least $C^{}$ -supercompact but also that the least supercompact is $C^{}$ -supercompact }$ -supercompact). Furthermore, we prove that under suitable hypothesis the ultimate identity crises is also possible. These results solve several questions posed by Bagaria and Tsaprounis.

Skolem studied the germs at infinity of the smallest class of real valued functions on the positive real line containing the constant $1$, the identity function ${\mathbf {x}}$, and such that whenever f and g are in the set, $f+g,fg$ and $f^g$ are in the set. This set of germs is well ordered and Skolem conjectured that its order type is epsilon-zero. Van den Dries and Levitz computed the order type of the fragment below $2^{2^{\mathbf {x}}}$. Here we prove that (...) the set of asymptotic classes within any Archimedean class of Skolem functions has order type $\omega $. As a consequence we obtain, for each positive integer n, an upper bound for the fragment below $2^{n^{\mathbf {x}}}$. We deduce an epsilon-zero upper bound for the fragment below $2^{{\mathbf {x}}^{\mathbf {x}}}$, improving the previous epsilon-omega bound by Levitz. A novel feature of our approach is the use of Conway’s surreal number for asymptotic calculations. (shrink)

We investigate, in ZFC, the behavior of abstract elementary classes 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 and generalizes to the much broader framework of tame AECs with weak amalgamation and coherent sequences.