The unsolvability of the Gödel class with identity

DOI10.2307/2274274zbMath0576.03008OpenAlexW2140992830MaRDI QIDQ3695253

Warren D. Goldfarb

Publication date: 1984

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2274274

zbMATH Keywords

GCIMGCI

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25)

Related Items

The decision problem of modal product logics with a diagonal, and faulty counter machines, On the subtle nature of a simple logic of the hide and seek game, Small substructures and decidability issues for first-order logic with two variables, Implication of clauses is undecidable, Decidable Fragments of Many-Sorted Logic, A simple logic of the hide and seek game, On the Decision Problem for Two-Variable First-Order Logic, Satisfiability of formulae with one \(\forall\) is decidable in exponential time, Combining enumeration and deductive techniques in order to increase the class of constructible infinite models, Unnamed Item, Decidability of cylindric set algebras of dimension two and first-order logic with two variables, Decidable fragments of many-sorted logic, Thue trees

Cites Work

• Unnamed Item
• Über die Erfüllbarkeit derjenigen Zählausdrücke, welche in der Normalform zwei benachbarte Allzeichen enthalten
• Untersuchungen zum Entscheidungsproblem der mathematischen Logik
• Solvable cases of the decision problem
• A decidable subclass of the minimal Gödel class with identity
• Zum Entscheidungsproblem des logischen Funktionenkalküls
• Contributions to the reduction theory of the decision problem