Decidability of Definability Issues in the Theory of Real Addition

DOI10.3233/FI-222140MaRDI QIDQ5880942

Alexis Bès, Christian Choffrut

Publication date: 9 March 2023

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2102.06160

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A generalization of Cobham's theorem to automata over real numbers
• Logic and \(p\)-recognizable sets of integers
• The definable criterion for definability in Presburger arithmetic and its applications.
• Essentially periodic ordered groups
• When is scalar multiplication decidable?
• Expansions of MSO by cardinality relations
• Automata-Based Symbolic Representations of Polyhedra
• Strong theories of ordered Abelian groups
• The first order properties of products of algebraic systems
• Structures having o-minimal open core
• A Decision Procedure for the First Order Theory of Real Addition with Order
• The Lattice of Definability. Origins, Recent Developments, and Further Directions
• On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases
• A Generalization of Semenov’s Theorem to Automata over Real Numbers

This page was built for publication: Decidability of Definability Issues in the Theory of Real Addition