Computability by means of effectively definable schemes and definability via enumerations
From MaRDI portal
Publication:1263579
DOI10.1007/BF01621094zbMath0688.03028MaRDI QIDQ1263579
Publication date: 1990
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
enumerationscharacterization of computability via Shepherdson's recursively enumerable definitional schemes
Related Items
Cites Work
This page was built for publication: Computability by means of effectively definable schemes and definability via enumerations