Elementary theories and hereditary undecidability for semilattices of numberings (Q1734277): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
(7 intermediate revisions by 6 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1007/s00153-018-0647-y / rank | |||
Property / author | |||
Property / author: Nikolay Bazhenov / rank | |||
Property / author | |||
Property / author: M. M. Yamaleev / rank | |||
Property / author | |||
Property / author: Nikolay Bazhenov / rank | |||
Normal rank | |||
Property / author | |||
Property / author: M. M. Yamaleev / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
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 | |||
Property / cites work | |||
Property / cites work: Q4934289 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2709299 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4513962 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5384966 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Reductions between types of numberings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On computability with functionals / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Elementary Theories for Rogers Semilattices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Creative sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4530730 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Computably enumerable equivalence relations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: UNIVERSAL COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Survey on Universal Computably Enumerable Equivalence Relations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5573961 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The last question on recursively enumerable \(m\)-degrees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some undecidability results for lattices in recursion theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Recursively Enumerable Equivalence Relations Modulo Finite Differences / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3916564 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3958432 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Undecidable fragments of elementary theories / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A note on hereditarily Π10- and Σ10-complete sets of sentences / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5596785 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Computable structures and the hyperarithmetical hierarchy / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On a hierarchy of sets. III / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q129244613 / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1007/S00153-018-0647-Y / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 07: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