On a system of axioms which has no recursively enumerable arithmetic model

DOI10.4064/fm-40-1-56-61zbMath0053.00302OpenAlexW4244122849WikidataQ114573874 ScholiaQ114573874MaRDI QIDQ5823277

Andrzej Mostowski

Publication date: 1953

Published in: Fundamenta Mathematicae (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/213330

zbMATH Keywords

philosophy and foundations of mathematics

Related Items (3)

Recursive coloration of countable graphs ⋮ In memory of Andrzej Mostowski ⋮ Putnam’s Theorem on the Complexity of Models

This page was built for publication: On a system of axioms which has no recursively enumerable arithmetic model