Skip to main content
SpringerLink
Log in

Implicit definability and compactness in infinitary languages

  • Conference paper
  • First Online:
The Syntax and Semantics of Infinitary Languages

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

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.99
Price excludes VAT (USA)
  • 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Barwise, J., Infinitary Logic and Admissible Sets, to appear. See also thesis by same title, Stanford University, 1967.

    Google Scholar 

  2. Feferman, S. and G. Kreisel, Persistent and invariant formulas relative to theories of higher type, Bull. Amer. Math. Soc., 72 (1966), 480–485.

    Article  MathSciNet  MATH  Google Scholar 

  3. Friedman, H. and R. Jensen, Note on Admissible Ordinals, this volume.

    Google Scholar 

  4. Gödel, K., The consistency of the axiom of choice and of the generalized continuum hypothesis, Proc. Nat. Acad. of Sci., 24 (1938), 556–557.

    Article  MATH  Google Scholar 

  5. Hanf, W. Incompactness in languages with infinitely long expressions, Fund. Math., LIII (1964), 309–324.

    MathSciNet  MATH  Google Scholar 

  6. Jensen, R., and C. Karp, Primitive recursive set functions, to appear.

    Google Scholar 

  7. Karp, C. Nonaxiomatizing results for infinitary systems, J. Symbolic Logic, 32 (1967), 367–384.

    Article  MathSciNet  MATH  Google Scholar 

  8. Kreisel, G., Choice of infinitary languages by means of definability criteria; generalized recursion theory, this volume.

    Google Scholar 

  9. Kunen, K., Implicit definability and infinitary languages, J. Symbolic Logic, to appear.

    Google Scholar 

  10. Lévy, A., A hierarchy of formulas in set theory, Memoirs of the Amer. Math. Soc., No. 57 (1965).

    Google Scholar 

  11. Lopez-Escobar, E. G. K., An interpolation theorem for denumerably long formulas, Fund. Math., LVII (1965), 254–272.

    MathSciNet  MATH  Google Scholar 

  12. Platek, R., Foundations of recursion theory, Doctoral Dissertation and Supplement, Stanford, 1966.

    Google Scholar 

  13. Shoenfield, J. Mathematical Logic, Addison-Wesley, 1967.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of California, Los Angeles

    Jon Barwise

Authors
  1. Jon Barwise
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jon Barwise

Rights and permissions

Reprints and permissions

Copyright information

© 1968 Springer-Verlag

About this paper

Cite this paper

Barwise, J. (1968). Implicit definability and compactness in infinitary languages. In: Barwise, J. (eds) The Syntax and Semantics of Infinitary Languages. Lecture Notes in Mathematics, vol 72. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0079680

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-04242-6

  • Online ISBN: 978-3-540-35900-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation