Presburger arithmetic
Top View
- Presburger Arithmetic, Rational Generating Functions, and Quasi-Polynomials
- An Introduction to G¨Odel’Stheorems
- Arxiv:1709.07341V2 [Math.LO] 30 Jan 2018 Ossec Falisfiieyaimtzbesbhois En Arith Peano Subtheories
- Interpretations in Presburger Arithmetic
- A Survey of Automated Theorem Proving
- Decidability Vs. Undecidability. Logico-Philosophico-Historical Remarks
- CDM FOL Theories
- Decidability and Automatic Sequences
- Logic and Automata
- Gödel Blooming: the Incompleteness Theorems from a Paraconsistent Perspective
- Gödel's Incompleteness Theorems
- Satisfiability Modulo Theories
- Presburger Vector Addition Systems Jérôme Leroux
- Automated Theorem Proving
- Lazy Satisfiability Modulo Theories
- COMPLEXITY of SUBCASES of PRESBURGER ARITHMETIC by M. Fürer in [4]. (3)(Eyx)---(Ey,)L,L<EM, (4) (Eyx) □ □ □ (Eyk)L, L
- A Survival Guide to Presburger Arithmetic
- Gödel and Physics