Elementary theories and hereditary undecidability for semilattices of numberings (Q1734277): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00153-018-0647-y / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2893282143 / rank | |||
Normal rank | |||
Revision as of 23:40, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Elementary theories and hereditary undecidability for semilattices of numberings |
scientific article |
Statements
Elementary theories and hereditary undecidability for semilattices of numberings (English)
0 references
27 March 2019
0 references
computability theory
0 references
numbering theory
0 references
computably enumerable equivalence relation
0 references
hereditary undecidability
0 references
elementary definability
0 references
first order arithmetic
0 references
second order arithmetic
0 references
upper semilattice
0 references
Rogers semilattice
0 references
