MSO on the infinite binary tree: Choice and order

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4646 LNCS, Issue , 2007, Pages 161-176

  Carayol, Arnaud ^a   Löding, Christof ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; FORMAL LOGIC; INTERACTIVE COMPUTER GRAPHICS; SET THEORY;

MONADIC SECOND-ORDER LOGIC (MSO); MSO-THEORY; UNAMBIGUOUS TREE AUTOMATA;

BINARY TREES;

EID: 38049052463     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74915-8_15     Document Type: Conference Paper

References (14)

1. Blumensath, A., Gradei, E.: Automatic structures. In: Proc. of LICS '00, pp. 51-62. IEEE Computer Society Press, Los Alamitos (2000)
2. Büchi, J.R., Landweber, L.H.: Solving sequential conditions by finite-state strategies. Transactions of the AMS 138, 295-311 (1969)
3. Büchi, J.R.: On a decision method in restricted second order arithmetic. In: International Congress on Logic, Methodology and Philosophy of Science, pp. 1-11. Stanford University Press (1962)
4. Caucal, D.: On infinite terms having a decidable monadic theory. In: Diks, K., Rytter, W. (eds.) MFCS 2002. LNCS, vol. 2420, pp. 165-176. Springer, Heidelberg (2002)
5. Carton, O., Michel, M.: Unambiguous büchi automata. Theor. Comput. Sci. 297(1-3), 37-81 (2003)
6. Carayol, A., Wöhrle, S.: The Caucal hierarchy of infinite graphs. In: Pandya, P.K., Radhakrishnan, J. (eds.) FST TCS 2003: Foundations of Software Tech-nology and Theoretical Computer Science. LNCS, vol. 2914, pp. 112-123. Springer, Heidelberg (2003)
7. Ebbinghaus, H.D., Flum, J.: Finite Model Theory. Springer, Heidelberg (1995)
8. Gurevich, Y., Shelah, S.: Rabin's uniformization problem. J. Symb. Log. 48(4), 1105-1119 (1983)
9. Lifsches, S., Shelah, S.: Uniformization, choice functions and well orders in the class of trees. J. Symb. Log. 61(4), 1206-1227 (1996)
10. Lifsches, S., Shelah, S.: Uniformization and skolem functions in the class of trees. J. Symb. Log. 63(1), 103-127 (1998)
11. Niwiòski, D., Walukiewicz, I.: Ambiguity problem for automata on infinite trees. (Unpublished note)
12. Rabin, M.O.: Decidability of second-order theories and automata on infinite trees. Transactions of the American Mathematical Society 141, 1-35 (1969)
13. Siefkes, D.: The recursive sets in certain monadic second order fragments of arithmetic. Arch, für mat. Logik und Grundlagenforschung 17, 71-80 (1975)
14. Thomas, W.: Languages, automata, and logic. In: Handbook of Formal Language Theory, vol. III, pp. 389-455 (1997)