scientific article; zbMATH DE number 1512848

MaRDI QIDQ4508546zbMATH OpenFDO

Authors

Publication date 4 June 2001

zbMATH Keywords

arithmeticdecidability

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) First-order arithmetic and fragments (03F30)

Recommendations

• scientific article; zbMATH DE number 1827828
• Fragments of arithmetic and pairing functions
• Decision procedures for elementary sublanguages of set theory. XV: Multilevel syllogistic extended by the predicate Finite and the operators singleton and \(pred_ <\)
• scientific article; zbMATH DE number 51556
• Publication:3204451
• scientific article; zbMATH DE number 440479
• scientific article; zbMATH DE number 1342215
• Decision algorithms for some fragments of analysis and related areas
• Pure Logic with Branched Quantifiers
• Finite automata, real time processes and counting problems in bounded arithmetics

Cited in

(8)

• Morphisms and almost-periodicity
• Presburger arithmetic and recognizability of sets of natural numbers by automata: New proofs of Cobham's and Semenov's theorems
• scientific article; zbMATH DE number 4031630 (Why is no real title available?)
• On the completeness of a certain system of arithmetic of whole numbers in which addition occurs as the only operation
• scientific article; zbMATH DE number 1512851 (Why is no real title available?)
• On decidable extensions of Presburger arithmetic: from A. Bertrand numeration sytems to Pisot numbers
• A collapse result for extensions of the Presburger arithmetic by a one-place function compatible with addition.
• An introduction to the theory of linear integer arithmetic (invited paper)

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 Q4508546)