Skip to main content

On the rules of proof generated by hierarchies

Contributed Papers

  • 392 Accesses

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

Keywords

  • Order Theory
  • Order Language
  • Diagonal Procedure
  • Satisfaction Formula
  • Powerset Operation

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   34.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   46.00
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: Semantics of the infinitistic rules of proof, J.S.L. 41 (1976), pp. 121–138.

    MathSciNet  MATH  Google Scholar 

  2. K.J. Barwise: The Hanf number of second order logic, J.S.L. 37 (1972), pp. 588–595.

    MathSciNet  MATH  Google Scholar 

  3. G. Boolos: On the semantics of the constructive levels ZML ∪ GM 16(1970), pp.139–148.

    MathSciNet  MATH  Google Scholar 

  4. P.J. Cohen: Set theory and continuum hypothesis, W.A. Benjamin, New York 1966.

    MATH  Google Scholar 

  5. R.B. Jensen: Fine structure of constructible universe, A.M.L. 4 (1972), pp. 229–308.

    MATH  Google Scholar 

  6. W. Marek: On definable elements in models of set theory, to appear.

    Google Scholar 

  7. W. Marek, M. Srebrny: Gaps in constructible universe, AML 6 (1974), pp. 359–394.

    MathSciNet  MATH  Google Scholar 

  8. M. Takahashi: \(\tilde \Delta _1 \)— definability in set theory, in: Proceedings of London Conference 1970, S.L.N. 255.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1977 Springer-Verlag

About this paper

Cite this paper

Krawczyk, A., Marek, W. (1977). On the rules of proof generated by hierarchies. In: Lachlan, A., Srebrny, M., Zarach, A. (eds) Set Theory and Hierarchy Theory V. Lecture Notes in Mathematics, vol 619. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0067654

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08521-8

  • Online ISBN: 978-3-540-37032-1

  • eBook Packages: Springer Book Archive