Definability in Rationals with Real Order in the Background

DOI10.1093/LOGCOM/12.1.1MaRDI QIDQ4329520zbMATH OpenOpenAlexFDO

Authors Alexander Rabinovich, Yuri Gurevich

Publication date 28 November 2002

Published in Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/21088f494a434a08916f811434bfa067f2fbd169

zbMATH Keywords

definabilityexpressibilitymonadic logic of order

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25)

Recommendations

• Definability and undefinability with real order at the background
• Limited set quantifiers over countable linear orderings
• Composition with Algebra at the Background
• An algebraic approach to MSO-definability on countable linear orderings
• scientific article; zbMATH DE number 2047495

Cited in

(5)

• Algorithmic uses of the Feferman-Vaught theorem
• Definability and undefinability with real order at the background
• Selection in the monadic theory of a countable ordinal
• First-order decidability and definability of integers in infinite algebraic extensions of the rational numbers
• On Σ‐definability without equality over the real numbers

This page was built for publication: Definability in Rationals with Real Order in the Background

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