Elementary theories and hereditary undecidability for semilattices of numberings (Q1734277)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Elementary theories and hereditary undecidability for semilattices of numberings |
scientific article; zbMATH DE number 7043059
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Elementary theories and hereditary undecidability for semilattices of numberings |
scientific article; zbMATH DE number 7043059 |
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
0.8186016082763672
0 references
0.8169575929641724
0 references
0.8147759437561035
0 references
0.7994025349617004
0 references
