The full binary tree cannot be interpreted in a chain

DOI10.2178/JSL/1286198158MaRDI QIDQ3066806zbMATH OpenOpenAlexFDO

Authors Alexander Rabinovich

Publication date 12 January 2011

Published in Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2178/jsl/1286198158

zbMATH Keywords

chaindecidabilityfull binary treemonadic second-order logicRabin's interpretation methodShelah's model-theoretical composition method

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Basic properties of first-order languages and structures (03C07) Automata and formal grammars in connection with logical questions (03D05)

Recommendations

• scientific article; zbMATH DE number 1418347
• The Monadic Theory of Tree-like Structures
• Monadic second order definable relations on the binary tree
• scientific article; zbMATH DE number 30615
• On countable chains having decidable monadic theory

Cites work

• scientific article; zbMATH DE number 3767656 (Why is no real title available?)
• On the strength of the interpretation method
• Peano arithmetic may not be interpretable in the monadic theory of linear orders
• Random graphs in the monadic theory of order
• The monadic second order theory of all countable ordinals
• The monadic theory of ω₂
• The monadic theory of order

Cited in

(1)

• More on \(\mathrm{SOP}_1\) and \(\mathrm{SOP}_2\)

This page was built for publication: The full binary tree cannot be interpreted in a chain

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3066806)