Definability and undefinability with real order at the background

DOI10.2307/2586579zbMath0963.03062OpenAlexW2067891767MaRDI QIDQ4508271

Alexander Rabinovich, Yuri Gurevich

Publication date: 18 June 2001

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

Full work available at URL: https://doi.org/10.2307/2586579

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Total orders (06A05) Second- and higher-order model theory (03C85) Interpolation, preservation, definability (03C40)

Related Items (3)

Limited Set quantifiers over Countable Linear Orderings ⋮ Algorithmic uses of the Feferman-Vaught theorem ⋮ AN ALGEBRAIC APPROACH TO MSO-DEFINABILITY ON COUNTABLE LINEAR ORDERINGS

Cites Work

• Monadic theory of order and topology in ZFC
• Modest theory of short chains. I

This page was built for publication: Definability and undefinability with real order at the background