Computability and Definability

DOI10.1142/9789813228238_0007OpenAlexW3091818723MaRDI QIDQ4993085FDOQ4993085

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

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

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

Cited In (15)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The complexity of countable categoricity in finite languages
• Title not available (Why is that?)
• Title not available (Why is that?)
• The concept of computability
• Computability and Recursion
• Computational inductive definability
• Title not available (Why is that?)
• Computability, complexity, logic. Transl. from the German
• Definability by turing machines
• Title not available (Why is that?)
• Title not available (Why is that?)
• Computability in Specification

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)