Switch to: Citations

Add references

You must login to add references.
  1. Powers of regular cardinals.William B. Easton - 1970 - Annals of Mathematical Logic 1 (2):139.
    Download  
     
    Export citation  
     
    Bookmark   73 citations  
  • Discernible elements in models for peano arithmetic.Andrzej Ehrenfeucht - 1973 - Journal of Symbolic Logic 38 (2):291-292.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Algebraicity and Implicit Definability in Set Theory.Joel David Hamkins & Cole Leahy - 2016 - Notre Dame Journal of Formal Logic 57 (3):431-439.
    We analyze the effect of replacing several natural uses of definability in set theory by the weaker model-theoretic notion of algebraicity. We find, for example, that the class of hereditarily ordinal algebraic sets is the same as the class of hereditarily ordinal definable sets; that is, $\mathrm{HOA}=\mathrm{HOD}$. Moreover, we show that every algebraic model of $\mathrm{ZF}$ is actually pointwise definable. Finally, we consider the implicitly constructible universe Imp—an algebraic analogue of the constructible universe—which is obtained by iteratively adding not only (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Pointwise definable models of set theory.Joel David Hamkins, David Linetsky & Jonas Reitz - 2013 - Journal of Symbolic Logic 78 (1):139-156.
    A pointwise definable model is one in which every object is \loos definable without parameters. In a model of set theory, this property strengthens $V=\HOD$, but is not first-order expressible. Nevertheless, if \ZFC\ is consistent, then there are continuum many pointwise definable models of \ZFC. If there is a transitive model of \ZFC, then there are continuum many pointwise definable transitive models of \ZFC. What is more, every countable model of \ZFC\ has a class forcing extension that is pointwise definable. (...)
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • (1 other version)Models and types of Peano's arithmetic.Haim Gaifman - 1976 - Annals of Mathematical Logic 9 (3):223-306.
    Download  
     
    Export citation  
     
    Bookmark   48 citations  
  • Leibnizian models of set theory.Ali Enayat - 2004 - Journal of Symbolic Logic 69 (3):775-789.
    A model is said to be Leibnizian if it has no pair of indiscernibles. Mycielski has shown that there is a first order axiom LM (the Leibniz-Mycielski axiom) such that for any completion T of Zermelo-Fraenkel set theory ZF, T has a Leibnizian model if and only if T proves LM. Here we prove: THEOREM A. Every complete theory T extending ZF + LM has $2^{\aleph_{0}}$ nonisomorphic countable Leibnizian models. THEOREM B. If $\kappa$ is aprescribed definable infinite cardinal of a (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations