First-order Frege theory is undecidable

DOI10.1023/A:1013362627445MaRDI QIDQ5960015zbMATH OpenOpenAlexFDO

Authors Warren D. Goldfarb

Publication date 11 April 2002

Published in Journal of Philosophical Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1013362627445

zbMATH Keywords

abstraction operatordecidabilityFrege

Mathematics Subject Classification ID

Philosophical and critical aspects of logic and foundations (03A05) Decidability of theories and sets of sentences (03B25)

Recommendations

• On the consistency of the first-order portion of Frege's logical system
• Ein Direkter Beweis für die Allgemein‐Rekursive Unlösbarkeit des Entscheidungsproblems des Prädikatenkalküls der Ersten Stufe mit Identität
• Decidable and undecidable fragments of first-order concatenation theory
• Undecidability without arithmetization
• Fregean Extensions of First‐Order Theories

Cites work

• On a consistent subsystem of Frege's Grundgesetze
• On the consistency of the first-order portion of Frege's logical system
• The Consistency of predicative fragments of frege’s grundgesetze der arithmetik

Cited in

(7)

• On the consistency of the first-order portion of Frege's logical system
• Decidable and undecidable fragments of first-order concatenation theory
• Undecidability without arithmetization
• On the consistency of the \(\Delta_1^1\)-CA fragment of Frege's Grundgesetze
• Frege, Boolos, and logical objects
• THE UNIVERSAL SET AND DIAGONALIZATION IN FREGE STRUCTURES
• The first-order theory of one-step rewriting is undecidable

This page was built for publication: First-order Frege theory is undecidable

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