Skip to main content
SpringerLink
Log in

Consistency properties for finite quantifier languages

  • Conference paper
  • First Online:
Infinitary Logic: In Memoriam Carol Karp

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

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. J. Barwise, Infinitary logic and admissible sets, Journal of Symbolic Logic 34(1969), 226–252.

    Article  MathSciNet  MATH  Google Scholar 

  2. J. Barwise, Applications of strict Π ll predicates to infinitary logic, Journal of Symbolic Logic 34(1969), 409–423.

    Article  MathSciNet  MATH  Google Scholar 

  3. J. Barwise and K. Kunen, Hanf numbers for fragments of L ∞ω, Israel Journal of Math. 10(1971), 306–320.

    Article  MathSciNet  MATH  Google Scholar 

  4. C.C. Chang, Two interpolation theorems, Istituto Nazionale di Alta Mathematica, Symposia Mathematica V(1970), 5–19.

    Google Scholar 

  5. C.C. Chang, Some remarks on the model theory of infinitary languages, in: The Syntax and Semantics of Infinitary Languages, Springer-Verlag, Berlin, 1968, 36–63.

    Chapter  Google Scholar 

  6. E. Cunningham, Chain Models for Infinite-Quantifier Languages, Ph.D. Thesis, University of Maryland, 1974.

    Google Scholar 

  7. E. Cunningham, Chain models: applications of consistency properties and back-and-forth techniques in infinite-quantifier languages, this volume.

    Google Scholar 

  8. H. Friedman, The Beth and Craig theorems in infinitary languages, (mimeographed).

    Google Scholar 

  9. J. Green, ∑l compactness for next admissible sets, Journal of Symbolic Logic 39(1974), 105–116.

    Article  MathSciNet  MATH  Google Scholar 

  10. J. Green, Next P admissible sets are of cofinality ω, to appear.

    Google Scholar 

  11. J. Gregory, Beth definability in infinitary languages, Journal of Symbolic Logic 39(1974), 22–26.

    Article  MathSciNet  MATH  Google Scholar 

  12. M. Helling, Hanf numbers for some generalizations of first-order languages, Notices of the American Mathematical Society 11(1964), 679.

    Google Scholar 

  13. R. Jensen and C. Karp, Primitive recursive set functions, in: Axiomatic Set Theory, part 1, American Mathematical Society, 1971, 143–176.

    Google Scholar 

  14. C. Karp, Languages with Expressions of Infinite Length, North-Holland, Amsterdam, 1964.

    MATH  Google Scholar 

  15. C. Karp, Nonaxiomatizability results for infinitary systems, Journal of Symbolic Logic 32(1967), 367–384.

    Article  MathSciNet  MATH  Google Scholar 

  16. C. Karp, An algebraic proof of the Barwise compactness theorem, in: The Syntax and Semantics of Infinitary Languages, Springer-Verlag, Berlin, 1968, 80–95.

    Chapter  Google Scholar 

  17. C. Karp, Infinite-qunatifier languages and ω-chains of models, Proceedings of the Tarski Symposium, American Mathematical Society, 1974, 225–232.

    Google Scholar 

  18. H.J. Keisler, Model Theory for Infinitary Logic, North-Holland, Amsterdam, 1971.

    MATH  Google Scholar 

  19. A. Lévy, A hierarchy of formulas in set theory, Memoirs of the American Mathematical Society, No. 57, 1965.

    Google Scholar 

  20. E.G.K. López-Escobar, An interpolation theorem for denumerably long sentences, Fundamenta Mathematica LVII(1965), 253–272.

    MATH  Google Scholar 

  21. E.G.K. López-Escobar, On defining well-orderings, Fundamenta Mathematica LIX(1966), 13–21.

    MathSciNet  MATH  Google Scholar 

  22. M. Makkai, An application of a method of Smullyan to logics on admissible sets, Bulletin de l'Académie Polonaise des Sci, Ser. Math. 17(1969), 341–346.

    MathSciNet  MATH  Google Scholar 

  23. J. Malitz, Problems in the Model Theory of Infinitary Languages, Ph.D. Thesis, Berkeley, 1966.

    Google Scholar 

  24. R. Platek, Foundations of Recursion Theory, Ph.D. Thesis, Stanford, 1966.

    Google Scholar 

  25. R. Smullyan, A unifying principle in quantification theory, Proceedings of the National Acad. Sci. 49(1963), 828–832.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Authors
  1. Judy Green
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

David W. Kueker

Rights and permissions

Reprints and permissions

Copyright information

© 1975 Springer-Verlag

About this paper

Cite this paper

Green, J. (1975). Consistency properties for finite quantifier languages. In: Kueker, D.W. (eds) Infinitary Logic: In Memoriam Carol Karp. Lecture Notes in Mathematics, vol 492. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0081121

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07419-9

  • Online ISBN: 978-3-540-37949-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation