Skip to main content

Definability, automorphisms, and infinitary languages

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

Keywords

  • Countable Model
  • Predicate Symbol
  • Large Cardinality
  • Isomorphism Theorem
  • Complete Sentence

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.99
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. Beth, E. W., On Padoa's method in the theory of definition, Indag. Math., 15 (1953), pp. 330–339.

    CrossRef  MathSciNet  MATH  Google Scholar 

  2. Chang, C. C., Infinitary properties of models generated from indiscernables, to appear in Proc. of Int'l. Cong. for Logic, Method., and Phil. of Science, Amsterdam, 1967.

    Google Scholar 

  3. -, Some new results in definability, Bull. A.M.S., 70 (1964), pp. 808–813.

    CrossRef  MathSciNet  MATH  Google Scholar 

  4. Chang, C. C., Some remarks on the model theory of infinitary languages, in this volume.

    Google Scholar 

  5. Lopez-Escobar, E. G. K., An interpolation theorem for denumerably long sentences, Fund. Math., 57 (1965), pp. 253–272.

    MathSciNet  MATH  Google Scholar 

  6. -, On defining well-orderings, Fund. Math., 59 (1966), pp. 13–21.

    MathSciNet  MATH  Google Scholar 

  7. Makkai, M., A generalization of a theorem of Beth, Acta Math. Acad. Sci. Hungar., 15 (1964), pp. 227–235.

    CrossRef  MathSciNet  MATH  Google Scholar 

  8. Malitz, J. I., The Hanf number of complete sentences of , in this volume.

    Google Scholar 

  9. Morley, M., Omitting classes of elements, The theory of models, Amsterdam, 1965, pp. 265–273.

    Google Scholar 

  10. Ohkuma, T., Sur quelques ensembles ordonnés linéairement, Fund. Math., 43 (1965), pp. 326–337.

    MathSciNet  MATH  Google Scholar 

  11. Reyes, G. E., Typical and generic relations in a Baire space for models, Doctoral dissertation, University of California, Berkeley, 1967.

    Google Scholar 

  12. Scott, D. Logic with denumerably long formulas and finite strings of quantifiers, The theory of models, Amsterdam, 1965, pp. 329–341.

    Google Scholar 

  13. Svenonius, L., A theorem on permutations in models, Theoria (Lund), 25 (1959), pp. 173–178.

    CrossRef  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1968 Springer-Verlag

About this paper

Cite this paper

Kueker, D.W. (1968). Definability, automorphisms, and 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/BFb0079688

Download citation

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

  • 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