Undecidable extensions of Skolem arithmetic

DOI10.2307/2586837MaRDI QIDQ4212909zbMATH OpenOpenAlexFDO

Authors Alexis Bès, D. Richard

Publication date 7 October 1998

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

Full work available at URL https://doi.org/10.2307/2586837

zbMATH Keywords

coprimeness predicateundecidable extensions of Skolem arithmetic

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30)

Recommendations

• scientific article; zbMATH DE number 952488
• scientific article; zbMATH DE number 3926911
• scientific article; zbMATH DE number 221693
• Decidability and undecidability of theories with a predicate for the primes

Cites work

• scientific article; zbMATH DE number 3489188 (Why is no real title available?)
• All arithmetical sets of powers of primes are first-order definable in terms of the successor function and the coprimeness predicate
• Definability and decidability issues in extensions of the integers with the divisibility predicate
• Definability and decision problems in arithmetic
• The theory of integer multiplication with order restricted to primes is decidable

Cited in

(9)

• Undecidable wreath products and skew power series fields
• Some proofs of undecidability of arithmetic
• Some model theory of Th(N,·)$\operatorname{Th}(\mathbb {N},\cdot )$
• Undecidable extensions of Büchi arithmetic and Cobham-Semënov Theorem
• scientific article; zbMATH DE number 3916265 (Why is no real title available?)
• Some new results in monadic second-order arithmetic
• 2004 Summer Meeting of the Association for Symbolic Logic
• A note on definability in fragments of arithmetic with free unary predicates
• A list of arithmetical structures complete with respect to the first-order definability

This page was built for publication: Undecidable extensions of Skolem arithmetic

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