On countable chains having decidable monadic theory

DOI10.2178/JSL/1333566639zbMath1248.03017OpenAlexW2094354112MaRDI QIDQ2892678

Alexander Rabinovich, Alexis Bès

Publication date: 19 June 2012

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

Full work available at URL: https://projecteuclid.org/euclid.jsl/1333566639

zbMATH Keywords

monadic second-order logiccountable chainmaximal decidable structure

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Total orders (06A05) Second- and higher-order model theory (03C85) Model theory of denumerable and separable structures (03C15)

Cites Work

• Unnamed Item
• Algorithmic uses of the Feferman-Vaught theorem
• Nonmaximal decidable structures
• The monadic theory of order
• DETERMINISTIC AUTOMATA AND THE MONADIC THEORY OF ORDINALS < ω2
• The monadic theory of ω₂
• Interpreting second-order logic in the monadic theory of order
• Weakly maximal decidable structures
• Modest theory of short chains. I

This page was built for publication: On countable chains having decidable monadic theory