Elementary theories and hereditary undecidability for semilattices of numberings

Research output: Contribution to journal › Article › peer-review

Original language	English
Pages (from-to)	485-500
Number of pages	16
Journal	Archive for Mathematical Logic
Volume	58
Issue number	3-4
DOIs	https://doi.org/10.1007/s00153-018-0647-y
Publication status	Published - 9 May 2019

Computability theory, Computably enumerable equivalence relation, Elementary definability, First order arithmetic, Hereditary undecidability, Numbering theory, Rogers semilattice, Second order arithmetic, Upper semilattice

ID: 16758237