,+,<,1 is decidable in R,+,<,Z

DOI10.1007/978-3-030-40608-0_8MaRDI QIDQ782563zbMATH OpenOpenAlexFDO

Authors Alexis Bès, Christian Choffrut

Publication date 27 July 2020

Full work available at URL https://doi.org/10.1007/978-3-030-40608-0_8

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25)

Recommendations

• Decidability of Definability Issues in the Theory of Real Addition
• scientific article; zbMATH DE number 2047495
• When is scalar multiplication decidable?
• Deciding whether a relation defined in Presburger logic can be defined in weaker logics
• On decidability and axiomatizability of some ordered structures

Cited in

(5)

• It is decidable whether the image of an \(\mathbb N\)-rational sequence has a base
• Expansions of the ordered additive group of real numbers by two discrete subgroups
• Theories of real addition with and without a predicate for integers
• Decidability of Definability Issues in the Theory of Real Addition
• Generalized Parikh matrices for tracking subsequence occurrences

This page was built for publication: \(\langle\mathbb{R},+,<,1\rangle\) is decidable in \(\langle \mathbb{R},+,<,\mathbb{Z}\rangle\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q782563)