On arithmetical first-order theories allowing encoding and decoding of lists
type: Item
instance of: scholarly article
title: On arithmetical first-order theories allowing encoding and decoding of lists
zbMATH Open document ID: 0930.68032
DOI: 10.1016/S0304-3975(97)00281-8
author: D. Richard
author: Patrick Cégielski
published in: Theoretical Computer Science
publication date: 2000-01-12T00:00:00Z
Mathematics Subject Classification ID: 68N17
zbMATH DE Number: 1387436
zbMATH Keywords: encoding
zbMATH Keywords: decoding
zbMATH Keywords: pairing function
zbMATH Keywords: list
zbMATH Keywords: first logic
zbMATH Keywords: decidability
zbMATH Keywords: undecidability
MaRDI profile type: Publication
cites work: Q3290711
cites work: Definability, decidability, complexity
cites work: Q4830809
cites work: Recursive programming
cites work: Q4052071
cites work: A list of arithmetical structures complete with respect to the first-order definability
cites work: Concatenation as a basis for arithmetic
cites work: Q3218118
cites work: Q4735188
cites work: Definability in terms of the successor function and the coprimeness predicate in the set of arbitrary integers
cites work: Definability and decision problems in arithmetic
cites work: LOGICAL THEORIES OF ONE-PLACE FUNCTIONS ON THE SET OF NATURAL NUMBERS
cites work: Q3900021
cites work: Logical number theory I. An introduction
full work available at URL: s0304-3975(97)00281-8
OpenAlex ID: W2014470854
description: scientific article; zbMATH DE number 1387436