The uniformization problem for \(\Sigma\)-predicates in a hereditarily finite list superstructure over the real exponential field

DOI10.1007/s10469-014-9266-9zbMath1323.03043OpenAlexW2127738465MaRDI QIDQ2342296

S. A. Aleksandrova

Publication date: 11 May 2015

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10469-014-9266-9

zbMATH Keywords

\(\Sigma\)-definabilityuniformization theoremhereditarily finite list superstructure

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Related Items

Definable Subsets of Polynomial-Time Algebraic Structures ⋮ Universal functions and \(K \Sigma \)-structures ⋮ Uniformization in superstructures over some extensions of \(\mathbb{R}\) ⋮ Universal functions and almost \(c\)-simple models ⋮ On decidability of list structures ⋮ Properties of \(s\Sigma\)-reducibility ⋮ A class of almost \(c\)-simple rings

Cites Work

• \(\Sigma \)-uniform structures and \(\Sigma \)-functions. I
• Some presentations of the real number field
• A universal recursive function on admissible sets
• Σ-Definability of countable structures over real numbers, complex numbers, and quaternions
• Model completeness results for expansions of the ordered field of real numbers by restricted Pfaffian functions and the exponential function
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item