Monadic second order definable relations on the binary tree

Journal of Symbolic Logic 52 (1):219-226 (1987)
Abstract
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
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
 
Download options
PhilPapers Archive


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 21,444
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA
Wojciech Buszkowski (1980). Logical Complexity of Some Classes of Tree Languages Generated by Multiple-Tree-Automata. 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
A. P. Hazen (1997). Relations in Monadic Third-Order Logic. Journal of Philosophical Logic 26 (6):619-628.

Monthly downloads

Added to index

2009-01-28

Total downloads

13 ( #281,288 of 1,911,680 )

Recent downloads (6 months)

1 ( #458,010 of 1,911,680 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Start a new thread
Order:
There  are no threads in this forum
Nothing in this forum yet.