In Part I of this series, we presented the microscopic approach to Souslin-tree constructions, and argued that all known ⋄-based constructions of Souslin trees with various additional properties may be rendered as applications of our approach. In this paper, we show that constructions following the same approach may be carried out even in the absence of ⋄. In particular, we obtain a new weak sufficient condition for the existence of Souslin trees at the level of a (...) strongly inaccessible cardinal. We also present a new construction of a Souslin tree with an ascent path, thereby increasing the consistency strength of such a tree's nonexistence from a Mahlo cardinal to a weakly compact cardinal. Section 2 of this paper is targeted at newcomers with minimal background. It offers a comprehensive exposition of the subject of constructing Souslin trees and the challenges involved. (shrink)

An ℵ1-Souslin tree is a complicated combinatorial object whose existence cannot be decided on the grounds of ZFC alone. But fifteen years after Tennenbaum and Jech independently devised notions of forcing for introducing such a tree, Shelah proved that already the simplest forcing notion—Cohen forcing—adds an ℵ1-Souslin tree. In this article, we identify a rather large class of notions of forcing that, assuming a GCH-type hypothesis, add a λ+-Souslin tree. This class includes Prikry, (...) Magidor, and Radin forcing. (shrink)

We present a variation of the forcing S max as presented in Woodin [4]. Our forcing is a P max -style construction where each model condition selects one Souslin tree. In the extension there is a Souslin tree T G which is the direct limit of the selected Souslin trees in the models of the generic. In some sense, the generic extension is a maximal model of "there exists a minimal Souslin tree," (...) with T G being this minimal tree. In particular, in the extension this Souslin tree has the property that forcing with it gives a model of Souslin's Hypothesis. (shrink)

We prove that there are groups in the constructible universe whose automorphism towers are highly malleable by forcing. This is a consequence of the fact that, under a suitable diamond hypothesis, there are sufficiently many highly rigid non-isomorphic Souslin trees whose isomorphism relation can be precisely controlled by forcing.

We present a variation of the forcing $\mathbb{S}_{max}$ as presented in Woodin [4]. Our forcing is a $\mathbb{P}_{max}$-style construction where each model condition selects one Souslin tree. In the extension there is a Souslin tree T$_G$ which is the direct limit of the selected Souslin trees in the models of the generic. In some sense, the generic extension is a maximal model of "there exists a minimal Souslin tree," with T$_G$ being this (...) minimal tree. In particular, in the extension this Souslin tree has the property that forcing with it gives a model of Souslin's Hypothesis. (shrink)

A Souslin algebra is a complete Boolean algebra whose main features are ruled by a tight combination of an antichain condition with an infinite distributive law. The present article divides into two parts. In the first part a representation theory for the complete and atomless subalgebras of Souslin algebras is established (building on ideas of Jech and Jensen). With this we obtain some basic results on the possible types of subalgebras and their interrelation. The second part begins with (...) a review of some generalizations of results from descriptive set theory concerning Baire category which are then used in non-trivial Souslin tree constructions that yield Souslin algebras with a remarkable subalgebra structure. In particular, we use this method to prove that under the diamond principle there is a bi-embeddable though not isomorphic pair of homogeneous Souslin algebras. (shrink)

A highly rigid Souslin tree T is constructed such that forcing with T turns T into a Kurepa tree. Club versions of previously known degrees of rigidity are introduced, as follows: for a rigidity property P, a tree T is said to have property P on clubs if for every club set C (containing 0), the restriction of T to levels in C has property P. The relationships between these rigidity properties for Souslin trees are (...) investigated, and some open questions are stated. (shrink)

Assuming Jensen's principle ◊+ we construct Souslin algebras all of whose maximal chains are pairwise isomorphic as total orders, thereby answering questions of Koppelberg and Todorčević.

We investigate questions involving Aronszajn trees, square principles, and stationary reflection. We first consider two strengthenings of introduced by Brodsky and Rinot for the purpose of constructing κ‐Souslin trees. Answering a question of Rinot, we prove that the weaker of these strengthenings is compatible with stationary reflection at κ but the stronger is not. We then prove that, if μ is a singular cardinal, implies the existence of a special ‐tree with a cf(μ)‐ascent path, thus answering a question (...) of Lücke. (shrink)

In [4], Kunen used iterated ultrapowers to show that ifUis a normalκ-complete nontrivial ultrafilter on a cardinalκthenL[U], the class of sets constructive fromU, has only the ultrafilterU∩L[U] and this ultrafilter depends only onκ. In this paper we extend Kunen's methods to arbitrary sequencesUof ultrafilters and obtain generalizations of these results. In particular we answer Problem 1 of Kunen and Paris [5] which asks whether the number of ultrafilters onκcan be intermediate between 1 and 22κ. If there is a normalκ-complete ultrafilterUonκsuch (...) that {α <κ: α is measurable} ∈Uthen there is an inner model with exactly two normal ultrafilters onκ, and ifκis super-compact then there are inner models havingκ+ +,κ+or any cardinal less than or equal toκnormal ultrafilters.These methods also show that several properties ofLwhich had been shown to hold forL[U] also hold forL[U]: using an idea of Silver we show that inL[U] the generalized continuum hypothesis is true, there is a Souslin tree, and there is awell-ordering of the reals. In addition we generalize a result of Kunen to characterize the countaby complete ultrafilters ofL[U]. (shrink)

We prove thatµ=µ <µ , 2 µ =µ + and “there is a non-reflecting stationary subset ofµ + composed of ordinals of cofinality <μ” imply that there is a μ-complete Souslin tree onµ +.

We investigate various strong notions of rigidity for Souslin trees, separating them under ♢ into a hierarchy. Applying our methods to the automorphism tower problem in group theory, we show under ♢ that there is a group whose automorphism tower is highly malleable by forcing.

We show it is consistent that there is a Souslin tree S such that after forcing with S, S is Kurepa and for all clubs $$C \subset \omega _1$$ C ⊂ ω 1, $$S\upharpoonright C$$ S ↾ C is rigid. This answers the questions in Fuchs (Arch Math Logic 52(1–2):47–66, 2013). Moreover, we show it is consistent with $$\diamondsuit $$ ♢ that for every Souslin tree T there is a dense $$X \subseteq T$$ X ⊆ T (...) which does not contain a copy of T. This is related to a question due to Baumgartner in Baumgartner (Ordered sets (Banff, Alta., 1981), volume 83 of NATO Adv. Study Inst. Ser. C: Math. Phys. Sci., Reidel, Dordrecht-Boston, pp 239–277, 1982). (shrink)

We investigate the effect after forcing with a coherent Souslin tree on the gap structure of the class of coherent Aronszajn trees ordered by embeddability. We shall show, assuming the relativized version PFA(S) of the proper forcing axiom, that the Souslin tree S forces that the class of Aronszajn trees ordered by the embeddability relation is universal for linear orders of cardinality at most ${\aleph_1}$.

We show that many countable support iterations of proper forcings preserve Souslin trees. We establish sufficient conditions in terms of games and we draw connections to other preservation properties. We present a proof of preservation properties in countable support iterations in the so-called Case A that does not need a division into forcings that add reals and those who do not.

König, Larson and Yoshinobu initiated the study of principles for guessing generalized clubs, and introduced a construction of a higher Souslin tree from the strong guessing principle.Complementary to the author’s work on the validity of diamond and non-saturation at the successor of singulars, we deal here with a successor of regulars. It is established that even the non-strong guessing principle entails non-saturation, and that, assuming the necessary cardinal arithmetic configuration, entails a diamond-type principle which suffices for the (...) construction of a higher Souslin tree.We also establish the consistency of GCH with the failure of the weakest form of generalized club guessing. This, in particular, settles a question from the original paper. (shrink)

K.J. Devlin has extended Jensen's construction of a model ofZFC andCH without Souslin trees to a model without Kurepa trees either. We modify the construction again to obtain a model with these properties, but in addition, without Kurepa trees inccc-generic extensions. We use a partially defined ◊-sequence, given by a fine structure lemma. We also show that the usual collapse ofκ Mahlo toω 2 will give a model without Kurepa trees not only in the model itself, but (...) also inccc-extensions. (shrink)

Within ZFC, we develop a general technique to topologize trees that provides a uniform approach to topological completeness results in modal logic with respect to zero-dimensional Hausdorff spaces. Embeddings of these spaces into well-known extremally disconnected spaces then gives new completeness results for logics extending S4.2.

We define the notion of Souslin forcing, and we prove that some properties are preserved under iteration. We define a weaker form of Martin's axiom, namely MA(Γ + ℵ 0 ), and using the results on Souslin forcing we show that MA(Γ + ℵ 0 ) is consistent with the existence of a Souslin tree and with the splitting number s = ℵ 1 . We prove that MA(Γ + ℵ 0 ) proves the additivity of (...) measure. Also we introduce the notion of proper Souslin forcing, and we prove that this property is preserved under countable support iterated forcing. We use these results to show that ZFC + there is an inaccessible cardinal is equiconsistent with ZFC + the Borel conjecture + Σ 1 2 -measurability. (shrink)

Searching is one of the most fundamental operations in many complex systems. However, the complexity of the search process would increase dramatically in high-dimensional space. K-dimensional tree, as a classical data structure, has been widely used in high-dimensional vital data search. However, at present, common methods proposed for KD tree construction are either unstable or time-consuming. This paper proposed a new algorithm to construct a balanced KD tree based on presorted results. Compared with previous similar method, (...) the new algorithm could reduce the complexity of the construction process from O level to O level, where K is the number of dimensions and N is the number of data. In addition, with the help of presorted results, the performance of the new method is no longer subject to the initial conditions, which expands the application scope of KD tree. (shrink)

Trees architectural study shows gradients in the meristematic activity. This activity is described by the number of internodes per growth unit, which is considered as the output of a dynamic random process. Several species were observed, which led us to propose and then estimate some mathematical models. Computing the functioning of a tree in a given environment therefore involves finding the probability function of the meristems and following the evolution of the parameters of this law along the botanical gradients (...) (order, trend, acrotony) within its architecture. (shrink)

Clarifying the causes of subway construction accidents has an important impact on reducing the probability of accidents and protecting workers’ lives and public property to a greater extent. A total of 138 investigation records of subway construction accidents from 2000 to 2020 were collected in this study. Based on a systemic analysis of 29 well-known accident causation models and the formative process of the subway construction accidents, we extracted the causative factors of subway construction accidents from (...) the collected records. Furthermore, a causation analysis index system of subway accidents was proposed based on fault tree analysis, where we considered subway construction accidents as the top event and the five dimensions, i.e., human, equipment, environment, management, and safety culture, as first-level intermediate events. Moreover, 17 causative factors were considered to be related to the severity of subway construction accidents. It is found that human factors are prone to be critical to high-risk accidents. Finally, a Bayesian network was formed to explore the causative factors of high-risk subway construction accidents. Based on the combined application of FTA and BN, this study discusses the complex influence factors and their action routes to unsafe accidents in subway construction sites, and makes efforts to correspond safety decision basis for the management of China subway construction. (shrink)

It has sometimes been suggested that people represent the structure of action in terms of an action tree. A question now arises about the relationship between this action tree representation and people’s moral judgments. A natural hypothesis would be that people first construct a representation of the action tree and then go on to use this representation in making moral judgments. The present paper argues for a more complex view. Specifically, the paper reports a series of experimental (...) studies that appear to show that people’s moral judgments can actually impact their representations of the action tree itself. (shrink)

Using the concept of progress measure, we give a new proof of Rabin's fundamental result that the languages defined by tree automata are closed under complementation. To do this we show that for certain infinite games based on tree automata, an immediate determinacy property holds for the player who is trying to win according to a Rabin acceptance condition. Immediate determinancy is stronger than the forgetful determinacy of Gurevich and Harrington, which depends on more information about the past, (...) but applies to another class of games. Next, we show a graph theoretic duality theorem for winning conditions. Finally, we present an extended version of Safra's determinization construction. Together, these ingredients and the determinacy of Borel games yield a straightforward recipe for complementing tree automata. Our construction is almost optimal, i.e. the state space blow-up is essentially exponential- thus roughly the same as for automata on finite or infinite words. To our knowledge, no prior constructions have been better than double exponential. (shrink)

We study descriptive set theory in the space ω1 ω 1 by letting trees with no uncountable branches play a similar role as countable ordinals in traditional descriptive set theory. By using such trees, we get, for example, a covering property for the class of Π 1 1 -sets of ω1 ω 1 . We call a family U of trees universal for a class V of trees if $\mathscr{U} \subseteq \mathscr{V}$ and every tree in V can be order-preservingly (...) mapped into a tree in U. It is well known that the class of countable trees with no infinite branches has a universal family of size ℵ 1 . We shall study the smallest cardinality of a universal family for the class of trees of cardinality ≤ℵ 1 with no uncountable branches. We prove that this cardinality can be 1 (under ¬CH) and any regular cardinal κ which satisfies ℵ 2 ≤ κ ≤ 2 ℵ 1 (under CH). This bears immediately on the covering property of the Π 1 1 -subsets of the space ω1 ω 1 . We also study the possible cardinalities of definable subsets of ω1 ω 1 . We show that the statement that every definable subset of ω1 ω 1 has cardinality $ or cardinality 2 ω1 is equiconsistent with ZFC (if n ≥ 3) and with ZFC plus an inaccessible (if n = 2). Finally, we define an analogue of the notion of a Borel set for the space ω1 ω 1 and prove a Souslin-Kleene type theorem for this notion. (shrink)

This paper delves into the intricate connections between the Abrahamic religions and the ancient mystery cults, reaching as far back as to Neolithic shamanism. They all unite in a shared pursuit: the quest for divine knowledge. Long before the Tree of Knowledge of Good and Evil in the biblical Genesis took on its profound symbolic meaning, shamanic initiation held a distinctly different view of botany. Indeed, It regarded plants primarily for their psychedelic properties, as a medium to perceive “reality” (...) with heightened intensity. However, the sacred Tree has a uniquely numinous character, and their consumption is sternly prohibited by God, in both, the Bible and the Quran. Therefore, this effectively positions all monotheistic religions in an unequivocal distance from their prehistoric origins. More precisely, we can argue that these mythologies are in fact constructed as counternarratives, advocating, primarily for a social ethic (based on the holy writings of the Bible), and evoking secondly a fundamental gnostic quest. (shrink)

An important technique in large cardinal set theory is that of extending an elementary embedding j: M → N between inner models to an elementary embedding j*: M[G] → N[G*] between generic extensions of them. This technique is crucial both in the study of large cardinal preservation and of internal consistency. In easy cases, such as when forcing to make the GCH hold while preserving a measurable cardinal (via a reverse Easton iteration of α-Cohen forcing for successor cardinals α), the (...) generic G* is simply generated by the image of G. But in difficult cases, such as in Woodin's proof that a hypermeasurable is sufficient to obtain a failure of the GCH at a measurable, a preliminary version of G* must be constructed (possibly in a further generic extension of M[G]) and then modified to provide the required G*. In this article we use perfect trees to reduce some difficult cases to easy ones, using fusion as a substitute for distributivity. We apply our technique to provide a new proof of Woodin's theorem as well as the new result that global domination at inaccessibles (the statement that d (κ) is less than 2κ for inaccessible κ, where d (κ) is the dominating number at κ) is internally consistent, given the existence of 0#. (shrink)

I argue that the numbering system of the Tractatus lets us see how it was constructed, in two closely related senses of that term. First, it tells us a great deal about the genesis of the book, for the numbering system was used to assemble and rearrange a series of drafts, as recorded in MS 104. Second, it helps us understand the structure of the published book, as cryptically summarized in the opening footnote. I also discuss an unpublished letter from (...) Anscombe to von Wright from 1948 which contains the very first sketch of a tree-structured reading, and what I believe is Stenius’s response to Anscombe’s proposal. The paper critically evaluates previous work on tree-structured readings and contends that we need to read the Tractatus in both the number order used in the published book and the tree order that Wittgenstein used to draft it. It also considers some of the main ways of turning this complex branching structure into a linear, printed text, and so serves as an introduction to the three tree-structured editions of the Tractatus that accompany this paper (the German text, and the translations by Ogden/Ramsey and Pears & McGuinness). (shrink)

The sole diagram in On the Origin of Species is generally considered to be merely an illustration of Darwin’s ideas, but such an interpretation ignores the fact that Darwin himself expressly stated that the diagram helped him to discover and express his ideas. This article demonstrates that developing the so-called “tree diagram” substantially aided Darwin’s heuristics. This demonstration is based on an interpretation of the diagram and of 17 sketches found in Darwin’s scientific papers. The key to this interpretation (...) is the meaning that Darwin assigned to the graphic elements he used to construct the preliminary sketches and the diagram. I argue that each of the sketches contributed to the shaping of Darwin’s ideas and that, in their succession, each added new elements that ultimately resulted in the fully developed published diagram. (shrink)

We continue the investigation of the Laver ideal ℓ 0 and Miller ideal m 0 started in [GJSp] and [GRShSp]; these are the ideals on the Baire space associated with Laver forcing and Miller forcing. We solve several open problems from these papers. The main result is the construction of models for $t , where add denotes the additivity coefficient of an ideal. For this we construct amoeba forcings for these forcings which do not add Cohen reals. We show (...) that c = ω 2 implies $\operatorname{add}(m^0) \leq \mathfrak{h}$ . We show that b = c, d = c implies $\operatorname{cov}(\ell^0) \leq \mathfrak{h}^+, \operatorname{cov}(m^0) \leq \mathfrak{h}^+$ respectively. Here $\operatorname{cov}$ denotes the covering coefficient. We also show that in the Cohen model $\operatorname{cov}(m^0) holds. Finally we prove that Cohen forcing does not add a superperfect tree of Cohen reals. (shrink)

We study descriptive set theory in the space $^{\omega_1}\omega_1$ by letting trees with no uncountable branches play a similar role as countable ordinals in traditional descriptive set theory. By using such trees, we get, for example, a covering property for the class of $\Pi^1_1$-sets of $^{\omega_1}\omega_1$. We call a family $\mathscr{U}$ of trees universal for a class $\mathscr{V}$ of trees if $\mathscr{U} \subseteq \mathscr{V}$ and every tree in $\mathscr{V}$ can be order-preservingly mapped into a tree in $\mathscr{U}$. It (...) is well known that the class of countable trees with no infinite branches has a universal family of size $\aleph_1$. We shall study the smallest cardinality of a universal family for the class of trees of cardinality $\leq\aleph_1$ with no uncountable branches. We prove that this cardinality can be 1 (under $\neg$CH) and any regular cardinal $\kappa$ which satisfies $\aleph_2 \leq \kappa \leq 2^{\aleph_1}$ (under CH). This bears immediately on the covering property of the $\Pi^1_1$-subsets of the space $^{\omega_1}\omega_1$. We also study the possible cardinalities of definable subsets of $^{\omega_1}\omega_1$. We show that the statement that every definable subset of $^{\omega_1}\omega_1$ has cardinality $<\omega_n$ or cardinality $2^{\omega_1}$ is equiconsistent with ZFC (if $n \geq 3$) and with ZFC plus an inaccessible (if $n = 2$). Finally, we define an analogue of the notion of a Borel set for the space $^{\omega_1}\omega_1$ and prove a Souslin-Kleene type theorem for this notion. (shrink)

Cloud computing (ClC) has become a more popular computer paradigm in the preceding few years. Quality of Service (QoS) is becoming a crucial issue in service alteration because of the rapid growth in the number of cloud services. When evaluating cloud service functioning using several performance measures, the issue becomes more complex and non-trivial. It is therefore quite difficult and crucial for consumers to choose the best cloud service. The user's choices are provided in a quantifiable manner in the current (...) methods for choosing cloud services. Hence, this study attempts to achieve this objective through construction. decision-making framework so-called cloud services evaluator (CSsEv). The main indicator and its sub-indicators are formed as nodes at levels(n) in tree soft sets (TSSs). Thereafter Single Value Neutrosophic Sets (SVNSs) as branch of neutrosophic sets which conjunction with the Multi-Criteria Decision Making (MCDM) technique to facilitate analysis and evaluation process for the available Cloud services providers. Hence, entropy is employed to obtain indicators and sub_indicators weights and Complex Proportional Assessment utilizes these weights to facilitate the decision process of selecting optimal ClSPs. (shrink)

In this paper we present and study a categorical formulation of the W-types of Martin-Löf. These are essentially free term algebras where the operations may have finite or infinite arity. It is shown that W-types are preserved under the construction of sheaves and Artin gluing. In the proofs we avoid using impredicative or nonconstructive principles.

We obtain an array of consistency results concerning trees and stationary reflection at double successors of regular cardinals $\kappa $, updating some classical constructions in the process. This includes models of $\mathsf {CSR}(\kappa ^{++})\wedge {\sf TP}(\kappa ^{++})$ (both with and without ${\sf AP}(\kappa ^{++})$ ) and models of the conjunctions ${\sf SR}(\kappa ^{++}) \wedge \mathsf {wTP}(\kappa ^{++}) \wedge {\sf AP}(\kappa ^{++})$ and $\neg {\sf AP}(\kappa ^{++}) \wedge {\sf SR}(\kappa ^{++})$ (the latter was originally obtained in joint work by Krueger and (...) the first author [9], and is here given using different methods). Analogs of these results with the failure of $\sf {SH}(\kappa ^{++})$ are given as well. Finally, we obtain all of our results with an arbitrarily large $2^\kappa $, applying recent joint work by Honzik and the third author. (shrink)

In this paper, we investigate a new model theoretical tree property (TP), called the antichain tree property (ATP). We develop combinatorial techniques for ATP. First, we show that ATP is always witnessed by a formula in a single free variable, and for formulas, not having ATP is closed under disjunction. Second, we show the equivalence of ATP and [Formula: see text]-ATP, and provide a criterion for theories to have not ATP (being NATP). Using these combinatorial observations, we find (...) algebraic examples of ATP and NATP, including pure groups, pure fields and valued fields. More precisely, we prove Mekler’s construction for groups, Chatzidakis’ style criterion for pseudo-algebraically closed (PAC) fields, and the AKE-style principle for valued fields preserving NATP. We give a construction of an antichain tree in the Skolem arithmetic and atomless Boolean algebras. (shrink)

For a tree T of its height equal to or less than ω1, we construct a space XT by attaching a circle to each node and connecting each node to its successors by intervals. is the Hawaiian earring and H1T denotes a canonical factor of the first integral singular homology group. The following equivalences hold for an ω1-tree T: π1 is embeddable into π1, if and only if is embeddable into H1T, if and only if T is not (...) an Aronzajn tree. π1 is embeddable into if and only if H1T is embeddable into if and only if T is a special Aronzajn tree. π1 has a retract isomorphic to an uncountable free group, if and only if H1T has a summand isomorphic to an uncountable free abelian group, if and only if T has an uncountable anti-chain. (shrink)

We construct creature forcings with strong Axiom A that specialize a given Aronszajn tree. We work with tree creature forcing. The creatures that live on the Aronszajn tree are normed and have the halving property. We show that our models fulfill ℵ1=d

Set Theory in Philosophy of Mathematics

Direct download (3 more)  

 

Export citation  

 

Bookmark   1 citation  

Niche construction is a concept that captures a wide array of biological phenomena, from the environmental effects of metabolism to the creation of complex structures such as termite mounds and beaver dams. A central point in niche construction theory is that organisms do not just passively undergo developmental, ecological, or evolutionary processes, but are also active participants in them Evolution: From molecules to men, Cambridge University Press, Cambridge, 1983; Laland KN, Odling-Smee J, Feldman MW, In: KN Laland and (...) T Uller Evolutionary causation: Biological and philosophical reflections, MIT Press, Cambridge, MA, 2019). In this paper, we distinguish between two fundamentally different ways in which organisms are active participants: as agents and as contributors. Roughly, organisms act as agents when niche constructing effects are a result of a goal-directed behavior over which the organisms have some degree of control. Organisms act as contributors when the niche constructing effects do not arise from a goal to perform the constructive activity. As illustrative examples we discuss plants altering leaf-morphology to optimize light exposure as reported by Sultan and bacteria creating novel niches through excreting energy-rich metabolites. The difference between agential and contributional niche construction is important for understanding the different ways organisms can actively participate in development, ecology, and evolution. Additionally, this distinction can increase our understanding of how the capacity of agency is distributed across the tree of life and how agency influences developmental and evolutionary processes. (shrink)

In a recent paper,(1) palaeontologist Mike Benton claimed that our ability to reconstruct accurately the tree of Life may not have improved significantly over the last 100 years. This implies that the cladistic and molecular revolutions may have promulgated as much bad “black box” science as rigorous investigation. Benton's assessment was based on the extent to which cladograms (typically constructed with reference only to distributions of character states) convey the same narrative as the geochronological ages of fossil taxa (an (...) independent data set). Fossil record quality varies greatly between major clades, and the palaeontological dating “yardstick” may be more appropriate for some groups than others. BioEssays 24:203–207, 2002. © 2002 Wiley Periodicals, Inc.; DOI 10.1002/bies.10065. (shrink)

We use set-theoretic tools to make a model-theoretic contribution. In particular, we construct a single \-sentence \ that codes Kurepa trees to prove the following statements: The spectrum of \ is consistently equal to \ and also consistently equal to \\), where \ is weakly inaccessible.The amalgamation spectrum of \ is consistently equal to \ and \\), where again \ is weakly inaccessible. This is the first example of an \-sentence whose spectrum and amalgamation spectrum are consistently both right-open and (...) right-closed. It also provides a positive answer to a question in Souldatos :533–551, 2014).Consistently, \ has maximal models in finite, countable, and uncountable many cardinalities. This complements the examples given in Baldwin et al. :545–565, 2016) and Baldwin and Souldatos :444–452, 2019) of sentences with maximal models in countably many cardinalities.Consistently, \ and there exists an \-sentence with models in \, but no models in \. This relates to a conjecture by Shelah that if \, then any \-sentence with a model of size \ also has a model of size \. Our result proves that \ can not be replaced by \, even if \. (shrink)