Journal of Symbolic Logic 48 (4):1105-1119 (1983)

The set of all words in the alphabet {l, r} forms the full binary tree T. If x ∈ T then xl and xr are the left and the right successors of x respectively. We consider the monadic second-order language of the full binary tree with the two successor relations. This language allows quantification over elements of T and over arbitrary subsets of T. We prove that there is no monadic second-order formula φ * (X, y) such that for every nonempty subset X of T there is a unique y ∈ X that satisfies φ * (X, y) in T
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2273673
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 52,893
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles


Added to PP index

Total views
16 ( #592,097 of 2,343,523 )

Recent downloads (6 months)
12 ( #51,403 of 2,343,523 )

How can I increase my downloads?


My notes