Set Theory

Edited by Toby Meadows (University of California, Irvine)
Related categories

2275 found
Order:
1 — 50 / 2275
Material to categorize
  1. Un teorema sobre el Modelo de Solovay.Franklin Galindo - 2020 - Divulgaciones Matematicas 21 (1-2): 42–46.
    The objective of this article is to present an original proof of the following theorem: Thereis a generic extension of the Solovay’s model L(R) where there is a linear order of P(N)/fin that extends to the partial order (P(N)/f in), ≤*). Linear orders of P(N)/fin are important because, among other reasons, they allow constructing non-measurable sets, moreover they are applied in Ramsey's Theory .
    Remove from this list   Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  2. Tópicos de Ultrafiltros.Franklin Galindo - 2020 - Divulgaciones Matematicas 21 (1-2):54-77.
    Ultrafilters are very important mathematical objects in mathematical research [6, 22, 23]. There are a wide variety of classical theorems in various branches of mathematics where ultrafilters are applied in their proof, and other classical theorems that deal directly with ultrafilters. The objective of this article is to contribute (in a divulgative way) to ultrafilter research by describing the demonstrations of some such theorems related (uniquely or in combination) to topology, measurement theory, algebra, combinatorial infinite, set theory y first-order logic, (...)
    Remove from this list   Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  3. Dos Tópicos de Lógica Matemática y sus Fundamentos.Franklin Galindo - 2014 - Episteme NS: Revista Del Instituto de Filosofía de la Universidad Central de Venezuela 34 (1):41-66..
    El objetivo de este artículo es presentar dos tópicos de Lógica matemática y sus fundamentos: El primer tópico es una actualización de la demostración de Alonzo Church del Teorema de completitud de Gödel para la Lógica de primer orden, la cual aparece en su texto "Introduction to Mathematical Logic" (1956) y usa el procedimientos efectivos de Forma normal prenexa y Forma normal de Skolem; y el segundo tópico es una demostración de que la propiedad de partición (tipo Ramsey) del espacio (...)
    Remove from this list   Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  4. Fermat’s Last Theorem Proved in Hilbert Arithmetic. II. Its Proof in Hilbert Arithmetic by the Kochen-Specker Theorem with or Without Induction.Vasil Penchev - 2022 - Logic and Philosophy of Mathematics eJournal (Elsevier: SSRN) 14 (10):1-52.
    The paper is a continuation of another paper published as Part I. Now, the case of “n=3” is inferred as a corollary from the Kochen and Specker theorem (1967): the eventual solutions of Fermat’s equation for “n=3” would correspond to an admissible disjunctive division of qubit into two absolutely independent parts therefore versus the contextuality of any qubit, implied by the Kochen – Specker theorem. Incommensurability (implied by the absence of hidden variables) is considered as dual to quantum contextuality. The (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  5. On Categoricity in Successive Cardinals.Sebastien Vasey - 2020 - Journal of Symbolic Logic:1-19.
    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.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  6. Closure Properties of Measurable Ultrapowers.Philipp Lücke & Sandra Müller - 2021 - Journal of Symbolic Logic 86 (2):762-784.
    We study closure properties of measurable ultrapowers with respect to Hamkin's notion of freshness and show that the extent of these properties highly depends on the combinatorial properties of the underlying model of set theory. In one direction, a result of Sakai shows that, by collapsing a strongly compact cardinal to become the double successor of a measurable cardinal, it is possible to obtain a model of set theory in which such ultrapowers possess the strongest possible closure properties. In the (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  7. Tukey Order Among Ideals.Jialiang He, Michael Hrušák, Diego Rojas-Rebolledo & Sławomir Solecki - 2021 - Journal of Symbolic Logic 86 (2):855-870.
    We investigate the Tukey order in the class of Fσ ideals of subsets of ω. We show that no nontrivial Fσ ideal is Tukey below a Gδ ideal of compact sets. We introduce the notions of flat ideals and gradually flat ideals. We prove a dichotomy theorem for flat ideals isolating gradual flatness as the side of the dichotomy that is structurally good. We give diverse characterizations of gradual flatness among flat ideals using Tukey reductions and games. For example, we (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  8. The Order of Reflection.Juan P. Aguilera - 2021 - Journal of Symbolic Logic 86 (4):1555-1583.
    Extending Aanderaa’s classical result that $\pi ^{1}_{1} < \sigma ^{1}_{1}$, we determine the order between any two patterns of iterated $\Sigma ^{1}_{1}$ - and $\Pi ^{1}_{1}$ -reflection on ordinals. We show that this order of linear reflection is a prewellordering of length $\omega ^{\omega }$. This requires considering the relationship between linear and some non-linear reflection patterns, such as $\sigma \wedge \pi $, the pattern of simultaneous $\Sigma ^{1}_{1}$ - and $\Pi ^{1}_{1}$ -reflection. The proofs involve linking the lengths of (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  9. Bi-Interpretation in Weak Set Theories.Alfredo Roque Freire & Joel David Hamkins - 2021 - Journal of Symbolic Logic 86 (2):609-634.
    In contrast to the robust mutual interpretability phenomenon in set theory, Ali Enayat proved that bi-interpretation is absent: distinct theories extending ZF are never bi-interpretable and models of ZF are bi-interpretable only when they are isomorphic. Nevertheless, for natural weaker set theories, we prove, including Zermelo–Fraenkel set theory $\mathrm {ZFC}^{-}$ without power set and Zermelo set theory Z, there are nontrivial instances of bi-interpretation. Specifically, there are well-founded models of $\mathrm {ZFC}^{-}$ that are bi-interpretable, but not isomorphic—even $\langle H_{\omega _1},\in (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  10. Pseudo-Finite Sets, Pseudo-o-Minimality.Nadav Meir - 2021 - Journal of Symbolic Logic 86 (2):577-599.
    We give an example of two ordered structures $\mathcal {M},\mathcal {N}$ in the same language $\mathcal {L}$ with the same universe, the same order and admitting the same one-variable definable subsets such that $\mathcal {M}$ is a model of the common theory of o-minimal $\mathcal {L}$ -structures and $\mathcal {N}$ admits a definable, closed, bounded, and discrete subset and a definable injective self-mapping of that subset which is not surjective. This answers negatively two question by Schoutens; the first being whether (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  11. Generic Coding with Help and Amalgamation Failure.Sy-David Friedman & Dan Hathaway - 2021 - Journal of Symbolic Logic 86 (4):1385-1395.
    We show that if M is a countable transitive model of $\text {ZF}$ and if $a,b$ are reals not in M, then there is a G generic over M such that $b \in L[a,G]$. We then present several applications such as the following: if J is any countable transitive model of $\text {ZFC}$ and $M \not \subseteq J$ is another countable transitive model of $\text {ZFC}$ of the same ordinal height $\alpha $, then there is a forcing extension N of (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  12. Relationships Between Computability-Theoretic Properties of Problems.Rod Downey, Noam Greenberg, Matthew Harrison-Trainor, Ludovic Patey & Dan Turetsky - 2022 - Journal of Symbolic Logic 87 (1):47-71.
    A problem is a multivalued function from a set of instances to a set of solutions. We consider only instances and solutions coded by sets of integers. A problem admits preservation of some computability-theoretic weakness property if every computable instance of the problem admits a solution relative to which the property holds. For example, cone avoidance is the ability, given a noncomputable set A and a computable instance of a problem ${\mathsf {P}}$, to find a solution relative to which A (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  13. Intrinsic Smallness.Justin Miller - 2021 - Journal of Symbolic Logic 86 (2):558-576.
    Recent work in computability theory has focused on various notions of asymptotic computability, which capture the idea of a set being “almost computable.” One potentially upsetting result is that all four notions of asymptotic computability admit “almost computable” sets in every Turing degree via coding tricks, contradicting the notion that “almost computable” sets should be computationally close to the computable sets. In response, Astor introduced the notion of intrinsic density: a set has defined intrinsic density if its image under any (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  14. Mitchell-Inspired Forcing, with Small Working Parts and Collections of Models of Uniform Size as Side Conditions, and Gap-One Simplified Morasses.Charles Morgan - 2022 - Journal of Symbolic Logic 87 (1):392-415.
    We show that a $$ -simplified morass can be added by a forcing with working parts of size smaller than $\kappa $. This answers affirmatively the question, asked independently by Shelah and Velleman in the early 1990s, of whether it is possible to do so.Our argument use a modification of a technique of Mitchell’s for adding objects of size $\omega _2$ in which collections of models – all of equal, countable size – are used as side conditions. In our modification, (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  15. Stably Measurable Cardinals.Philip D. Welch - 2021 - Journal of Symbolic Logic 86 (2):448-470.
    We define a weak iterability notion that is sufficient for a number of arguments concerning $\Sigma _{1}$ -definability at uncountable regular cardinals. In particular we give its exact consistency strength first in terms of the second uniform indiscernible for bounded subsets of $\kappa $ : $u_2$, and secondly to give the consistency strength of a property of Lücke’s.TheoremThe following are equiconsistent:There exists $\kappa $ which is stably measurable;for some cardinal $\kappa $, $u_2=\sigma $ ;The $\boldsymbol {\Sigma }_{1}$ -club property holds (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  16. Le Pascal de Léon Brunschvicg.Maria Vita Romeo - 2021 - Revue de Métaphysique et de Morale 3:321-336.
    Remove from this list   Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  17. Level Theory, Part 1: Axiomatizing the Bare Idea of a Cumulative Hierarchy of Sets.Tim Button - 2021 - Bulletin of Symbolic Logic 27 (4):436-460.
    The following bare-bones story introduces the idea of a cumulative hierarchy of pure sets: 'Sets are arranged in stages. Every set is found at some stage. At any stage S: for any sets found before S, we find a set whose members are exactly those sets. We find nothing else at S.' Surprisingly, this story already guarantees that the sets are arranged in well-ordered levels, and suffices for quasi-categoricity. I show this by presenting Level Theory, a simplification of set theories (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  18. Level Theory, Part 2: Axiomatizing the Bare Idea of a Potential Hierarchy.Tim Button - 2021 - Bulletin of Symbolic Logic 27 (4):461-484.
    Potentialists think that the concept of set is importantly modal. Using tensed language as an heuristic, the following bar-bones story introduces the idea of a potential hierarchy of sets: 'Always: for any sets that existed, there is a set whose members are exactly those sets; there are no other sets.' Surprisingly, this story already guarantees well-foundedness and persistence. Moreover, if we assume that time is linear, the ensuing modal set theory is almost definitionally equivalent with non-modal set theories; specifically, with (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  19. Most-Intersection of Countable Sets.Ahmet Çevik & Selçuk Topal - 2021 - Journal of Applied Non-Classical Logics 31 (3-4):343-354.
    We introduce a novel set-intersection operator called ‘most-intersection’ based on the logical quantifier ‘most’, via natural density of countable sets, to be used in determining the majority chara...
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  20. What the Tortoise Said to Achilles: Lewis Carroll’s Paradox in Terms of Hilbert Arithmetic.Vasil Penchev - 2021 - Logic and Philosophy of Mathematics eJournal (Elsevier: SSRN) 13 (22):1-32.
    Lewis Carroll, both logician and writer, suggested a logical paradox containing furthermore two connotations (connotations or metaphors are inherent in literature rather than in mathematics or logics). The paradox itself refers to implication demonstrating that an intermediate implication can be always inserted in an implication therefore postponing its ultimate conclusion for the next step and those insertions can be iteratively and indefinitely added ad lib, as if ad infinitum. Both connotations clear up links due to the shared formal structure with (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  21. Reflection Principles and Second-Order Choice Principles with Urelements.Bokai Yao - 2022 - Annals of Pure and Applied Logic 173 (4):103073.
    We study reflection principles in Kelley-Morse set theory with urelements (KMU). We first show that First-Order Reflection Principle is not provable in KMU with Global Choice. We then show that KMU + Limitation of Size + Second-Order Reflection Principle is mutually interpretable with KM + Second-Order Reflection Principle. Furthermore, these two theories are also shown to be bi-interpretable with parameters. Finally, assuming the existence of a κ+-supercompact cardinal κ in KMU, we construct a model of KMU + Second-Order Reflection Principle (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  22. Reinterpreting the Universe-Multiverse Debate in Light of Inter-Model Inconsistency in Set Theory.Daniel Kuby - manuscript
    In this paper I apply the concept of _inter-Model Inconsistency in Set Theory_ (MIST), introduced by Carolin Antos (this volume), to select positions in the current universe-multiverse debate in philosophy of set theory: I reinterpret H. Woodin’s _Ultimate L_, J. D. Hamkins’ multiverse, S.-D. Friedman’s hyperuniverse and the algebraic multiverse as normative strategies to deal with the situation of de facto inconsistency toleration in set theory as described by MIST. In particular, my aim is to situate these positions on the (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  23. Reinhardt Cardinals and Iterates of V.Farmer Schlutzenberg - 2022 - Annals of Pure and Applied Logic 173 (2):103056.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  24. The Isomorphism Relation of Theories with S-DOP in the Generalised Baire Spaces.Miguel Moreno - 2022 - Annals of Pure and Applied Logic 173 (2):103044.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  25. Canonical Fragments of the Strong Reflection Principle.Gunter Fuchs - 2021 - Journal of Mathematical Logic 21 (3):2150023.
    For an arbitrary forcing class Γ, the Γ-fragment of Todorčević’s strong reflection principle SRPis isolated in such a way that the forcing axiom for Γ implies the Γ-fragment of SRP, the sta...
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  26. Controlling Cardinal Characteristics Without Adding Reals.Martin Goldstern, Jakob Kellner, Diego A. Mejía & Saharon Shelah - 2020 - Journal of Mathematical Logic 21 (3).
    We investigate the behavior of cardinal characteristics of the reals under extensions that do not add new <κ-sequences. As an application, we show that consistently the followi...
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  27. An Unpublished Theorem of Solovay on OD Partitions of Reals Into Two Non-OD Parts, Revisited.Ali Enayat & Vladimir Kanovei - 2020 - Journal of Mathematical Logic 21 (3):2150014.
    A definable pair of disjoint non-OD sets of reals exists in the Sacks and ????0-large generic extensions of the constructible universe L. More specifically, if a∈2ω is eith...
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  28. The Weakness of the Pigeonhole Principle Under Hyperarithmetical Reductions.Benoit Monin & Ludovic Patey - 2020 - Journal of Mathematical Logic 21 (3):2150013.
    The infinite pigeonhole principle for 2-partitions asserts the existence, for every set A, of an infinite subset of A or of its complement. In this paper, we study the infinite pigeonhole pr...
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  29. Logic of Convex Order.Chenwei Shi & Yang Sun - 2021 - Studia Logica 109 (5):1019-1047.
    Based on a pre-order on a set, we axiomatize the Egli-Milner order on the power set and show how it is related to the Lewis order. Moreover, we consider a strict version of the Egli-Milner order and show how it can be related to the semantics of conditionals based on a priority structure.
    Remove from this list   Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  30. Higher Dimensional Cardinal Characteristics for Sets of Functions.Corey Bacal Switzer - 2022 - Annals of Pure and Applied Logic 173 (1):103031.
  31. Against ‘Interpretation’: Quantum Mechanics Beyond Syntax and Semantics.Raoni Wohnrath Arroyo & Gilson Olegario da Silva - forthcoming - Axiomathes:1-37.
    The question “what is an interpretation?” is often intertwined with the perhaps even harder question “what is a scientific theory?”. Given this proximity, we try to clarify the first question to acquire some ground for the latter. The quarrel between the syntactic and semantic conceptions of scientific theories occupied a large part of the scenario of the philosophy of science in the 20th century. For many authors, one of the two currents needed to be victorious. We endorse that such debate, (...)
    Remove from this list   Direct download (6 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  32. A Philosophical Argument for the Beginning of Time.Laureano Luna & Jacobus Erasmus - 2020 - Prolegomena 19 (2):161-176.
    A common argument in support of a beginning of the universe used by advocates of the kalām cosmological argument (KCA) is the argument against the possibility of an actual infinite, or the “Infinity Argument”. However, it turns out that the Infinity Argument loses some of its force when compared with the achievements of set theory and it brings into question the view that God predetermined an endless future. We therefore defend a new formal argument, based on the nature of time (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  33. Elusive Propositions.Gabriel Uzquiano - 2021 - Journal of Philosophical Logic 50 (4):705-725.
    David Kaplan observed in Kaplan that the principle \\) cannot be verified at a world in a standard possible worlds model for a quantified bimodal propositional language. This raises a puzzle for certain interpretations of the operator Q: it seems that some proposition p is such that is not possible to query p, and p alone. On the other hand, Arthur Prior had observed in Prior that on pain of contradiction, ∀p is Q only if one true proposition is Q (...)
    Remove from this list   Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark   1 citation  
  34. Thicket Density.Siddharth Bhaskar - 2021 - Journal of Symbolic Logic 86 (1):110-127.
    We define a new type of “shatter function” for set systems that satisfies a Sauer–Shelah type dichotomy, but whose polynomial-growth case is governed by Shelah’s two-rank instead of VC dimension. We identify the least exponent bounding the rate of growth of the shatter function, the quantity analogous to VC density, with Shelah’s $\omega $ -rank.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  35. Separating Diagonal Stationary Reflection Principles.Gunter Fuchs & Chris Lambie-Hanson - 2021 - Journal of Symbolic Logic 86 (1):262-292.
    We introduce three families of diagonal reflection principles for matrices of stationary sets of ordinals. We analyze both their relationships among themselves and their relationships with other known principles of simultaneous stationary reflection, the strong reflection principle, and the existence of square sequences.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  36. Recurrence and the Existence of Invariant Measures.Manuel J. Inselmann & Benjamin D. Miller - 2021 - Journal of Symbolic Logic 86 (1):60-76.
    We show that recurrence conditions do not yield invariant Borel probability measures in the descriptive set-theoretic milieu, in the strong sense that if a Borel action of a locally compact Polish group on a standard Borel space satisfies such a condition but does not have an orbit supporting an invariant Borel probability measure, then there is an invariant Borel set on which the action satisfies the condition but does not have an invariant Borel probability measure.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  37. The Open and Clopen Ramsey Theorems in the Weihrauch Lattice.Alberto Marcone & Manlio Valenti - 2021 - Journal of Symbolic Logic 86 (1):316-351.
    We investigate the uniform computational content of the open and clopen Ramsey theorems in the Weihrauch lattice. While they are known to be equivalent to $\mathrm {ATR_0}$ from the point of view of reverse mathematics, there is not a canonical way to phrase them as multivalued functions. We identify eight different multivalued functions and study their degree from the point of view of Weihrauch, strong Weihrauch, and arithmetic Weihrauch reducibility. In particular one of our functions turns out to be strictly (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  38. Modal Objectivity1.Clarke-Doane Justin - 2019 - Noûs:266-295.
    It is widely agreed that the intelligibility of modal metaphysics has been vindicated. Quine's arguments to the contrary supposedly confused analyticity with metaphysical necessity, and rigid with non-rigid designators.2 But even if modal metaphysics is intelligible, it could be misconceived. It could be that metaphysical necessity is not absolute necessity – the strictest real notion of necessity – and that no proposition of traditional metaphysical interest is necessary in every real sense. If there were nothing otherwise “uniquely metaphysically significant” about (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark   19 citations  
  39. A Characterization of Σ11-Reflecting Ordinals.J. P. Aguilera - 2021 - Annals of Pure and Applied Logic 172 (10):103009.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  40. A Descriptive Main Gap Theorem.Francesco Mangraviti & Luca Motto Ros - 2020 - Journal of Mathematical Logic 21 (1).
    Answering one of the main questions of [S.-D. Friedman, T. Hyttinen and V. Kulikov, Generalized descriptive set theory and classification theory, Mem. Amer. Math. Soc. 230 80, Chap. 7]...
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  41. On Negation for Non-classical Set Theories.S. Jockwich Martinez & G. Venturi - 2021 - Journal of Philosophical Logic 50 (3):549-570.
    We present a case study for the debate between the American and the Australian plans, analyzing a crucial aspect of negation: expressivity within a theory. We discuss the case of non-classical set theories, presenting three different negations and testing their expressivity within algebra-valued structures for ZF-like set theories. We end by proposing a minimal definitional account of negation, inspired by the algebraic framework discussed.
    Remove from this list   Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark   2 citations  
  42. Criteria for Exact Saturation and Singular Compactness.Itay Kaplan, Nicholas Ramsey & Saharon Shelah - 2021 - Annals of Pure and Applied Logic 172 (9):102992.
    We introduce the class of unshreddable theories, which contains the simple and NIP theories, and prove that such theories have exactly saturated models in singular cardinals, satisfying certain set-theoretic hypotheses. We also give criteria for a theory to have singular compactness.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  43. Interview With a Set Theorist.Deborah Kant & Mirna Džamonja - 2019 - In Stefania Centrone, Deborah Kant & Deniz Sarikaya (eds.), Reflections on the Foundations of Mathematics: Univalent Foundations, Set Theory and General Thoughts. Springer Verlag. pp. 3-26.
    The status of independent statements is the main problem in the philosophy of set theory. We address this problem by presenting the perspective of a practising set theorist. We thus give an authentic insight in the current state of thinking in set-theoretic practice, which is to a large extent determined by independence results. During several meetings, the second author asked the first author about the development of forcing, the use of new axioms and set-theoretic intuition on independence. Parts of these (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  44. Banach-Stone-Like Results for Combinatorial Banach Spaces.C. Brech & C. Piña - 2021 - Annals of Pure and Applied Logic 172 (8):102989.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  45. Ontology, Set Theory, and the Paraphrase Challenge.Jared Warren - 2021 - Journal of Philosophical Logic 50 (6):1231-1248.
    In many ontological debates there is a familiar challenge. Consider a debate over X s. The “small” or anti-X side tries to show that they can paraphrase the pro-X or “big” side’s claims without any loss of expressive power. Typically though, when the big side adds whatever resources the small side used in their paraphrase, the symmetry breaks down. The big side plus small’s resources is a more expressively powerful and thus more theoretically fruitful theory. In this paper, I show (...)
    Remove from this list   Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  46. Filling Cages. Reverse Mathematics and Combinatorial Principles.Marta Fiori Carones - 2020 - Bulletin of Symbolic Logic 26 (3-4):300-300.
    In the thesis some combinatorial statements are analysed from the reverse mathematics point of view. Reverse mathematics is a research program, which dates back to the Seventies, interested in finding the exact strength, measured in terms of set-existence axioms, of theorems from ordinary non set-theoretic mathematics. After a brief introduction to the subject, an on-line (incremental) algorithm to transitively reorient infinite pseudo-transitive oriented graphs is defined. This implies that a theorem of Ghouila-Houri is provable in RCA_0 and hence is computably (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  47. An Exposition of the Compactness Of.Enrique Casanovas & Martin Ziegler - 2020 - Bulletin of Symbolic Logic 26 (3-4):212-218.
    We give an exposition of the compactness of L(QcfC), for any set C of regular cardinals.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  48. Ontology and Arbitrariness.David Builes - forthcoming - Australasian Journal of Philosophy.
    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 (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  49. Around Rubin’s “Theories of Linear Order”.Predrag Tanović, Slavko Moconja & Dejan Ilić - 2020 - Journal of Symbolic Logic 85 (4):1403-1426.
    Let $\mathcal M=$ be a linearly ordered first-order structure and T its complete theory. We investigate conditions for T that could guarantee that $\mathcal M$ is not much more complex than some colored orders. Motivated by Rubin’s work [5], we label three conditions expressing properties of types of T and/or automorphisms of models of T. We prove several results which indicate the “geometric” simplicity of definable sets in models of theories satisfying these conditions. For example, we prove that the strongest (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  50. A General Framework for a Second Philosophy Analysis of Set-Theoretic Methodology.Carolin Antos & Deborah Kant - manuscript
    Penelope Maddy’s Second Philosophy is one of the most well-known ap- proaches in recent philosophy of mathematics. She applies her second-philosophical method to analyze mathematical methodology by reconstructing historical cases in a setting of means-ends relations. However, outside of Maddy’s own work, this kind of methodological analysis has not yet been extensively used and analyzed. In the present work, we will make a first step in this direction. We develop a general framework that allows us to clarify the procedure and (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
1 — 50 / 2275