A formula with no recursively enumerable model

DOI10.4064/FM-42-1-125-140zbMath0067.25103OpenAlexW4241710558MaRDI QIDQ3228605

Andrzej Mostowski

Publication date: 1955

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

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

zbMATH Keywords

philosophy and foundations of mathematics

Related Items (5)

Changing a Semantics: Opportunism or Courage? ⋮ Models of noncontradictory formulas and the Ershov hierarchy ⋮ Every recursive enumerable extension of a theory of linear order has a constructive model ⋮ In memory of Andrzej Mostowski ⋮ Putnam’s Theorem on the Complexity of Models

This page was built for publication: A formula with no recursively enumerable model