Set Theory and Hierarchy Theory V pp 257-271 | Cite as
Construction of nice trees
Contributed Papers
First Online:
Abstract
We construct a recursive class of trees having decidable theories in Lo(Q1). Furthermore this class is a dense class of trees. The methods which we use are similar to those of H. Läuchli and J.Leonhard [4]. From our construction the decidability of TR(X1), the theory of uncountable trees in Lo(Q1), follows as a corollary. This was first proved by H.Herre
Keywords
Winning Strategy Order Language Local Game Extended Term Partial Isomorphism
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.
Preview
Unable to display preview. Download preview PDF.
References
- [1]A. Ehrenfeucht, An application of games to the completeness problem for formalized theories, Fund. Math. 49 (1961), 129–141MathSciNetMATHGoogle Scholar
- [2]H. Herre, Entscheidungsprobleme für Theorien in Logikem mit verallgemeinerten Quantoren, Dissertation B, Berlin 1976Google Scholar
- [3]H.J. Keisler, Logic with the quantifier "there exist uncountably many", Ann. Math.Logic 1, (1970), 1–93MathSciNetCrossRefMATHGoogle Scholar
- [4]H. Läuchli & J. Leonhard, On the elementary theory of linear order, Fund. Math. LIX (1966)Google Scholar
- [5]L.D. Lipner, Some aspects of generalized quantifiers, Thesis, The University of California at Berkley, (1970)Google Scholar
- [6]A. Mostowski, On a generalization of quantifiers, Fund. Math., vol. 44 (1957), 12–36MathSciNetMATHGoogle Scholar
- [7]S. Vinner, A generalization of Ehrenfeucht's game and some applications, Israel Journal of Math., vol. 12 No 3, (1972)Google Scholar
Copyright information
© Springer-Verlag 1977