Elimination of second-order quantifiers for well-founded trees in stationary logic and finitely determinate structures

  • Detlef Seese
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 117)


Stationary Logic Minimal Element Generalize Quantifier Isomorphic Copy Determinate Structure 
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]
    J. BARWISE, M. KAUFMANN, M. MAKKAI, Stationary Logic, Annals of Mathematical Logic, vol. 13, Nu. 2, March 1978, 171–224.Google Scholar
  2. [2]
    A. BAUDISCH, The elementary theory of abelian groups with mchains of pure subgroups, preprint 1978.Google Scholar
  3. [3]
    A. BAUDISCH, D. SEESE, H.P. TUSCHIK, M. WEESE, Decidability and Generalized Quantifiers, Akademie-Verlag Berlin 1980.Google Scholar
  4. [4]
    A. BAUDISCH, D. SEESE, P. TUSCHIK, ω-Trees in Stationary Logic, to appear in Fund. Math.Google Scholar
  5. [5]
    A. BAUDISCH, P. TUSCHIK, L(aa) = L(Q1) for trees, unpublished manuscript, 1979.Google Scholar
  6. [6]
    J.R. BÜCHI, Using Determinacy of Games to Eliminate Quantifiers, Lecture Notes in Computer Science 56, 367–378.Google Scholar
  7. [7]
    P.C. EKLOF, A.H. MEKLER, Stationary Logic of Finitely Determinate Structures, Annals of Mathematical Logic, vol. 17, Nu. 3, 1979, 227–269.Google Scholar
  8. [8]
    H. HERRE, Remarks and Problems Concerning the Elimination of Generalized Quantifiers, unpublished manuscript 1980.Google Scholar
  9. [9]
    M. KAUFMANN, Some results in stationary logic, Ph. D. Dissertation, University of Wisconsin, 1978.Google Scholar
  10. [10]
    L.D. LIPNER, Some aspects of generalized quantifiers, Doctoral Dissertation, Univ. of California, Berkeley, 1970.Google Scholar
  11. [11]
    D.W. KEKER, Countable approximations and Löwenheim-Skolem Theorems, Ann. of Math. Logic, 11 (1977) 57–104.Google Scholar
  12. [12]
    A.H. MEKLER, The Stationary Logic of Ordinals, preprint 1979.Google Scholar
  13. [13]
    A.H. MEKLER, Another linear order which is not finitely determinate, notes, 1979.Google Scholar
  14. [14]
    D.SEESE, Decidability of ω-Trees with Bounded Sets — A Surcey, Lecture Notes in Computer Science 56, Berlin 1977, 511–515.Google Scholar
  15. [15]
    D.G. SEESE, Stationäre Logik — Beschränkte Mengen — Entscheid-barkeit, Dissertation B, Berlin 1980.Google Scholar
  16. [16]
    D. SEESE, Stationary Logic and Ordinals, Transactions of the AMS, vol. 263, Nu. 1, January 1981, 111–124.Google Scholar
  17. [17]
    D. SEESE, P. TUSCHIK, Construction of nice trees, Lecture Notes in Mathematics 619, Berlin 1977, 257–271.Google Scholar
  18. [18]
    D. SEESE, P. TUSCHIK, M. WEESE, Undecidable theories in stationary logic, to appear in Proceedings of the AMS.Google Scholar
  19. [19]
    S. SHELAH, Generalized quantifiers and compact logic, Transactions of the AMS, vol. 204, 1975, 342–364.Google Scholar
  20. [20]
    S. VINNER, A generalization of Ehrenfeucht's game and some applications, Israel J. Math. 12, 1972, 279–298.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • Detlef Seese
    • 1
  1. 1.Institut für Mathematik AdW der DDRBerlinGDR

Personalised recommendations