scientific article; zbMATH DE number 937378

MaRDI QIDQ4896519zbMATH OpenFDO

Authors Dorella Bellè, Franco Parlamento

Publication date 19 March 1997

zbMATH Keywords

coding Turing machine computationsdecidabilityequational languageextensionalitysatisfiability of sentencesundecidabilityweak membership

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Axiomatics of classical set theory and its fragments (03E30)

Recommendations

• Undecidability in Weihrauch degrees
• Undecidability in Some Structures Related to Computation Theory
• scientific article; zbMATH DE number 4031661
• Undecidability and intuitionistic incompleteness
• Publication:4952569
• scientific article; zbMATH DE number 1095799
• UNDECIDABILITY OF THE THEORIES OF CLASSES OF STRUCTURES
• Undecidability of propositional separation logic and its neighbours
• scientific article; zbMATH DE number 5233159
• Weakly maximal decidable structures

Cited in

(5)

• The decidability of the ^* class and the axiom of foundation
• Decidability and completeness for open formulas of membership theories
• scientific article; zbMATH DE number 922623 (Why is no real title available?)
• UNDECIDABILITY OF THE THEORIES OF CLASSES OF STRUCTURES
• scientific article; zbMATH DE number 5233159 (Why is no real title available?)

This page was built for publication:

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