Skip to main content

Urelements and extendability

Contributed Papers

  • 346 Accesses

Part of the Lecture Notes in Mathematics book series (LNM,volume 537)

Keywords

  • Countable Model
  • Peano Arithmetic
  • Transitive Model
  • Elementary Extension
  • Nonstandard Model

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.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   44.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   59.95
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K. R. Apt, W. Marek, Second order arithmetic and related topics. Ann of Math. Logic 6 (1974), pp. 177–229.

    CrossRef  MathSciNet  MATH  Google Scholar 

  2. M. Artique, E. Isambert, M. Perrin, A. Zalc, Some remarks on bicommutability, to appear in Fund. Math.

    Google Scholar 

  3. K. J. Barwise, Admissible sets over models of set theory, in Generalized Recursion Theory, North-Holland, 1974, pp. 97–122.

    Google Scholar 

  4. K. J. Barwise, Admissible sets and structures, Springer Verlag, to appear.

    Google Scholar 

  5. K. J. Barwise and J. Schlipf, On recursively saturated models of arithmetic, In Springer L. N. 448.

    Google Scholar 

  6. A. Ehrenfeucht, G. Kreisel, Strong models of arithmetic, Bull. Acad. Pol. Sci., Ser. Sci. Math. Phys. Astron., XV (1966), pp. 107–110.

    MathSciNet  MATH  Google Scholar 

  7. G. Kreisel, Survey of proof theory. J. of Symb. Logic 33 (1968).

    Google Scholar 

  8. J. L. Krivine, K. Mc Allon, Some true unprovable formulas of set theory, The Proceedings of the Bertrand Russel Memorial Logic Conference, pp. 332–341.

    Google Scholar 

  9. W. Marek, ω-models of second order arithmetic and admissible sets, to appear in Fund. Math.

    Google Scholar 

  10. W. Marek, On the metamathematics of impredicative theory of classes, Diss. Math. XCVIII.

    Google Scholar 

  11. W. Marek, A. Mostowski, On extendability of models of ZF set theory to models of KM theory of classes. In Springer L.N. 449.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1976 Springer-Verlag

About this paper

Cite this paper

Marek, W., Srebrny, M. (1976). Urelements and extendability. In: Marek, W., Srebrny, M., Zarach, A. (eds) Set Theory and Hierarchy Theory A Memorial Tribute to Andrzej Mostowski. Lecture Notes in Mathematics, vol 537. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0096902

Download citation

  • DOI: https://doi.org/10.1007/BFb0096902

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07856-2

  • Online ISBN: 978-3-540-38122-8

  • eBook Packages: Springer Book Archive