Undecidability of some simple formalized theories

DOI10.4064/FM-40-1-131-139MaRDI QIDQ5824365zbMATH OpenOpenAlexFDO

Authors Antoni Janiczak

Publication date 1953

Published in Fundamenta Mathematicae (Search for Journal in Brave)

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

zbMATH Keywords

foundations of mathematics, philosophy, logic

Cited in

(12)

• A verified decision procedure for orders in Isabelle/HOL
• Modal definability: two commuting equivalence relations
• Decision methods for linearly ordered Heyting algebras
• On the decision problem for theories of finite models
• The two-variable fragment with counting and equivalence
• Finding the limit of incompleteness. I
• There are no minimal effectively inseparable theories
• Complexity of the problem of being equivalent to Horn formulas. II
• On the existential fragments of local first-order logics with data
• Essential hereditary undecidability
• On the satisfiability of local first-order logics with data
• The limitless first incompleteness theorem

This page was built for publication: Undecidability of some simple formalized theories

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5824365)