Decidability of Definability Issues in the Theory of Real Addition
From MaRDI portal
Recommendations
- Theories of real addition with and without a predicate for integers
- \(\langle\mathbb{R},+,<,1\rangle\) is decidable in \(\langle \mathbb{R},+,<,\mathbb{Z}\rangle\)
- scientific article; zbMATH DE number 5569985
- Coarse dimension and definable sets in expansions of the ordered real vector space
- À propos du théorème fondamental de la théorie des jacobiens.
- An index theorem for the product of linear relations
- Über einen mengentheoretischen Satz.
- When the medial axis meets the singularities
- Über die Dimension von Punktmengen. II.
- scientific article; zbMATH DE number 3027046
Cites work
- A Decision Procedure for the First Order Theory of Real Addition with Order
- A generalization of Cobham's theorem to automata over real numbers
- A Generalization of Semenov’s Theorem to Automata over Real Numbers
- Automata-based symbolic representations of polyhedra
- Essentially periodic ordered groups
- Expansions of MSO by cardinality relations
- scientific article; zbMATH DE number 4110185 (Why is no real title available?)
- scientific article; zbMATH DE number 3575557 (Why is no real title available?)
- scientific article; zbMATH DE number 1223712 (Why is no real title available?)
- Logic and p-recognizable sets of integers
- On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases
- Strong theories of ordered abelian groups
- Structures having o-minimal open core
- The definable criterion for definability in Presburger arithmetic and its applications.
- The first order properties of products of algebraic systems
- The lattice of definability. Origins, recent developments, and further directions
- Theories of real addition with and without a predicate for integers
- When is scalar multiplication decidable?
Cited in
(4)- Quasi-decidability of a fragment of the first-order theory of real numbers
- Theories of real addition with and without a predicate for integers
- Decidability of definability issues in the theory of real addition
- \(\langle\mathbb{R},+,<,1\rangle\) is decidable in \(\langle \mathbb{R},+,<,\mathbb{Z}\rangle\)
This page was built for publication: Decidability of Definability Issues in the Theory of Real Addition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5880942)