On a system of axioms which has no recursively enumerable arithmetic model
From MaRDI portal
Publication:5823277
DOI10.4064/fm-40-1-56-61zbMath0053.00302OpenAlexW4244122849WikidataQ114573874 ScholiaQ114573874MaRDI QIDQ5823277
Publication date: 1953
Published in: Fundamenta Mathematicae (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/213330
Related Items
Recursive coloration of countable graphs, In memory of Andrzej Mostowski, Putnam’s Theorem on the Complexity of Models