Definability in Rationals with Real Order in the Background

DOI10.1093/LOGCOM/12.1.1zbMath0999.03005OpenAlexW1980876365MaRDI QIDQ4329520

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

expressibilitydefinabilitymonadic logic of order

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25)

Related Items (2)

Algorithmic uses of the Feferman-Vaught theorem ⋮ Selection in the monadic theory of a countable ordinal

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