Computability and Definability

DOI10.1142/9789813228238_0007MaRDI QIDQ4993085OpenAlexFDO

Authors Trang Ha, Leah Marshall, Hakim J. Walker, Valentina Harizanov

Publication date 15 June 2021

Published in Structure and Randomness in Computability and Set Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/9789813228238_0007

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

Recommendations

• Intrinsic bounds on complexity and definability at limit levels
• Isomorphisms and definable relations on computable models
• Computable categoricity versus relative computable categoricity
• The Complexity of intrinsically r.e. subsets of existentially decidable models
• Computability-theoretic categoricity and Scott families

Cited in

(15)

• Computability, complexity, logic. Transl. from the German
• scientific article; zbMATH DE number 7533333 (Why is no real title available?)
• scientific article; zbMATH DE number 2063217 (Why is no real title available?)
• scientific article; zbMATH DE number 2151710 (Why is no real title available?)
• Computability in Specification
• The concept of computability
• scientific article; zbMATH DE number 1998343 (Why is no real title available?)
• scientific article; zbMATH DE number 6863850 (Why is no real title available?)
• Computability and Recursion
• The complexity of countable categoricity in finite languages
• Definability by turing machines
• scientific article; zbMATH DE number 4088936 (Why is no real title available?)
• scientific article; zbMATH DE number 733392 (Why is no real title available?)
• scientific article; zbMATH DE number 4035802 (Why is no real title available?)
• Computational inductive definability

This page was built for publication: Computability and Definability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4993085)