Skip to main content

On the axiomatizability of sets in a class theory

  • 423 Accesses

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

Keywords

  • Finite Subset
  • Reflection Principle
  • Predicative Formula
  • Finite Axiomatizability
  • Cumulative Hierarchy

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   54.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   69.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

  • Chuaqui, R. [1980]. Internal and forcing models for the impedicative theory of classes, Dissertationes Mathematicae CLXXVI, Warzawa.

    Google Scholar 

  • Craig, W. [1953] On axiomatizability within a system, J.Symbolic Logic 18,pp. 30–32.

    CrossRef  MathSciNet  MATH  Google Scholar 

  • Friedman, H.[1981] On the necessary use of abstract set theory, Advances in Mathematics 41, pp. 209–280.

    CrossRef  MathSciNet  MATH  Google Scholar 

  • Krajewski, S.[1974] Predicative expansions of axiomatic theories, Z.Math.Logik, vol. 20, pp.435–452.

    CrossRef  MathSciNet  MATH  Google Scholar 

  • Keisel,G. [1971] Observations on popular discussions of foundations, Axiomatic Set Theory, ed. by Dana Scott, American Mathematical Society, pp. 189–198.

    Google Scholar 

  • Kreisel, G. and Levy, A. [1968] Reflection principles and their use for establishing the complexity of axiomatic systems, Z.Math. Logik, vol. 14, pp. 97–112.

    CrossRef  MathSciNet  MATH  Google Scholar 

  • Lindström, P [1979] Some results in interpretability, Proceedings from 5th Scandinavian Logic Symposium, Aalborg University Press, pp. 329–361.

    Google Scholar 

  • Marek, W. and Mostowski, A [1974] On extendability of models of ZF set theory to the models of KM theory of classes, Lecture Notes in Mathematics, vol. 499.

    Google Scholar 

  • Montague, R. [1960] Semantical closure and non finite axiomatizability, Infinitistic Methods, P.W.N. pp 45–69.

    Google Scholar 

  • Novak, I.L. [1950] A construction for models of consistent systems, Fundamenta Mathematicae, vol. 37, pp. 310–317.

    MathSciNet  MATH  Google Scholar 

  • Ratajczyk, Z. [1979] On sentences provable in impredicative extensions of theories, Dissertationes Mathematicae CLXXVIII, pp 1–44.

    Google Scholar 

  • Vaught, R.L. [1967] Axiomatizability by a schema, J. Symbolic Logic 32,pp. 473–479.

    CrossRef  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1985 Springer-Verlag

About this paper

Cite this paper

Manuel, C.C. (1985). On the axiomatizability of sets in a class theory. In: Di Prisco, C.A. (eds) Methods in Mathematical Logic. Lecture Notes in Mathematics, vol 1130. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0075307

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-15236-1

  • Online ISBN: 978-3-540-39414-3

  • eBook Packages: Springer Book Archive