A reduction rule for Peirce formula

DOI10.1007/BF00372774MaRDI QIDQ1919985zbMATH OpenFDO

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

Recommendations

• A reduction-principle for infinite formulas
• Reduction and the trace formula
• On Schläfli's reduction formula
• On cut elimination in the presence of perice rule
• scientific article; zbMATH DE number 703171
• A reduction formula for the Kampé de Fériet function
• Reduction formula associated with Whittaker function
• On the density and the structure of the Peirce-like formulae
• Schläfli numbers and reduction formula
• Reduction formulae of Littlewood-Richardson coefficients

Cites work

• scientific article; zbMATH DE number 3959364 (Why is no real title available?)
• scientific article; zbMATH DE number 3993540 (Why is no real title available?)
• scientific article; zbMATH DE number 3275554 (Why is no real title available?)
• scientific article; zbMATH DE number 3358455 (Why is no real title available?)
• A reduction rule for Peirce formula

Cited in

(3)

• SK implementation of some data types
• A reduction rule for Peirce formula
• 1996–1997 Winter Meeting of the Association for Symbolic Logic

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)