Undecidable extensions of Skolem arithmetic

DOI10.2307/2586837zbMATH Open0911.03030OpenAlexW2099198433MaRDI QIDQ4212909FDOQ4212909

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)

Cites Work

• Title not available (Why is that?)
• Definability and decision problems in arithmetic
• The theory of integer multiplication with order restricted to primes is decidable
• Definability and decidability issues in extensions of the integers with the divisibility predicate
• All arithmetical sets of powers of primes are first-order definable in terms of the successor function and the coprimeness predicate

Cited In (8)

• Some proofs of undecidability of arithmetic
• Undecidable extensions of Büchi arithmetic and Cobham-Semënov Theorem
• Title not available (Why is that?)
• 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
• Undecidable wreath products and skew power series fields

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)