A formal derivation of the decidability of the theory SA

DOI10.1016/0304-3975(94)90098-1zbMath0798.03008OpenAlexW1985258404MaRDI QIDQ1325831

V. Pereyra

Publication date: 15 May 1994

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(94)90098-1

zbMATH Keywords

first order theory of the rationals under additionsyntactic decision procedure

Mathematics Subject Classification ID

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

Related Items (1)

ORDER TYPES OF MODELS OF FRAGMENTS OF PEANO ARITHMETIC

Cites Work

• Complexity of Subcases of Presburger Arithmetic
• Presburger arithmetic with bounded quantifier alternation
• Unnamed Item

This page was built for publication: A formal derivation of the decidability of the theory SA