The unsolvability of the Gödel class with identity

DOI10.2307/2274274zbMATH Open0576.03008OpenAlexW2140992830MaRDI QIDQ3695253FDOQ3695253

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

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

zbMATH Keywords

GCIMGCI

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25)

Cites Work

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

Cited In (17)

• On the Decision Problem for Two-Variable First-Order Logic
• Small substructures and decidability issues for first-order logic with two variables
• Implication of clauses is undecidable
• Title not available (Why is that?)
• Title not available (Why is that?)
• Decidability of cylindric set algebras of dimension two and first-order logic with two variables
• Decidable Fragments of Many-Sorted Logic
• 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
• Title not available (Why is that?)
• On the subtle nature of a simple logic of the hide and seek game
• Satisfiability of formulae with one \(\forall\) is decidable in exponential time
• The Gödel class with identity is unsolvable
• A simple logic of the hide and seek game
• Thue trees
• 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)