Analytic Equational Proof Systems for Combinatory Logic and λ-Calculus:A Survey

In Stefania Centrone, Sara Negri, Deniz Sarikaya & Peter M. Schuster (eds.), Mathesis Universalis, Computability and Proof. Cham, Switzerland: Springer Verlag (2019)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Add categories

Keywords

Reprint years

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,322

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

A solution to Curry and Hindley’s problem on combinatory strong reduction.Pierluigi Minari - 2009 - Archive for Mathematical Logic 48 (2):159-184.
Analytic proof systems for λ-calculus: the elimination of transitivity, and why it matters. [REVIEW]Pierluigi Minari - 2007 - Archive for Mathematical Logic 46 (5-6):385-424.
Analytic combinatory calculi and the elimination of transitivity.Pierluigi Minari - 2004 - Archive for Mathematical Logic 43 (2):159-191.
A Normalization Procedure For The Equational Fragment Of Labelled Natural Deduction.A. de Oliveira & R. B. de Queiroz - 1999 - Logic Journal of the IGPL 7 (2):173-215.
The Church-Rosser Property in Symmetric Combinatory Logic.Katalin Bimbó - 2005 - Journal of Symbolic Logic 70 (2):536 - 556.
A Hilbert-Style Axiomatisation for Equational Hybrid Logic.Luís S. Barbosa, Manuel A. Martins & Marta Carreteiro - 2014 - Journal of Logic, Language and Information 23 (1):31-52.
Strong Reduction of Combinatory Calculus with Streams.Koji Nakazawa & Hiroto Naya - 2015 - Studia Logica 103 (2):375-387.
Polynomial ring calculus for modal logics: A new semantics and proof method for modalities: Polynomial ring calculus for modal logics.Juan C. Agudelo - 2011 - Review of Symbolic Logic 4 (1):150-170.
Intuitionistic Logic according to Dijkstra's Calculus of Equational Deduction.Jaime Bohórquez V. - 2008 - Notre Dame Journal of Formal Logic 49 (4):361-384.
Completeness of two systems of illative combinatory logic for first-order propositional and predicate calculus.Wil Dekkers, Martin Bunder & Henk Barendregt - 1998 - Archive for Mathematical Logic 37 (5-6):327-341.
Equivalences between Pure Type Systems and Systems of Illative Combinatory Logic.M. W. Bunder & W. J. M. Dekkers - 2005 - Notre Dame Journal of Formal Logic 46 (2):181-205.
Combinatory reduction systems.Jan Willem Klop - 1980 - Amsterdam: Mathematisch centrum.
Systems of illative combinatory logic complete for first-order propositional and predicate calculus.Henk Barendregt, Martin Bunder & Wil Dekkers - 1993 - Journal of Symbolic Logic 58 (3):769-788.
Arithmetic based on the church numerals in illative combinatory logic.M. W. Bunder - 1988 - Studia Logica 47 (2):129 - 143.
Semantics and Proof Theory of the Epsilon Calculus.Richard Zach - 2017 - In Ghosh Sujata & Prasad Sanjiva (eds.), Logic and Its Applications. ICLA 2017. Springer. pp. 27-47.

Analytics

Added to PP
2019-10-26

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Author's Profile

Pierluigi Minari
Università degli Studi di Firenze

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references