On arithmetical first-order theories allowing encoding and decoding of lists
From MaRDI portal
Publication:1960537
DOI10.1016/S0304-3975(97)00281-8zbMath0930.68032OpenAlexW2014470854MaRDI QIDQ1960537
Denis Richard, Patrick Cégielski
Publication date: 12 January 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(97)00281-8
Related Items (4)
Bunched sequential information ⋮ Ranking/Unranking of Lambda Terms with Compressed de Bruijn Indices ⋮ The theory of hereditarily bounded sets ⋮ Decidability of the theory of the natural integers with the Cantor pairing function and the successor
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Recursive programming
- Logical number theory I. An introduction
- Definability, decidability, complexity
- LOGICAL THEORIES OF ONE-PLACE FUNCTIONS ON THE SET OF NATURAL NUMBERS
- Definability in terms of the successor function and the coprimeness predicate in the set of arbitrary integers
- Definability and decision problems in arithmetic
- Concatenation as a basis for arithmetic
- A list of arithmetical structures complete with respect to the first-order definability
This page was built for publication: On arithmetical first-order theories allowing encoding and decoding of lists
