The unsolvability of the Gödel class with identity

DOI10.2307/2274274MaRDI QIDQ3695253zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• The Gödel class with identity is unsolvable
• A decidable subclass of the minimal Gödel class with identity
• scientific article; zbMATH DE number 3715502
• scientific article; zbMATH DE number 3918329
• Ein Direkter Beweis für die Allgemein‐Rekursive Unlösbarkeit des Entscheidungsproblems des Prädikatenkalküls der Ersten Stufe mit Identität

Cites work

• scientific article; zbMATH DE number 3148407 (Why is no real title available?)
• A decidable subclass of the minimal Gödel class with identity
• Contributions to the reduction theory of the decision problem
• Solvable cases of the decision problem
• Untersuchungen zum Entscheidungsproblem der mathematischen Logik
• Zum Entscheidungsproblem des logischen Funktionenkalküls
• Über die Erfüllbarkeit derjenigen Zählausdrücke, welche in der Normalform zwei benachbarte Allzeichen enthalten

Cited in

(17)

• Small substructures and decidability issues for first-order logic with two variables
• On the Decision Problem for Two-Variable First-Order Logic
• Implication of clauses is undecidable
• scientific article; zbMATH DE number 7561660 (Why is no real title available?)
• scientific article; zbMATH DE number 3715502 (Why is no real title available?)
• Decidable Fragments of Many-Sorted Logic
• Decidability of cylindric set algebras of dimension two and first-order logic with two variables
• The decision problem of modal product logics with a diagonal, and faulty counter machines
• Decidable fragments of many-sorted logic
• A decidable subclass of the minimal Gödel class with identity
• On the subtle nature of a simple logic of the hide and seek game
• scientific article; zbMATH DE number 3918329 (Why is no real title available?)
• Satisfiability of formulae with one \(\forall\) is decidable in exponential time
• The Gödel class with identity is unsolvable
• Thue trees
• A simple logic of the hide and seek game
• Combining enumeration and deductive techniques in order to increase the class of constructible infinite models

This page was built for publication: The unsolvability of the Gödel class with identity

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