DOAJ Open Access 2005

Classical Combinatory Logic

Karim Nour

Lihat Sumber DOI

Abstrak

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 "à la Hilbert''. We present in this paper a combinatory logic which corresponds to propositional classical logic. This system is equivalent to the system $λ ^{Sym}_{Prop}$ of Barbanera and Berardi.

Topik & Kata Kunci

Mathematics

Penulis (1)

Karim Nour

Format Sitasi

APA MLA BibTeX

Nour, K. (2005). Classical Combinatory Logic. https://doi.org/10.46298/dmtcs.3469

Akses Cepat

Lihat di Sumber doi.org/10.46298/dmtcs.3469

Informasi Jurnal

Tahun Terbit: 2005
Sumber Database: DOAJ
DOI: 10.46298/dmtcs.3469
Akses: Open Access ✓