Analytic proof systems for λ-calculus: the elimination of transitivity, and why it matters

ISSN： 0933-5846

Source： Archive for Mathematical Logic, Vol.46, Iss.5-6, 2007-07, pp. : 385-424

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

A proof-theoretic treatment of λ-reduction with cut-elimination: λ-calculus as a logic programming language

The Journal of Symbolic Logic, Vol. 76, Iss. 2, 2011-06 ,pp. : 673-699

Cambridge University Press

Access to resources Recommend Favorite

The λ-calculus is ω-incomplete

The Journal of Symbolic Logic, Vol. 39, Iss. 2, 1974-06 ,pp. : 313-317

Cambridge University Press

Access to resources Recommend Favorite

Analytic combinatory calculi and the elimination of transitivity

By Minari Pierluigi

Archive for Mathematical Logic, Vol. 43, Iss. 2, 2004-02 ,pp. : 159-191

Springer Publishing Company

Access to resources Recommend Favorite

Exact bounds for lengths of reductions in typed λ-calculus

The Journal of Symbolic Logic, Vol. 66, Iss. 3, 2001-09 ,pp. : 1277-1285

Cambridge University Press

Access to resources Recommend Favorite

The interpretation of unsolvable λ-terms in models of untyped λ-calculus

The Journal of Symbolic Logic, Vol. 63, Iss. 4, 1998-12 ,pp. : 1529-1548

Cambridge University Press

Access to resources Recommend Favorite