A reduction rule for Peirce formula

DOI10.1007/BF00372774zbMATH Open0857.03004MaRDI QIDQ1919985FDOQ1919985

Sachio Hirokawa, Yuichi Komori, Izumi Takeuti

Publication date: 11 March 1997

Published in: Studia Logica (Search for Journal in Brave)

zbMATH Keywords

combinatory logicCurry-Howard isomorphismlambda calculusproof reductionreduction rulePeirce's lawclassical combinatorproofs of classical implicational logicweak normalization theorem

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Combinatory logic and lambda calculus (03B40)

Cites Work

• A reduction rule for Peirce formula
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (2)

• A reduction rule for Peirce formula
• 1996–1997 Winter Meeting of the Association for Symbolic Logic

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Reduction and the trace formula 👍 👎
• On Schläfli's reduction formula 👍 👎
• Reduction formulae of Littlewood-Richardson coefficients 👍 👎
• On cut elimination in the presence of perice rule 👍 👎
• A reduction formula for the Kampé de Fériet function 👍 👎
• Schläfli numbers and reduction formula 👍 👎
• A reduction-principle for infinite formulas 👍 👎

This page was built for publication: A reduction rule for Peirce formula

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