scientific article; zbMATH DE number 8420

MaRDI QIDQ3971059zbMATH OpenFDO

Authors Véronique Terrier

Publication date 25 June 1992

zbMATH Keywords

algorithmorderdivisibilityuniversal theorypower functionsnatural numbersexistential theorynegations of conditions

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Decidability (number-theoretic aspects) (11U05)

Recommendations

• Decidability of the Existential Theory of the Set of Natural Numbers with Order, Divisibility, Power Functions, Power Predicates, and Constants
• A logical approach to the problem of representation of integers by systems of diagonal forms
• Decidability of extended theories of addition of the natural numbers and the integers
• scientific article; zbMATH DE number 221693

Cited in

(9)

• A proof of Bel'tyukov-Lipshitz theorem by quasi-quantifier elimination. I: Definitions and GCD-lemma
• Decidability of the theory of the natural integers with the Cantor pairing function and the successor
• scientific article; zbMATH DE number 3933028 (Why is no real title available?)
• Foundations of Software Science and Computational Structures
• A logical approach to the problem of representation of integers by systems of diagonal forms
• scientific article; zbMATH DE number 3884129 (Why is no real title available?)
• The elementary theory of the natural lattice is finitely axiomatizable
• Universal theories of integers and the extended Bliznetsov hypothesis
• Decidability of extended theories of addition of the natural numbers and the integers

This page was built for publication:

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