Definability via enumerations

DOI10.2307/2274858zbMath0704.03026OpenAlexW2076989750MaRDI QIDQ3483272

Ivan N. Soskov

Publication date: 1989

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2274858

zbMATH Keywords

search computabilitySkordev's conjecture\(\forall \)-admissibilitypartial structure with denumerable domainrelative computability in abstract structuressearch-computable functions

Mathematics Subject Classification ID

Abstract and axiomatic computability and recursion theory (03D75)

Related Items (5)

Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Enumeration Reducibility and Computable Structure Theory ⋮ Computability by means of effectively definable schemes and definability via enumerations

Cites Work

• Unnamed Item

This page was built for publication: Definability via enumerations