scientific article; zbMATH DE number 7379289
From MaRDI portal
Publication:5009704
DOI10.23638/LMCS-17(2:18)2021MaRDI QIDQ5009704
Alexis Bès, Christian Choffrut
Publication date: 5 August 2021
Full work available at URL: https://arxiv.org/abs/2002.04282
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Decidability of Definability Issues in the Theory of Real Addition ⋮ Lattice of definability (of reducts) for integers with successor ⋮ Externally definable quotients and NIP expansions of the real ordered additive group ⋮ Pregeometry over locally o‐minimal structures and dimension
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A generalization of Cobham's theorem to automata over real numbers
- A \(2^{2^{2^{pn}}}\) upper bound on the complexity of Presburger arithmetic
- Presburgerness of predicates regular in two number systems
- The definable criterion for definability in Presburger arithmetic and its applications.
- Essentially periodic ordered groups
- When is scalar multiplication decidable?
- Effective definability of the reachability relation in timed automata
- Semigroups, Presburger formulas, and languages
- Automata-Based Symbolic Representations of Polyhedra
- Büchi Automata Recognizing Sets of Reals Definable in First-Order Logic with Addition and Order
- Mechanizing the Powerset Construction for Restricted Classes of ω-Automata
- A Decision Procedure for the First Order Theory of Real Addition with Order
- Expansions of dense linear orders with the intermediate value property
- THERE ARE NO INTERMEDIATE STRUCTURES BETWEEN THE GROUP OF INTEGERS AND PRESBURGER ARITHMETIC
- The Lattice of Definability. Origins, Recent Developments, and Further Directions
- On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases
- On the base-dependence of sets of numbers recognizable by finite automata
