Switch to: References

Add citations

You must login to add citations.
  1. Madness in vector spaces.Iian B. Smythe - 2019 - Journal of Symbolic Logic 84 (4):1590-1611.
    We consider maximal almost disjoint families of block subspaces of countable vector spaces, focusing on questions of their size and definability. We prove that the minimum infinite cardinality of such a family cannot be decided in ZFC and that the “spectrum” of cardinalities of mad families of subspaces can be made arbitrarily large, in analogy to results for mad families on ω. We apply the author’s local Ramsey theory for vector spaces [32] to give partial results concerning their definability.
    Download  
     
    Export citation  
     
    Bookmark  
  • Maximality Principles in Set Theory.Luca Incurvati - 2017 - Philosophia Mathematica 25 (2):159-193.
    In set theory, a maximality principle is a principle that asserts some maximality property of the universe of sets or some part thereof. Set theorists have formulated a variety of maximality principles in order to settle statements left undecided by current standard set theory. In addition, philosophers of mathematics have explored maximality principles whilst attempting to prove categoricity theorems for set theory or providing criteria for selecting foundational theories. This article reviews recent work concerned with the formulation, investigation and justification (...)
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Levy and set theory.Akihiro Kanamori - 2006 - Annals of Pure and Applied Logic 140 (1):233-252.
    Azriel Levy did fundamental work in set theory when it was transmuting into a modern, sophisticated field of mathematics, a formative period of over a decade straddling Cohen’s 1963 founding of forcing. The terms “Levy collapse”, “Levy hierarchy”, and “Levy absoluteness” will live on in set theory, and his technique of relative constructibility and connections established between forcing and definability will continue to be basic to the subject. What follows is a detailed account and analysis of Levy’s work and contributions (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • A non-implication between fragments of Martin’s Axiom related to a property which comes from Aronszajn trees.Teruyuki Yorioka - 2010 - Annals of Pure and Applied Logic 161 (4):469-487.
    We introduce a property of forcing notions, called the anti-, which comes from Aronszajn trees. This property canonically defines a new chain condition stronger than the countable chain condition, which is called the property . In this paper, we investigate the property . For example, we show that a forcing notion with the property does not add random reals. We prove that it is consistent that every forcing notion with the property has precaliber 1 and for forcing notions with the (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Distributive proper forcing axiom and cardinal invariants.Huiling Zhu - 2013 - Archive for Mathematical Logic 52 (5-6):497-506.
    In this paper, we study the forcing axiom for the class of proper forcing notions which do not add ω sequence of ordinals. We study the relationship between this forcing axiom and many cardinal invariants. We use typical iterated forcing with large cardinals and analyse certain property being preserved in this process. Lastly, we apply the results to distinguish several forcing axioms.
    Download  
     
    Export citation  
     
    Bookmark  
  • Partitions and filters.P. Matet - 1986 - Journal of Symbolic Logic 51 (1):12-21.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • A renaissance of empiricism in the recent philosophy of mathematics.Imre Lakatos - 1976 - British Journal for the Philosophy of Science 27 (3):201-223.
    Download  
     
    Export citation  
     
    Bookmark   44 citations  
  • Souslin forcing.Jaime I. Ihoda & Saharon Shelah - 1988 - Journal of Symbolic Logic 53 (4):1188-1207.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • (1 other version)A basis theorem for perfect sets.Marcia J. Groszek & Theodore A. Slaman - 1998 - Bulletin of Symbolic Logic 4 (2):204-209.
    We show that if there is a nonconstructible real, then every perfect set has a nonconstructible element, answering a question of K. Prikry. This is a specific instance of a more general theorem giving a sufficient condition on a pair $M\subset N$ of models of set theory implying that every perfect set in N has an element in N which is not in M.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Axioms of symmetry: Throwing darts at the real number line.Chris Freiling - 1986 - Journal of Symbolic Logic 51 (1):190-200.
    We will give a simple philosophical "proof" of the negation of Cantor's continuum hypothesis (CH). (A formal proof for or against CH from the axioms of ZFC is impossible; see Cohen [1].) We will assume the axioms of ZFC together with intuitively clear axioms which are based on some intuition of Stuart Davidson and an old theorem of Sierpinski and are justified by the symmetry in a thought experiment throwing darts at the real number line. We will in fact show (...)
    Download  
     
    Export citation  
     
    Bookmark   27 citations  
  • On the Hanf number of souslin logic.John P. Burgess - 1978 - Journal of Symbolic Logic 43 (3):568-571.
    We show it is consistent with ZFC that the Hanf number of Ellentuck's Souslin logic should be exactly $\beth_{\omega_2}$.
    Download  
     
    Export citation  
     
    Bookmark  
  • Uniformization principles.Alan H. Mekler & Saharon Shelah - 1989 - Journal of Symbolic Logic 54 (2):441-459.
    It is consistent that for many cardinals λ there is a family of at least λ + unbounded subsets of λ which have uniformization properties. In particular if it is consistent that a supercompact cardinal exists, then it is consistent that ℵ ω has such a family. We have applications to point set topology, Whitehead groups and reconstructing separable abelian p-groups from their socles.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • The Kunen-Miller chart (lebesgue measure, the baire property, Laver reals and preservation theorems for forcing).Haim Judah & Saharon Shelah - 1990 - Journal of Symbolic Logic 55 (3):909-927.
    In this work we give a complete answer as to the possible implications between some natural properties of Lebesgue measure and the Baire property. For this we prove general preservation theorems for forcing notions. Thus we answer a decade-old problem of J. Baumgartner and answer the last three open questions of the Kunen-Miller chart about measure and category. Explicitly, in \S1: (i) We prove that if we add a Laver real, then the old reals have outer measure one. (ii) We (...)
    Download  
     
    Export citation  
     
    Bookmark   19 citations  
  • Summable gaps.James Hirschorn - 2003 - Annals of Pure and Applied Logic 120 (1-3):1-63.
    It is proved, under Martin's Axiom, that all gaps in are indestructible in any forcing extension by a separable measure algebra. This naturally leads to a new type of gap, a summable gap. The results of these investigations have applications in Descriptive Set Theory. For example, it is shown that under Martin's Axiom the Baire categoricity of all Δ31 non-Δ31-complete sets of reals requires a weakly compact cardinal.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • (1 other version)Δ12-sets of reals.Jaime I. Ihoda & Saharon Shelah - 1989 - Annals of Pure and Applied Logic 42 (3):207-223.
    Download  
     
    Export citation  
     
    Bookmark   32 citations  
  • Martin’s conjecture and strong ergodicity.Simon Thomas - 2009 - Archive for Mathematical Logic 48 (8):749-759.
    In this paper, we explore some of the consequences of Martin’s Conjecture on degree invariant Borel maps. These include the strongest conceivable ergodicity result for the Turing equivalence relation with respect to the filter on the degrees generated by the cones, as well as the statement that the complexity of a weakly universal countable Borel equivalence relation always concentrates on a null set.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • (2 other versions)1\ sets of reals.J. Bagaria & W. H. Woodin - 1997 - Journal of Symbolic Logic 62 (4):1379-1428.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Measurable chromatic numbers.Benjamin D. Miller - 2008 - Journal of Symbolic Logic 73 (4):1139-1157.
    We show that if add(null) = c, then the globally Baire and universally measurable chromatic numbers of the graph of any Borel function on a Polish space are equal and at most three. In particular, this holds for the graph of the unilateral shift on [N]N, although its Borel chromatic number is N₀. We also show that if add(null) = c, then the universally measurable chromatic number of every treeing of a measure amenable equivalence relation is at most three. In (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • The equivalence of a generalized Martin's axiom to a combinatorial principle.William Weiss - 1981 - Journal of Symbolic Logic 46 (4):817-821.
    A generalized version of Martin's axiom, called BACH, is shown to be equivalent to one of its combinatorial consequences, a generalization of P(c).
    Download  
     
    Export citation  
     
    Bookmark  
  • The baire category theorem and cardinals of countable cofinality.Arnold W. Miller - 1982 - Journal of Symbolic Logic 47 (2):275-288.
    Let κ B be the least cardinal for which the Baire category theorem fails for the real line R. Thus κ B is the least κ such that the real line can be covered by κ many nowhere dense sets. It is shown that κ B cannot have countable cofinality. On the other hand it is consistent that the corresponding cardinal for 2 ω 1 be ℵ ω . Similar questions are considered for the ideal of measure zero sets, other (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Models as Fundamental Entities in Set Theory: A Naturalistic and Practice-based Approach.Carolin Antos - 2022 - Erkenntnis 89 (4):1683-1710.
    This article addresses the question of fundamental entities in set theory. It takes up J. Hamkins’ claim that models of set theory are such fundamental entities and investigates it using the methodology of P. Maddy’s naturalism, Second Philosophy. In accordance with this methodology, I investigate the historical case study of the use of models in the introduction of forcing, compare this case to contemporary practice and give a systematic account of how set-theoretic practice can be said to introduce models as (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Second order arithmetic and related topics.K. R. Apt & W. Marek - 1974 - Annals of Mathematical Logic 6 (3):177.
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • Happy families.A. R. D. Mathias - 1977 - Annals of Mathematical Logic 12 (1):59.
    Download  
     
    Export citation  
     
    Bookmark   95 citations  
  • On the decomposition of sets of reals to borel sets.A. Levy & R. M. Solovay - 1972 - Annals of Mathematical Logic 5 (1):1-19.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • (1 other version)Fragments of Martin's axiom and δ13 sets of reals.Joan Bagaria - 1994 - Annals of Pure and Applied Logic 69 (1):1-25.
    We strengthen a result of Harrington and Shelah by showing that, unless ω1 is an inaccessible cardinal in L, a relatively weak fragment of Martin's axiom implies that there exists a δ13 set of reals without the property of Baire.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Maximal Chains in the Turing Degrees.C. T. Chong & Liang Yu - 2007 - Journal of Symbolic Logic 72 (4):1219 - 1227.
    We study the problem of existence of maximal chains in the Turing degrees. We show that: 1. ZF+DC+"There exists no maximal chain in the Turing degrees" is equiconsistent with ZFC+"There exists an inaccessible cardinal"; 2. For all a ∈ 2ω.(ω₁)L[a] = ω₁ if and only if there exists a $\Pi _{1}^{1}[a]$ maximal chain in the Turing degrees. As a corollary, ZFC + "There exists an inaccessible cardinal" is equiconsistent with ZFC + "There is no (bold face) $\utilde{\Pi}{}_{1}^{1}$ maximal chain of (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Believing the axioms. I.Penelope Maddy - 1988 - Journal of Symbolic Logic 53 (2):481-511.
    Download  
     
    Export citation  
     
    Bookmark   72 citations  
  • Martin's axioms, measurability and equiconsistency results.Jaime I. Ihoda & Saharon Shelah - 1989 - Journal of Symbolic Logic 54 (1):78-94.
    We deal with the consistency strength of ZFC + variants of MA + suitable sets of reals are measurable (and/or Baire, and/or Ramsey). We improve the theorem of Harrington and Shelah [2] repairing the asymmetry between measure and category, obtaining also the same result for Ramsey. We then prove parallel theorems with weaker versions of Martin's axiom (MA(σ-centered), (MA(σ-linked)), MA(Γ + ℵ 0 ), MA(K)), getting Mahlo, inaccessible and weakly compact cardinals respectively. We prove that if there exists r ∈ (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Some filters of partitions.Pierre Matet - 1988 - Journal of Symbolic Logic 53 (2):540-553.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Borel sets and Ramsey's theorem.Fred Galvin & Karel Prikry - 1973 - Journal of Symbolic Logic 38 (2):193-198.
    Download  
     
    Export citation  
     
    Bookmark   27 citations  
  • One hundred and two problems in mathematical logic.Harvey Friedman - 1975 - Journal of Symbolic Logic 40 (2):113-129.
    Download  
     
    Export citation  
     
    Bookmark   63 citations  
  • Ladder Gaps over Stationary Sets.Uri Abraham & Saharon Shelah - 2004 - Journal of Symbolic Logic 69 (2):518 - 532.
    For a stationary set $S \subseteq \omega_{1}$ and a ladder system C over S, a new type of gaps called C-Hausdorff is introduced and investigated. We describe a forcing model of ZFC in which, for some stationary set S, for every ladder C over S, every gap contains a subgap that is C-Hausdorff. But for every ladder E over \omega_{1} \ S$ there exists a gap with no subgap that is E-Hausdorff. A new type of chain condition, called polarized chain (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Stationary sets and infinitary logic.Saharon Shelah & Jouko Vaananen - 2000 - Journal of Symbolic Logic 65 (3):1311-1320.
    Let K 0 λ be the class of structures $\langle\lambda, , where $A \subseteq \lambda$ is disjoint from a club, and let K 1 λ be the class of structures $\langle\lambda, , where $A \subseteq \lambda$ contains a club. We prove that if $\lambda = \lambda^{ is regular, then no sentence of L λ+κ separates K 0 λ and K 1 λ . On the other hand, we prove that if $\lambda = \mu^+,\mu = \mu^{ , and a forcing axiom (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • On ideals of subsets of the plane and on Cohen reals.Jacek Cichoń & Janusz Pawlikowski - 1986 - Journal of Symbolic Logic 51 (3):560-569.
    Let J be any proper ideal of subsets of the real line R which contains all finite subsets of R. We define an ideal J * ∣B as follows: X ∈ J * ∣B if there exists a Borel set $B \subset R \times R$ such that $X \subset B$ and for any x ∈ R we have $\{y \in R: \langle x,y\rangle \in B\} \in \mathscr{J}$ . We show that there exists a family $\mathscr{A} \subset \mathscr{J}^\ast\mid\mathscr{B}$ of power ω (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Complexity of reals in inner models of set theory.Boban Velickovic & Hugh Woodin - 1998 - Annals of Pure and Applied Logic 92 (3):283-295.
    We consider the possible complexity of the set of reals belonging to an inner model M of set theory. We show that if this set is analytic then either 1M is countable or else all reals are in M. We also show that if an inner model contains a superperfect set of reals as a subset then it contains all reals. On the other hand, it is possible to have an inner model M whose reals are an uncountable Fσ set (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Exact equiconsistency results for Δ 3 1 -sets of reals.Haim Judah - 1992 - Archive for Mathematical Logic 32 (2):101-112.
    We improve a theorem of Raisonnier by showing that Cons(ZFC+every Σ 2 1 -set of reals in Lebesgue measurable+every Π 2 1 -set of reals isK σ-regular) implies Cons(ZFC+there exists an inaccessible cardinal). We construct, fromL, a model where every Δ 3 1 -sets of reals is Lebesgue measurable, has the property of Baire, and every Σ 2 1 -set of reals isK σ-regular. We prove that if there exists a Σ n+1 1 unbounded filter on ω, then there exists (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Inner models from extended logics: Part 1.Juliette Kennedy, Menachem Magidor & Jouko Väänänen - 2020 - Journal of Mathematical Logic 21 (2):2150012.
    If we replace first-order logic by second-order logic in the original definition of Gödel’s inner model L, we obtain the inner model of hereditarily ordinal definable sets [33]. In this paper...
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • DELTA ¹2-sets of reals.J. I. Ihoda - 1989 - Annals of Pure and Applied Logic 42 (3):207.
    Download  
     
    Export citation  
     
    Bookmark   31 citations  
  • Iterations of Boolean algebras with measure.Anastasis Kamburelis - 1989 - Archive for Mathematical Logic 29 (1):21-28.
    We consider a classM of Boolean algebras with strictly positive, finitely additive measures. It is shown thatM is closed under iterations with finite support and that the forcing via such an algebra does not destroy the Lebesgue measure structure from the ground model. Also, we deduce a simple characterization of Martin's Axiom reduced to the classM.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Almost disjoint sets and Martin's axiom.Michael L. Wage - 1979 - Journal of Symbolic Logic 44 (3):313-318.
    We present a number of results involving almost disjoint sets and Martin's axiom. Included is an example, due to K. Kunen, of a c.c.c. partial order without property K whose product with every c.c.c. partial order is c.c.c.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Martin's axiom in the model theory of LA.W. Richard Stark - 1980 - Journal of Symbolic Logic 45 (1):172 - 176.
    Download  
     
    Export citation  
     
    Bookmark  
  • Degrees of functionals.Dag Normann - 1979 - Annals of Mathematical Logic 16 (3):269.
    Download  
     
    Export citation  
     
    Bookmark  
  • Long projective wellorderings.Leo Harrington - 1977 - Annals of Mathematical Logic 12 (1):1.
    Download  
     
    Export citation  
     
    Bookmark   30 citations  
  • Definable MAD families and forcing axioms.Vera Fischer, David Schrittesser & Thilo Weinert - 2021 - Annals of Pure and Applied Logic 172 (5):102909.
    Download  
     
    Export citation  
     
    Bookmark  
  • Weak distributivity implying distributivity.Dan Hathaway - 2016 - Journal of Symbolic Logic 81 (2):711-717.
    Download  
     
    Export citation  
     
    Bookmark  
  • The relative strengths of fragments of Martin's axiom.Joan Bagaria - 2024 - Annals of Pure and Applied Logic 175 (1):103330.
    Download  
     
    Export citation  
     
    Bookmark  
  • Extensions of Kripke's embedding theorem.Jonathan Stavi - 1975 - Annals of Mathematical Logic 8 (4):345.
    Download  
     
    Export citation  
     
    Bookmark  
  • Baumgartnerʼs conjecture and bounded forcing axioms.David Asperó, Sy-David Friedman, Miguel Angel Mota & Marcin Sabok - 2013 - Annals of Pure and Applied Logic 164 (12):1178-1186.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • An absoluteness principle for borel sets.Greg Hjorth - 1998 - Journal of Symbolic Logic 63 (2):663-693.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Equivalence relations which are borel somewhere.William Chan - 2017 - Journal of Symbolic Logic 82 (3):893-930.
    The following will be shown: Let I be a σ-ideal on a Polish space X so that the associated forcing of I+${\bf{\Delta }}_1^1$ sets ordered by ⊆ is a proper forcing. Let E be a ${\bf{\Sigma }}_1^1$ or a ${\bf{\Pi }}_1^1$ equivalence relation on X with all equivalence classes ${\bf{\Delta }}_1^1$. If for all $z \in {H_{{{\left}^ + }}}$, z♯ exists, then there exists an I+${\bf{\Delta }}_1^1$ set C ⊆ X such that E ↾ C is a ${\bf{\Delta }}_1^1$ equivalence (...)
    Download  
     
    Export citation  
     
    Bookmark