First-order approximation of algorithmic theories (Q1095655)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4028892
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | First-order approximation of algorithmic theories |
scientific article; zbMATH DE number 4028892 |
Statements
First-order approximation of algorithmic theories (English)
0 references
1986
0 references
Relations are investigated between an algorithmic theory and its first- order translation in which sorts of variables for natural numbers and objects for the coding of computations are added. In particular it is investigated what properties of the original algorithmic theory are preserved by the translation to a first-order language. It appears that equivalence (of theories), decidability, completeness and \(\aleph_ 0\)- categoricity are not preserved by this translation. It is also studied whether every model of the first-order translation of an algorithmic theory has a submodel with standard natural numbers (thus removing the representations of nonstandard computations). It is shown that, in general, the answer to this question is negative. Finally, a method of coding diverging computations is suggested.
0 references
algorithmic logic
0 references
model theory
0 references
algorithmic theory
0 references
first-order language
0 references
coding diverging computations
0 references
0.7428374290466309
0 references
0.7414376735687256
0 references
