A Characterisation of the Relations Definable in Presburger Arithmetic
From MaRDI portal
Publication:3502652
DOI10.1007/978-3-540-79228-4_23zbMath1140.03311MaRDI QIDQ3502652
Publication date: 27 May 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-79228-4_23
03F30: First-order arithmetic and fragments
03D20: Recursive functions and relations, subrecursive hierarchies
Related Items
Bounded minimalisation and bounded counting in argument-bounded idc's, Pure Iteration and Periodicity
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Complexity-theoretic hierarchies induced by fragments of Gödel's \(T\)
- Complexity classes and fragments of C
- LOGSPACE and PTIME characterized by programming languages
- Neat function algebraic characterizations of LOGSPACE and LINSPACE
- The expressive power of higher-order types or, life without CONS
- On the completeness of a certain system of arithmetic of whole numbers in which addition occurs as the only operation
- Small Grzegorczyk classes and limited minimum
- Rudimentary Predicates and Relative Computation
- Computer Science Logic
- Monadic Elementary Formal Systems
- New Computational Paradigms