Classical combinatory logic

MaRDI QIDQ3576002zbMATH OpenFDO

Authors Karim Nour

Publication date 28 July 2010

Full work available at URL https://arxiv.org/abs/0905.1100, https://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAF0107/0.html

zbMATH Keywords

combinatory logiclambda-calculuspropositional classical logic

Mathematics Subject Classification ID

Classical propositional logic (03B05) Combinatory logic and lambda calculus (03B40) Functional programming and lambda calculus (68N18)

Abstract: Combinatory logic shows that bound variables can be eliminated without loss of expressiveness. It has applications both in the foundations of mathematics and in the implementation of functional programming languages. The original combinatory calculus corresponds to minimal implicative logic written in a system "`a la Hilbert". We present in this paper a combinatory logic which corresponds to propositional classical logic. This system is equivalent to the system $lambd{a}_{Prop}^{Sym}$ of Barbanera and Berardi.

Recommendations

• scientific article; zbMATH DE number 823591
• scientific article; zbMATH DE number 2038177
• scientific article; zbMATH DE number 1302066
• Combinator logics
• scientific article; zbMATH DE number 993359

Cited in

(6)

• Classical logic as limit completion
• scientific article; zbMATH DE number 5722460 (Why is no real title available?)
• scientific article; zbMATH DE number 2038177 (Why is no real title available?)
• First-order logic without bound variables: compositional semantics
• The Logic of Calculation
• scientific article; zbMATH DE number 496226 (Why is no real title available?)

This page was built for publication: Classical combinatory logic

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