Definability and undefinability with real order at the background
From MaRDI portal
Publication:4508271
DOI10.2307/2586579zbMATH Open0963.03062OpenAlexW2067891767MaRDI QIDQ4508271FDOQ4508271
Authors: 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
Recommendations
- Definability in Rationals with Real Order in the Background
- Universally Baire sets and definable well-orderings of the reals
- On Σ‐definability without equality over the real numbers
- Definability in o-minimal expansions of the real numbers
- scientific article; zbMATH DE number 3704634
- Definability and reducibility in higher types over the reals
- Regularity properties of definable sets of reals
- A definable nonstandard model of the reals
- Definability in the enumeration degrees
- On definable completeness for ordered fields
Decidability of theories and sets of sentences (03B25) Total orders (06A05) Interpolation, preservation, definability (03C40) Second- and higher-order model theory (03C85)
Cites Work
Cited In (6)
- Definability in Rationals with Real Order in the Background
- Algorithmic uses of the Feferman-Vaught theorem
- Limited set quantifiers over countable linear orderings
- An algebraic approach to MSO-definability on countable linear orderings
- Undefinability of κ-well-orderings in L∞κ
- On Σ‐definability without equality over the real numbers
This page was built for publication: Definability and undefinability with real order at the background
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4508271)