Trees and ehrenfeucht-fraïssé games

Annals of Pure and Applied Logic

Volumn 100, Issue 1-3, 1999, Pages 69-97

  Todorčević, Stevo ^a   Väänänen, Jouko ^b  

^a UNIVERSITY OF TORONTO   (Canada)

^b UNIVERSITY OF HELSINKI   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0033569286     PISSN: 01680072     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0168-0072(98)00064-5     Document Type: Article

References (29)

1. U. Avraham, S. Shelah, Isomorphism types of Aronszajn trees, Israel J. Math. 50 (1985) 75-108.
2. #, J. Symbolic Logic 47 (1982) 888-899.
3. א1, Israel J. Math. 29 (1978) 239-247.
4. G. Elekes, Coloring infinite subsets of ω, in: A. Hajnal, R. Rado, V.T. Sós, (Eds.), Infinite and Finite Sets, Colloq. Math. Soc. János Bolyai, vol. 10, North-Holland, Amsterdam, 1975, pp. 393-396.
5. T. Huuskonen, Observations about Scott and Karp trees, Ann. Pure Appl. Logic 76 (1995) 201-230.
6. T. Hyttinen, Games and infinitary languages, Ann. Acad. Sci. Fennicae Ser. A I: Math. Dissertationes 64 (1987).
7. T. Hyttinen, J. Väänänen, On Scott and Karp trees of uncountable models, J. Symbolic Logic 55 (1990) 897-908.
8. T. Jech, Set Theory, Academic Press, New York, 1978.
9. K. Kunen, Set Theory, North-Holland, Amsterdam, 1980.
10. D. Kurepa, Ensembles ordonnés et leur sous-ensembles bien ordonnés, C.R. Acad. Sci. Paris Ser. A 242 (1956), 116(1) (1995) 2202-2203.
11. D. Kurepa, Monotone mappings between some kinds of ordered sets, Glasnik Mat.-Fiz.Astr. 19 (1964) 175-186.
12. I. Lindström, Degrees of Souslin and Aronszajn trees, Z. Math. Logik Grundlag. Math. 33(2) (1987) 159-170.
13. A. Mekler, S. Shelah, The Canary tree, Can. Math. Bull. 36 (1993) 209-215.
14. ω1, J. Symbolic Logic 58(3) (1993) 1052-1070.
15. J. Oikkonen, J. Väänänen, Game-theoretic inductive definability, Ann. Pure Appl. Logic 65 (1993) 265-306.
16. A. Tarski, On well-ordered subsets of any set, Fund. Math. 32 (1939) 176-183.
17. S. Todorčević, Trees, subtrees and order types, Ann. Math. Logic 20(43) (1981) 233-268.
18. S. Todorčević, Stationary sets, trees and continuums, Publ. de L'inst. Math. 20(43) (1981) 249-262.
19. S. Todorčević, Real fonctions on the family of all well-ordered subsets of a partially ordered set, J. Symbolic Logic 48 (1983) 91-96.
20. S. Todorcevic, On a conjecture of R. Rado, J. London Math. Soc. 27(2) (1983) 1-8.
21. S. Todorčević, Partition relations for partially ordered sets, Acta Mat. 155 (1985) 1-25.
22. S. Todorčević, Partitioning pairs of countable ordinals, Acta Mat. 159 (1987) 261-294.
23. S. Todorčević, Partition Problems in Topology, American Mathematical Society, Providence, RI, 1989.
24. S. Todorčević, Two examples of Borel CCC posets, Proc. Amer. Math. Soc. 112 (1991) 1125-1128.
25. S. Todorčević, Conjectures of Rado and Chang and Cardinal arithmetic, in: N.W. Sauer, R.E. Woodrow, B. Sands (Eds.), Finite and Infinite Combinatorics in Sets and Logic, Kluwer, Dordrecht, 1993, pp. 385-398.
26. 2x, Stud. Math. 116(1) (1995) 49-57.
27. H. Tuuri, Infinitary Languages and Ehrenfeucht-fraïssé Games, Ph.D. Thesis, University of Helsinki, 1990.
28. J. Väänänen, Games and Trees in Infinitary Logic: A Survey, in: M. Krynicki, M. Mostowski, L. Szczerba (Eds.), Quantifiers, Kluwer Academic Publishers, Dordrecht, 1995, pp. 105-138.
29. W. Weiss, Partitioning topological spaces, in: J. Nešetřil, V. Rödl (Eds.), Mathematics of Ramsey Theory, Springer, Berlin, 1990, pp. 154-171.