Computability by means of effectively definable schemes and definability via enumerations

DOI10.1007/BF01621094zbMath0688.03028MaRDI QIDQ1263579

Ivan N. Soskov

Publication date: 1990

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

zbMATH Keywords

enumerationscharacterization of computability via Shepherdson's recursively enumerable definitional schemes

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45)

Related Items

Enumeration Reducibility and Computable Structure Theory

Cites Work

• Definability via enumerations
• Abstract First Order Computability. I
• Abstract Computability and Invariant Definability
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computability by means of effectively definable schemes and definability via enumerations