Elementary theories and hereditary undecidability for semilattices of numberings (Q1734277): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q129244613, #quickstatements; #temporary_batch_1729977700717 |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s00153-018-0647-y / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S00153-018-0647-Y / rank | |||
Normal rank | |||
Latest revision as of 06:37, 11 December 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
