Pages that link to "Presburger arithmetic"
From HandWiki
The following pages link to Presburger arithmetic:
Displayed 38 items.
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)- Automated reasoning (← links)
- Complete theory (← links)
- Computational complexity theory (← links)
- Entscheidungsproblem (← links)
- Generalized arithmetic progression (← links)
- Gödel's incompleteness theorems (← links)
- NP-completeness (← links)
- Peano axioms (← links)
- Time complexity (← links)
- Timeline of mathematical logic (← links)
- Generic-case complexity (← links)
- Double exponential function (← links)
- List of computability and complexity topics (← links)
- List of first-order theories (← links)
- List of mathematical logic topics (← links)
- P versus NP problem (← links)
- Z-group (← links)
- Type system (← links)
- Regular numerical predicate (← links)
- Automated theorem proving (← links)
- Büchi arithmetic (← links)
- Consistency (← links)
- Recursive language (← links)
- Presburger arithmetic (transclusion) (← links)
- Satisfiability modulo theories (← links)
- Skolem arithmetic (← links)
- 2-EXPTIME (← links)
- Infinite chess (← links)
- Second-order arithmetic (← links)
- Quantifier elimination (← links)
- Robinson arithmetic (← links)
- Cobham's theorem (← links)
- Feferman–Vaught theorem (← links)
- S2S (mathematics) (← links)
- Philosophy:Decidability (logic) (← links)
- Biography:Thoralf Skolem (← links)
- Biography:William Pugh (computer scientist) (← links)
- Biography:Mojżesz Presburger (← links)