Undecidability and recursive inseparability

DOI10.1002/malq.19580040705zbMath0099.00901OpenAlexW2002149472MaRDI QIDQ3279284

Raymond M. Smullyan

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

zbMATH Keywords

philosophy and foundations of mathematics

Related Items (6)

A complete characterization of infinitely repeated two-player games having computable strategies with no computable best response under limit-of-means payoff ⋮ Representability of recursively enumerable sets in formal theories ⋮ Groups with decidable word problem that do not embed in groups with decidable conjugacy problem ⋮ Creativity and Effective Inseparability ⋮ COMPUTABILITY, ORDERS, AND SOLVABLE GROUPS ⋮ Intensional Kleene and Rice theorems for abstract program semantics

This page was built for publication: Undecidability and recursive inseparability