Undefinability of multiplication in Presburger arithmetic with sets of powers

DOI10.1017/JSL.2023.71MaRDI QIDQ6953421zbMATH OpenFDO

Authors Chris S. Schulz

Publication date 24 July 2025

Published in The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/JSL.2023.71

zbMATH Keywords

\(k\)-automaticdefinabilitymodel theorynumeration systemsPresburger arithmetic

Mathematics Subject Classification ID

Model theory of denumerable and separable structures (03C15) Computable structure theory, computable model theory (03C57)

Cites work

• A strong version of Cobham’s theorem
• Classification theory and the number of non-isomorphic models
• Expansions of o-minimal structures by sparse sets
• scientific article; zbMATH DE number 956480 (Why is no real title available?)
• scientific article; zbMATH DE number 3657869 (Why is no real title available?)
• scientific article; zbMATH DE number 3575557 (Why is no real title available?)
• scientific article; zbMATH DE number 1422909 (Why is no real title available?)
• Interpretations of Presburger arithmetic in itself
• Logic and p-recognizable sets of integers
• Multiplicative structure in stable expansions of the group of integers
• On the base-dependence of sets of numbers recognizable by finite automata
• Presburger sets and p-minimal fields
• Semigroups, Presburger formulas, and languages
• The theory of \(\langle \mathbb{N} , +, V_ k, V_ l\rangle\) is undecidable
• Undecidable extensions of Büchi arithmetic and Cobham-Semënov Theorem

Cited in

(1)

• Decidability of extensions of Presburger arithmetic by generalised polynomials

This page was built for publication: Undefinability of multiplication in Presburger arithmetic with sets of powers

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