Infinitary Languages N∞λ and Generalized Partial Isomorphisms

  • Maaret Karttunen
Part of the Synthese Library book series (SYLI, volume 122)


In [3] Hintikka and Rantala define a new hierarchy of infinitary languages (the so-called N ∞λ. In our paper we consider the relationship between these languages and some generalized partial isomorphisms. With these generalizations we can give an algebraic characterization to the elementary equivalence of N∞λ.


Free Variable Atomic Formula Predicate Symbol Winning Strategy Regular Cardinal 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Dickmann, M. A., Large Infinitary Languages, North-Holland, Amsterdam, 1975.Google Scholar
  2. [2]
    Drake, F. R., Set Theory. An Introduction to Large Cardinals, North-Holland, Amsterdam, 1973.Google Scholar
  3. [3]
    Hintikka, J. and Rantala, V., ‘A new approach to infinitary languages’, Annals of Mathematical Logic 10 (1976), 95–115.CrossRefGoogle Scholar
  4. [4]
    Keisler, H. J., ‘Formulas with linearly ordered quantifiers’, in The Syntax and Semantics of Infinitary Languages, ed. by J. Barwise, Lecture Notes in Mathematics 72, Springer, Berlin, 1968, pp. 96–130.Google Scholar
  5. [5]
    Kueker, D. W., ‘Back-and-forth arguments and infinitary logics’, in Infinitary Logic: In Memoriam Carol Karp, ed. by D. W. Kueker, Lecture Notes in Mathematics 492, Springer, Berlin, 1975, pp. 17–71.CrossRefGoogle Scholar

Copyright information

© D. Reidel Publishing Company, Dordrecht, Holland 1979

Authors and Affiliations

  • Maaret Karttunen
    • 1
  1. 1.Department of Computer ScienceUniversity of HelsinkiFinland

Personalised recommendations