scientific article
From MaRDI portal
Publication:3218118
zbMath0555.03026MaRDI QIDQ3218118
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
undecidabilitydefinabilityincompletenesssaturationmodels of arithmeticnatural ordernonstandard models of Peano arithmeticorder of divisibility
First-order arithmetic and fragments (03F30) Nonstandard models of arithmetic (03H15) Models of arithmetic and set theory (03C62)
Related Items (5)
On arithmetical first-order theories allowing encoding and decoding of lists ⋮ A list of arithmetical structures complete with respect to the first-order definability ⋮ All arithmetical sets of powers of primes are first-order definable in terms of the successor function and the coprimeness predicate ⋮ Definability, decidability, complexity ⋮ Investigation of binary spectra by explicit polynomial transformations of graphs
This page was built for publication: