Advertisement

Israel Journal of Mathematics

, Volume 63, Issue 2, pp 243–256 | Cite as

Playing with admissibility spectra

  • Robert S. Lubarsky
Article
  • 41 Downloads

Abstract

Jensen showed that any countable sequenceA ofA-admissibles is the initial part of the admissibility spectrum of a realR. His construction generalizes straightforwardly to Σ n -admissibles. This adaptation makes admissibles not inA R-inadmissible. We strengthen Jensen’s theorem by requiring that Σ n (A)-admissibles not inA be Σ m (R)-admissible or Σ m (R)-non-projectible, form <n.

Keywords

Extension Property Closure Property Countable Sequence Large Cardinal Skolem Function 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [B]
    John Barwise,Admissible Sets and Structures, Springer-Verlag, Berlin, Heidelberg, New York, 1975.MATHGoogle Scholar
  2. [D]
    Keith Devlin,Aspects of Constructibility, Lecture Notes in Mathematics # 354, Springer-Verlag, Berlin, Heidelberg, New York, 1973.MATHGoogle Scholar
  3. [F1]
    Sy Friedman,Uncountable admissibles I: Forcing, Trans. Am. Math. Soc.270 (1982), 61–73.MATHCrossRefGoogle Scholar
  4. [F2]
    Sy Friedman,Uncountable admissibles II: Compactness, Isr. J. Math.40 (1981), 129–149.MATHGoogle Scholar
  5. [J]
    Ronald Jensen,Forcing over admissible sets, with a theorem on countable sequences of admissibles, handwritten notes by K. Devlin, 1972.Google Scholar
  6. [JS]
    Ronald Jensen and Robert Solovay,Some applications of almost disjoint sets, inMathematical Logic and Foundations of Set Theory (Bar-Hillel, ed.), North-Holland, Amsterdam-London, 1970, pp. 84–104.Google Scholar
  7. [L]
    Bob Lubarsky,Admissibility spectra and minimality, Ann. Pure Appl. Logic, to appear.Google Scholar
  8. [MS]
    Wiktor Marek and Marian Srebrny,Gaps in the constructible universe, Ann. Math. Logic6 (1974), 359–394.MATHCrossRefMathSciNetGoogle Scholar
  9. [Sa]
    Gerald Sacks,Countable admissible ordinals and hyperdegrees, Advances in Math.20 (1976), 213–262.MATHCrossRefMathSciNetGoogle Scholar
  10. [St]
    John Steel,Forcing with tagged trees, Ann. Math. Logic15 (1978), 55–74.MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© The Weizmann Science Press of Israel 1988

Authors and Affiliations

  • Robert S. Lubarsky
    • 1
  1. 1.Department of MathematicsCornell UniversityIthacaUSA

Personalised recommendations