Computer implication and the Curry paradox

DOI10.1023/B:LOGI.0000046077.72722.61MaRDI QIDQ704044zbMATH OpenFDO

Authors Wayne Aitken, Jeffrey A. Barrett

Publication date 12 January 2005

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

Full work available at URL https://doi.org/10.1023/B:LOGI.0000046077.72722.61

zbMATH Keywords

Curry paradoxmodus ponensnatural inferencetheorem-proving programs

Mathematics Subject Classification ID

Philosophical and critical aspects of logic and foundations (03A05) Mechanization of proofs and logical operations (03B35) Undecidability and degrees of sets of sentences (03D35)

Review text

Turing's classical ``Halting Problem is an early example of a serious limitation on the capabilities of any general computer. In this note, the authors discuss a weaker computational limitation, viz., on the strength of computational (natural) inference and even theorem-proving. They defend the assertion that no sufficiently powerful inference program can successfully use an unrestricted form of modus ponens. Their argument parallels the very approach used in formulation of the classical Curry paradox. The source of their paradox seems to be the misuse of modus ponens, i.e., the unrestricted use of modus ponens. However, Myhill has already suggested that modus ponens is even the source of the classical Curry paradox itself [\textit{J. Myhill}, ``Paradoxes, Synthese 60, No. 1, 129--143 (1984; MR 86g:03008)].

Recommendations

• Natural deduction and Curry's paradox
• A Mechanical Proof of the Unsolvability of the Halting Problem
• Stability and paradox in algorithmic logic
• scientific article; zbMATH DE number 790192
• scientific article; zbMATH DE number 63607

Cites work

• scientific article; zbMATH DE number 3315161 (Why is no real title available?)
• The inconsistency of certain formal logics

Cited in

(4)

• Abstraction in algorithmic logic
• Variations on a theme of Curry
• Abstraction in Fitch's basic logic
• Stability and paradox in algorithmic logic

This page was built for publication: Computer implication and the Curry paradox

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