Monadic second order definable relations on the binary tree

Journal of Symbolic Logic 52 (1):219-226 (1987)
Let S2S [WS2S] espectively be the storn [weak] monadic second order theory of the binary tree T in the language of two successor functions. An S2S-formula whose free variables are just individual variables defines a relation on T (rather than on the power set of T). We show that S2S and WS2S define the same relations on T, and we give a simple characterization of these relations
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2273878
 Save to my reading list
Follow the author(s)
Edit this record
My bibliography
Export citation
Find it on Scholar
Mark as duplicate
Request removal from index
Revision history
Download options
Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 29,848
Through your library
References found in this work BETA
Logical Complexity of Some Classes of Tree Languages Generated by Multiple-Tree-Automata.Wojciech Buszkowski - 1980 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 26 (1-6):41-49.

Add more references

Citations of this work BETA

Add more citations

Similar books and articles
On the Consistency of the Definable Tree Property on ℵ.Amir Leshem - 2000 - Journal of Symbolic Logic 65 (3):1204 - 1214.
Relations in Monadic Third-Order Logic.A. P. Hazen - 1997 - Journal of Philosophical Logic 26 (6):619-628.
Rabin's Uniformization Problem.Yuri Gurevich & Saharon Shelah - 1983 - Journal of Symbolic Logic 48 (4):1105-1119.
Added to PP index

Total downloads
14 ( #365,698 of 2,210,554 )

Recent downloads (6 months)
1 ( #389,895 of 2,210,554 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature