scientific article; zbMATH DE number 3285224
From MaRDI portal
Publication:5567863
zbMath0178.32303MaRDI QIDQ5567863
Publication date: 1962
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (18)
A necessary condition for constructive negation in constraint logic programming ⋮ Nonconvergence, undecidability, and intractability in asymptotic problems ⋮ Friedman-reflexivity ⋮ HOW MUCH PROPOSITIONAL LOGIC SUFFICES FOR ROSSER’S ESSENTIAL UNDECIDABILITY THEOREM? ⋮ A universal algebraic set theory built on mereology with applications ⋮ The calculus of relations as a foundation for mathematics ⋮ On \(\mathsf{Q}\) ⋮ Weak theories of concatenation and arithmetic ⋮ A uniform method for proving lower bounds on the computational complexity of logical theories ⋮ Weak theories of concatenation and minimal essentially undecidable theories. An encounter of \(\mathsf{WTC}\) and \(\mathsf{S2S}\) ⋮ On the effective content of asymptotic verifications of Edgeworth's Conjecture ⋮ The scope of Gödel's first incompleteness theorem ⋮ Constructive negation and constraint logic programming with sets ⋮ CURRENT RESEARCH ON GÖDEL’S INCOMPLETENESS THEOREMS ⋮ On the decision problem for theories of finite models ⋮ FINDING THE LIMIT OF INCOMPLETENESS I ⋮ Variants of Robinson's essentially undecidable theoryR ⋮ Undecidability of Algebras of Binary Relations
This page was built for publication:
