A notion called Herbrand saturation is shown to provide the model-theoretic analogue of a proof-theoretic method, Herbrand analysis, yielding uniform model-theoretic proofs of a number of important conservation theorems. A constructive, algebraic variation of the method is described, providing yet a third approach, which is finitary but retains the semantic flavor of the model-theoretic version.

Individuals suffering from depression consistently report experiencing a lack of connectedness with others. David Karp (2017, 73), in his memoir and study of depression, has gone so far to describe depression as “an illness of isolation, a disease of disconnectedness”. It has become common, in phenomenological circles, to attribute this social impairment to the depressed individual experiencing their body as corporealized, acting as a barrier between them and the world around them (Fuchs 2005, 2016). In this paper, I offer an (...) alternative view of the experience of social disconnectedness in depression, suggesting that rather than necessarily experiencing their body as object-like, the depressed individual’s bodily is saturated with experiences of lethargy, tiredness, heaviness, sadness, hopelessness and so on, to the exclusion of being able to bodily connect to others. I suggest that depression does not involve a complete social impairment but a specific impairment of affective forms of interpersonal experience. (shrink)

This paper is devoted to the problem of existence of saturated models for first-order many-valued logics. We consider a general notion of type as pairs of sets of formulas in one free variable that express properties that an element of a model should, respectively, satisfy and falsify. By means of an elementary chains construction, we prove that each model can be elementarily extended to a $\kappa $-saturated model, i.e. a model where as many types as possible are realized. In order (...) to prove this theorem we obtain, as by-products, some results on tableaux and their consistency and satisfiability and a generalization of the Tarski–Vaught theorem on unions of elementary chains. Finally, we provide a structural characterization of $\kappa $-saturation in terms of the completion of a diagram representing a certain configuration of models and mappings. (shrink)

Saturated models constitute one of the powerful methods of conventional model theory, with many applications. Here we develop a categorical abstract model theoretic approach to saturated models within the theory of institutions. The most important consequence is that the method of saturated models becomes thus available to a multitude of logical systems from logic or from computing science. In this paper we define the concept of saturated model at an abstract institution-independent level and develop the fundamental existence and uniqueness theorems. (...) As an application we prove a general institution-independent version of the Keisler–Shelah isomorphism theorem “any two elementarily equivalent models have isomorphic ultrapowers” (assuming Generalized Continuum Hypothesis). (shrink)

We show that if κ is an infinite successor cardinal, and λ > κ a cardinal of cofinality less than κ satisfying certain conditions, then no ideal on Pκ is weakly λ+-saturated. © 2011 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

Theorem 0.1LetK\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbf {K}$$\end{document}be an abstract elementary class with amalgamation and no maximal models. Letλ>LS\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\lambda > {LS}$$\end{document}. IfK\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbf {K}$$\end{document}is categorical inλ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\lambda $$\end{document}, then the model of cardinalityλ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\lambda $$\end{document}is Galois-saturated.This answers a question asked independently by Baldwin and (...) Shelah. We deduce several corollaries: K\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbf {K}$$\end{document} has a unique limit model in each cardinal below λ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\lambda $$\end{document}, K\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbf {K}$$\end{document} is weakly tame below λ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\lambda $$\end{document}, and the thresholds of several existing categoricity transfers can be improved.We also prove a downward transfer of solvability :Corollary 0.2LetK\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbf {K}$$\end{document}be an AEC with amalgamation and no maximal models. Letλ>μ>LS\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\lambda> \mu > {LS}$$\end{document}. IfK\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbf {K}$$\end{document}is solvable inλ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\lambda $$\end{document}, thenK\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbf {K}$$\end{document}is solvable inμ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mu $$\end{document}. (shrink)

We put in print a classical result that states that for most purposes, there is no harm in assuming the existence of saturated models in model theory. The presentation is aimed for model theorists with only basic knowledge of axiomatic set theory.

In the third book in the trilogy that includes Reduction and Givenness and Being Given. Marion renews his argument for a phenomenology of givenness, with penetrating analyses of the phenomena of event, idol, flesh, and icon. Turning explicitly to hermeneutical dimensions of the debate, Marion masterfully draws together issues emerging from his close reading of Descartes and Pascal, Husserl and Heidegger, Levinas and Henry. Concluding with a revised version of his response to Derrida, In the Name: How to Avoid Speaking (...) of It, Marion powerfully re-articulates the theological possibilities of phenomenology. (shrink)

We use the language of categorical logic to construct generic saturated models of intuitionistic theories. Our main technique is the thorough study of the filter construction on categories with finite limits, which is the completion of subobject lattices under filtered meets. When restricted to coherent or Heyting categories, classifying categories of intuitionistic first-order theories, the resulting categories are filtered meet coherent categories, coherent categories with complete subobject lattices such that both finite disjunctions and existential quantification distribute over filtered meets. Such (...) categories naturally embed into Grothendieck toposes which then contain saturated models of the theory we started with. (shrink)

Multiple-universe theories (involving the saturation of a state space of alternative universes) enjoy growing popularity as proposed counters to the design-suggestiveness of increasingly impressive cosmic fine-tuning cases. In this paper I explore this type of counter, and argue that (i) multiple-universe theoriesdo not necessarily undercut the design relevance of cosmic fine-tuning, that (ii) both the required saturation and the hypothesized mechanisms supposed to generate such saturation face seriously non-trivial constraints, and that (iii) in some cases the specific (...) characteristics of such saturations may themselves be suggestive of design. (shrink)

Given a regular uncountable cardinal κ and a cardinal λ > κ of cofinality ω, we show that the restriction of the non-stationary ideal on Pκ to the set of all a with equation image is not λ++-saturated . We actually prove the stronger result that there is equation image with |Q| = λ++ such that A∩B is a non-cofinal subset of Pκ for any two distinct members A, B of Q, where NGκ, λ denotes the game ideal on Pκ. (...) We also remark that for κ > ω1, adding λ+3 Cohen subsets of ω1 to equation image makes NGκ, λ λ+3-saturated. (shrink)

ABSTRACT The question of this article is whether the saturated phenomenon as articulated in the early work of Jean-Luc Marion may appear within language and history, or in other words how a non- or extra-horizonal event can appear within the horizons necessary for communication and communality. This problem is significant, among other reasons, because saturated aesthetic, ethical, and religious phenomena constitute important bases for communal values. The article argues that Hans-Georg Gadamer’s philosophy of language offers resources that allow us to (...) understand how a saturated phenomenon can appear communicably and communally without sacrificing the irreducible excessiveness of its appearance. The author draws on parallels between Marion and Gadamer to argue that the poetic word and the conversation present possibilities of the saturated phenomenon occurring within language and history, and suggests the “saturated question” as a name for this mode of appearance. (shrink)

The paper is a continuation of the investigations of [3]. We assume that the reader is familiar with the notion of an !-saturated model and the notation applied in the theory of models. We refer to [2] for all model- theoretic terms which appear in this note.

We show that under the assumption of the existence of the canonical inner model with one Woodin cardinal$M_1$, there is a model of$\mathsf {ZFC}$in which$\mbox {NS}_{\omega _{1}}$is$\aleph _2$-saturated and${\Delta }_{1}$-definable with$\omega _1$as a parameter which answers a question of S. D. Friedman and L. Wu. We also show that starting from an arbitrary universe with a Woodin cardinal, there is a model with$\mbox {NS}_{\omega _{1}}$saturated and${\Delta }_{1}$-definable with a ladder system$\vec {C}$and a full Suslin treeTas parameters. Both results rely on (...) a new coding technique whose presentation is the main goal of this article. (shrink)

$\underline{\text{Saturation is} (\mu, \kappa)-\text{transferable in} T}$ if and only if there is an expansion T 1 of T with ∣ T 1 ∣ = ∣ T ∣ such that if M is a μ-saturated model of T 1 and ∣ M ∣ ≥ κ then the reduct M ∣ L(T) is κ-saturated. We characterize theories which are superstable without f.c.p., or without f.c.p. as, respectively those where saturation is (ℵ 0 , λ)- transferable or (κ (T), λ)-transferable for (...) all λ. Further if for some $\mu \geq \mid T \mid, 2^\mu > \mu^+$ , stability is equivalent to for all μ ≥ ∣ T ∣, saturation is (μ, 2 μ )- transferable. (shrink)

This book contains the material for a first course in pure model theory with applications to differentially closed fields.

A key topic within the field of the phenomenology of medicine has been the relationship between body and self in illness, including discussions about the otherness and mineness of the body. The aim of this article is to distinguish between different meanings of bodily otherness and mineness in illness with reference to the interpretation of the body as “saturated phenomenon,” inspired by the phenomenology of Jean-Luc Marion. With the help of Marion’s ideas it is possible to distinguish between two meanings (...) of bodily otherness and of mineness (objective and non-objective forms). These distinctions support and elaborate on ideas already found in the phenomenology of medicine and offer further insights into the nature of the experience of illness. (shrink)

The paper presents an outline of the general theory of countable arithmetically saturated models of PA and some of its applications. We consider questions concerning the automorphism group of a countable recursively saturated model of PA. We prove new results concerning fixed point sets, open subgroups, and the cofinality of the automorphism group. We also prove that the standard system of a countable arithmetically saturated model of PA is determined by the lattice of its elementary substructures.

Poorly saturated colors are closer to a pure grey than strongly saturated ones and, therefore, appear less “colorful”. Color saturation is effectively manipulated in the visual arts for balancing conflicting sensations and moods and for inducing the perception of relative distance in the pictorial plane. While perceptual science has proven quite clearly that the luminance contrast of any hue acts as a self-sufficient cue to relative depth in visual images, the role of color saturation in such figure-ground organization (...) has remained unclear. We presented configurations of colored inducers on grey ‘test’ backgrounds to human observers. Luminance and saturation of the inducers was uniform on each trial, but varied across trials. We ran two separate experimental tasks. In the relative background brightness task, perceptual judgments indicated whether the apparent brightness of the grey test background contrasted with, assimilated to, or appeared equal (no effect) to that of a comparison background with the same luminance contrast. Contrast polarity and its interaction with color saturation affected response proportions for contrast, assimilation and no effect. In the figure-ground task, perceptual judgments indicated whether the inducers appeared to lie in front of, behind, or in the same depth with the background. Strongly saturated inducers produced significantly larger proportions of foreground effects indicating that these inducers stand out as figure against the background. Weakly saturated inducers produced significantly larger proportions of background effects, indicating that these inducers are perceived as lying behind the backgrounds. We infer that color saturation modulates figure-ground organization, both directly by determining relative inducer depth, and indirectly, and in interaction with contrast polarity, by affecting apparent background brightness. The results point towards a hitherto undocumented functional role of color saturation in the genesis of form, and in particular figure-ground percepts in the absence of chromatostereopsis. (shrink)

We study reducts of Peano arithmetic for which conditions of saturation imply the corresponding conditions for the whole model. It is shown that very weak reducts (like pure order) have such a property for κ-saturation in every κ ≥ ω 1 . In contrast, other reducts do the job for ω and not for $\kappa > \omega_1$ . This solves negatively a conjecture of Chang.

Suppose that λ is the successor of a singular cardinal μ whose cofinality is an uncountable cardinal κ. We give a sufficient condition that the club filter of λ concentrating on the points of cofinality κ is not λ+-saturated.1 The condition is phrased in terms of a notion that we call weak reflection. We discuss various properties of weak reflection. We introduce a weak version of the ♣-principle, which we call ♣*−, and show that if it holds on a stationary (...) subset S of λ, then no normal filter on S is λ+-saturated. Under the above assumptions, ♣*− is true for any stationary subset S of λ which does not contain points of cofinality κ. For stationary sets S which concentrate on points of cofinality κ, we show that ♣*− holds modulo an ideal obtained through the weak reflection. (shrink)

In Reasons and Persons, Parfit (1984) posed a challenge: provide a satisfying normative account that solves the Non-Identity Problem, avoids the Repugnant and Absurd Conclusions, and solves the Mere-Addition Paradox. In response, some have suggested that we look toward person-affecting views of morality for a solution. But the person-affecting views that have been offered so far have been unable to satisfy Parfit's four requirements, and these views have been subject to a number of independent complaints. This paper describes a person-affecting (...) account which meets Parfit's challenge. The account satisfies Parfit's four requirements, and avoids many of the criticisms that have been raised against person-affecting views. (shrink)

We study the two model-theoretic concepts of weak saturation and weak amalgamation property in the context of accessible categories. We relate these two concepts providing sufficient conditions for existence and uniqueness of weakly saturated objects of an accessible category ${\cal K}$. We discuss the implications of this fact in classical model theory.

We show that is a quasi-minimal torsion-free divisible abelian group. After discussing the axiomatization of the theory of this structure, we present its ω-saturated quasi-minimal model.

Our aim was to try to generalize some theorems about the saturation of ultrapowers to reduced powers. Naturally, we deal with saturation for types consisting of atomic formulas. We succeed to generalize “the theory of dense linear order (or T with the strict order property) is maximal and so is any which is SOP3”, (where Δ consists of atomic or conjunction of atomic formulas). However, the theorem on “it is enough to deal with symmetric pre‐cuts” (so the theorem) (...) cannot be generalized in this case. Similarly the uniqueness of the dual cofinality fails in this context. (shrink)

Given a regular cardinal κ > ω1 and a cardinal λ with κ ≤ cf (λ) < λ, we show that NSκ,λ | T is not λ+-saturated, where T is the set of all \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${a\in P_\kappa (\lambda)}$$\end{document} such that \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${| a | = | a \cap \kappa|}$$\end{document} and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\rm cf} \big( {\rm sup} (a\cap\kappa)\big) (...) = {\rm cf} \big({\rm sup} (a)\big) = \omega}$$\end{document}. (shrink)

We show that it is consistent relative to a huge cardinal that for all infinite cardinals [Formula: see text], [Formula: see text] holds and there is a stationary [Formula: see text] such that [Formula: see text] is [Formula: see text]-saturated.

We discuss saturating ultrafilters on N, relating them to other types of nonprincipal ultrafilter. (a) There is an (ω,c)-saturating ultrafilter on $\mathbf{N} \operatorname{iff} 2^\lambda \leq \mathfrak{c}$ for every $\lambda and there is no cover of R by fewer than c nowhere dense sets. (b) Assume Martin's axiom. Then, for any cardinal κ, a nonprincipal ultrafilter on N is (ω,κ)-saturating iff it is almost κ-good. In particular, (i) p(κ)-point ultrafilters are (ω,κ)-saturating, and (ii) the set of (ω,κ)-saturating ultrafilters is invariant under (...) homeomorphisms of $\beta\mathbf{N\backslash N}$ . (c) It is relatively consistent with ZFC to suppose that there is a Ramsey p(c)-point ultrafilter which is not (ω,c)-saturating. (shrink)

A phenomenon is that which appears. In his phenomenology, Jean-Luc Marion shows how a phenomenon that appears in and out of itself evades the metaphysical demand of grounding. Classical philosophy has acknowledged phenomena only in so far as they can be sanctioned by the concepts of the intellect. This holds good also of Husserl’s constitutive ego. Now, Marion distinguishes between such intuitively “poor phenomena” and the “saturated phenomena” that exceed the intentional consciousness; they are given not by the consciousness but (...) to the consciousness in an excess of intuition. This “gift of appearance” is Marion’s main concern, in the visible in general, and in painting in particular. But whereas idols only reflect our own desire to see and to be seen, icons surprise us by the gaze the saint directs on us. A picture is the scene of a possible revelation; and the revelation is nothing but the phenomenon taken in its fullest meaning: intuitive saturation at its maximum. A crucial question, nonetheless, remains: What is the relation between revelation as a phenomenological possibility, and Revelation as a theological dogma of the utmost importance? (shrink)

The article focuses on Jean-Luc Marion’s ‘saturated phenomenon’ by reading it within the context of Husserl’s Logical Investigations. It is argued that Marion’s revision of Husserl must not be understood as a refutation of Husserl but rather as an extension of Husserlian phenomenology. In other words, since Marion needs Husserl and the thesis of intentionality to develop his ideas, the saturated phenomenon affirms the structure of classical phenomenology. This implies corrections of Marion’s description of the saturated phenomenon: the article investigates (...) how the Husserlian idea of ‘disappointment’ (Enttäuschung) is able to elucidate the saturated phenomenon. (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)

A theory [Formula: see text] is said to have exact saturation at a singular cardinal [Formula: see text] if it has a [Formula: see text]-saturated model which is not [Formula: see text]-saturated. We show, under some set-theoretic assumptions, that any simple theory has exact saturation. Also, an NIP theory has exact saturation if and only if it is not distal. This gives a new characterization of distality.

This paper was motivated by the following two questions which arise in the theory of complexity for computation over ordered rings in the now famous computational model introduced by Blum, Shub and Smale: 1. is the answer to the question P = ?NP the same in every real-closed field?2. if P ≠ NP for , does there exist a problem of which is NP but neither P nor NP-complete ?Some unclassical complexity classes arise naturally in the study of these questions. (...) They are still open, but we could obtain unconditional results of independent interest.Michaux introduced/const complexity classes in an effort to attack question . We show that , answering a question of his. Here A is the class of real problems which are algorithmic in bounded time. We also prove the stronger result: , where PAR stands for parallel polynomial time. In our terminology, we say that is A-saturated and PAR-saturated. We also prove, at the nonuniform level, the above results for every real-closed field. It is not known whether is P-saturated. In the case of the reals with addition and order we obtain P-saturation ). More generally, we show that an ordered -vector space is P-saturated at the nonuniform level ).We also study a stronger notion that we call P-stability. Blum, Cucker, Shub and Smale have shown that fields of characteristic 0 are P-stable. We show that the reals with addition and order are P-stable, but real-closed fields are not.Questions and and the/const complexity classes have some model theoretic flavor. This leads to the theory of complexity over “arbitrary” structures as introduced by Poizat. We give a summary of this theory with a special emphasis on the connections with model theory and we study/const complexity classes from this point of view. Note also that our proof of the PAR-saturation of shows that an o-minimal structure which admits quantifier elimination is A-saturated at the nonuniform level. (shrink)

A method for constructing Boolean-valued models of some fragments of arithmetic was developed in Krajíček (Forcing with Random Variables and Proof Complexity, London Mathematical Society Lecture Notes Series, Cambridge University Press, Cambridge, 2011), with the intended applications in bounded arithmetic and proof complexity. Such a model is formed by a family of random variables defined on a pseudo-finite sample space. We show that under a fairly natural condition on the family [called compactness in Krajíček (Forcing with Random Variables and Proof (...) Complexity, London Mathematical Society Lecture Notes Series, Cambridge University Press, Cambridge, 2011)] the resulting structure has a property that is naturally interpreted as saturation for existential types. We also give an example showing that this cannot be extended to universal types. (shrink)

We give an exposition of results of Baldwin–Shelah [2] on saturated free algebras, at the level of generality of complete first order theories T with a saturated model M which is in the algebraic closure of an indiscernible set. We then make some new observations when M is a saturated free algebra, analogous to results for the free group, such as a description of forking.

Elementary Recursive Nonstandard Analysis, in short ERNA, is a constructive system of nonstandard analysis with a PRA consistency proof, proposed around 1995 by Patrick Suppes and Richard Sommer. It is built on a previous system by Rolando Chuaqui and Patrick Suppes, which was recently reconsidered by Michal Rössler and Emil Jeřábek. A $\Pi _1 $ -transfer principle has already been added to ERNA and the consistency of the resulting theory proved in PRA. Here, we equip ERNA with Σ₂-transfer and a (...) saturation principle, while keeping the consistency proof inside PRA. We show that the extended theory allows for generalized transfer, a basic tool of nonstandard analysis, and interprets several strong theories, like BΣ₂ and IΣ₂. (shrink)

We show, using a variation of Woodin’s partial order ℙ max , that it is possible to destroy the saturation of the nonstationary ideal on ω 1 by forcing with a Suslin tree. On the other hand, Suslin trees typcially preserve saturation in extensions by ℙ max variations where one does not try to arrange it otherwise. In the last section, we show that it is possible to have a nonmeager set of reals of size ℵ1, saturation (...) of the nonstationary ideal, and no weakly Lusin sequences, answering a question of Shelah and Zapletal. (shrink)

Starting with a λ-supercompact cardinal κ, where λ is a regular cardinal greater than or equal to κ, we produce a model with a stationary subset S of such that , the ideal generated by the non-stationary ideal over together with , is λ+-saturated. Using this model we prove the consistency of the existence of such a stationary set together with the Generalized Continuum Hypothesis . We also show that in our model we can make -saturated, where S is the (...) set of all such that , the order type of x, is a regular cardinal and x is stationary in sup. Furthermore we construct a model where is κ+-saturated but GCH fails. We show that if SS is stationary in , then S can be split into λ many disjoint stationary subsets. (shrink)

The author tries to outline the new possibilities the phenomenology offers for considerations of a specific type of phenomenality which in some respects goes be yond the rules of phenomenalization as defined by Husserl in connection with „the principle of principles“ as well as exploring the horizon, i.e. the constitutive condition of any giving. While the phenomenon – equally with Kant and Husserl – gives itself to the extent corresponding its intuition inadequacy or „lacking“ of intuition, Marion tries to outline (...) such a conception of a phenomenon, which would be marked by a „surplus“ of intuition. Drawing on Husserl and especially on Kant, the definition of the „saturated phenomenon“ proceeds step by step on the ground of a critical interpretation of some Kantian concepts. Such an unconditioned and irreducible phenomenon transcends in its nature everything the intentional meaning is able to comprehend. From this it is obvious, that the concept of a saturated phenomenon urges us to revise also the phenomenological concept of subject as a constitutive instance . Further, the phenomenological analysis borders here a certain type of religious experience. (shrink)

In the early eighties, answering a question of A. Macintyre, J. H. Schmerl ([13]) proved that every countable recursively saturated structure, equipped with a function β encoding the finite functions, is the β-closure of an infinite indiscernible sequence. This result implies that every countably saturated structure, in a countable but not necessarily recursive language, is an Ehrenfeucht-Mostowski model, by which we mean that the structure expands, in a countable language, to the Skolem hull of an infinite indiscernible sequence (in the (...) new language). More recently, D. Lascar ([5]) showed that the saturated model of cardinality ℵ 1 of an ω-stable theory is also an Ehrenfeucht-Mostowski model. These results naturally raise the following problem: which (countable) complete theories have an uncountably saturated Ehrenfeucht-Mostowski model. We study a generalization of this question. Namely, we call ACI-model a structure which can be expanded, in a countable language L', to the algebraic closure (in L') of an infinite indiscernible sequence (in L'). And we try to characterize the λ-saturated structures which are ACI-models. The main results are the following. First it is enough to restrict ourselves to ℵ 1 -saturated structures: if T has an ℵ 1 -saturated ACI-model then, for every infinite λ, T has a λ-saturated ACI-model. We obtain a complete answer in the case of stable theories: if T is stable then the three following properties are equivalent: (a) T is ω-stable, (b) T has a ℵ 1 saturated ACI-model, (c) every saturated model of T is an Ehrenfeucht-Mostowski model. The unstable case is more complicated, however we show that if T has an ℵ 1 -saturated ACI-model then T doesn't have the independence property. (shrink)

In this paper we shall discuss properties of saturation in monotonic neighbourhood models and study some applications, like a characterization of compact and modally saturated monotonic models and a characterization of the maximal Hennessy-Milner classes. We shall also show that our notion of modal saturation for monotonic models naturally extends the notion of modal saturation for Kripke models.