Undecidability and recursive inseparability
From MaRDI portal
Publication:3279284
DOI10.1002/malq.19580040705zbMath0099.00901MaRDI QIDQ3279284
Publication date: 1958
Published in: Mathematical Logic Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/malq.19580040705
Related Items
Representability of recursively enumerable sets in formal theories, Creativity and Effective Inseparability, COMPUTABILITY, ORDERS, AND SOLVABLE GROUPS, A complete characterization of infinitely repeated two-player games having computable strategies with no computable best response under limit-of-means payoff, Groups with decidable word problem that do not embed in groups with decidable conjugacy problem, Intensional Kleene and Rice theorems for abstract program semantics