Keywords
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.
Some of the results of this article were obtained when the author was a guest of CSAV in Prague.
Preview
Unable to display preview. Download preview PDF.
References
J. BARWISE, M. KAUFMANN, M. MAKKAI, Stationary Logic, Annals of Mathematical Logic, vol. 13, Nu. 2, March 1978, 171–224.
A. BAUDISCH, The elementary theory of abelian groups with mchains of pure subgroups, preprint 1978.
A. BAUDISCH, D. SEESE, H.P. TUSCHIK, M. WEESE, Decidability and Generalized Quantifiers, Akademie-Verlag Berlin 1980.
A. BAUDISCH, D. SEESE, P. TUSCHIK, ω-Trees in Stationary Logic, to appear in Fund. Math.
A. BAUDISCH, P. TUSCHIK, L(aa) = L(Q1) for trees, unpublished manuscript, 1979.
J.R. BÜCHI, Using Determinacy of Games to Eliminate Quantifiers, Lecture Notes in Computer Science 56, 367–378.
P.C. EKLOF, A.H. MEKLER, Stationary Logic of Finitely Determinate Structures, Annals of Mathematical Logic, vol. 17, Nu. 3, 1979, 227–269.
H. HERRE, Remarks and Problems Concerning the Elimination of Generalized Quantifiers, unpublished manuscript 1980.
M. KAUFMANN, Some results in stationary logic, Ph. D. Dissertation, University of Wisconsin, 1978.
L.D. LIPNER, Some aspects of generalized quantifiers, Doctoral Dissertation, Univ. of California, Berkeley, 1970.
D.W. KEKER, Countable approximations and Löwenheim-Skolem Theorems, Ann. of Math. Logic, 11 (1977) 57–104.
A.H. MEKLER, The Stationary Logic of Ordinals, preprint 1979.
A.H. MEKLER, Another linear order which is not finitely determinate, notes, 1979.
D.SEESE, Decidability of ω-Trees with Bounded Sets — A Surcey, Lecture Notes in Computer Science 56, Berlin 1977, 511–515.
D.G. SEESE, Stationäre Logik — Beschränkte Mengen — Entscheid-barkeit, Dissertation B, Berlin 1980.
D. SEESE, Stationary Logic and Ordinals, Transactions of the AMS, vol. 263, Nu. 1, January 1981, 111–124.
D. SEESE, P. TUSCHIK, Construction of nice trees, Lecture Notes in Mathematics 619, Berlin 1977, 257–271.
D. SEESE, P. TUSCHIK, M. WEESE, Undecidable theories in stationary logic, to appear in Proceedings of the AMS.
S. SHELAH, Generalized quantifiers and compact logic, Transactions of the AMS, vol. 204, 1975, 342–364.
S. VINNER, A generalization of Ehrenfeucht's game and some applications, Israel J. Math. 12, 1972, 279–298.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Seese, D. (1981). Elimination of second-order quantifiers for well-founded trees in stationary logic and finitely determinate structures. In: Gécseg, F. (eds) Fundamentals of Computation Theory. FCT 1981. Lecture Notes in Computer Science, vol 117. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10854-8_38
Download citation
DOI: https://doi.org/10.1007/3-540-10854-8_38
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10854-2
Online ISBN: 978-3-540-38765-7
eBook Packages: Springer Book Archive