Undecidability of some simple formalized theories
From MaRDI portal
Publication:5824365
DOI10.4064/fm-40-1-131-139zbMath0052.25201OpenAlexW841006609MaRDI QIDQ5824365
Publication date: 1953
Published in: Fundamenta Mathematicae (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/213315
Related Items (9)
A verified decision procedure for orders in Isabelle/HOL ⋮ The two‐variable fragment with counting and equivalence ⋮ Modal definability: two commuting equivalence relations ⋮ There are no minimal effectively inseparable theories ⋮ Complexity of the problem of being equivalent to Horn formulas. II ⋮ Unnamed Item ⋮ Decision methods for linearly ordered Heyting algebras ⋮ On the decision problem for theories of finite models ⋮ FINDING THE LIMIT OF INCOMPLETENESS I
This page was built for publication: Undecidability of some simple formalized theories