A coinductive approach to proof search through typed lambda-calculi

, &
Annals of Pure and Applied Logic 172 (10):103026 (2021)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2021.103026

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,247

External links

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

Completeness for μ-calculi: A coalgebraic approach.Sebastian Enqvist, Fatemeh Seifan & Yde Venema - 2019 - Annals of Pure and Applied Logic 170 (5):578-641.
Inductive types and type constraints in the second-order lambda calculus.Nax Paul Mendler - 1991 - Annals of Pure and Applied Logic 51 (1-2):159-172.
Strong Normalizability of Typed Lambda-Calculi for Substructural Logics.Motohiko Mouri & Norihiro Kamide - 2008 - Logica Universalis 2 (2):189-207.
Weak typed Böhm theorem on IMLL.Satoshi Matsuoka - 2007 - Annals of Pure and Applied Logic 145 (1):37-90.
Towards NP – P via proof complexity and search.Samuel R. Buss - 2012 - Annals of Pure and Applied Logic 163 (7):906-917.
Linear realizability and full completeness for typed lambda-calculi.Samson Abramsky & Marina Lenisa - 2005 - Annals of Pure and Applied Logic 134 (2-3):122-168.
Typed Lambda calculi. S. Abramsky et AL.H. P. Barendregt - 1992 - In S. Abramsky, D. Gabbay & T. Maibaurn (eds.), Handbook of Logic in Computer Science. Oxford University Press. pp. 117--309.
Ordinals and ordinal functions representable in the simply typed lambda calculus.N. Danner - 1999 - Annals of Pure and Applied Logic 97 (1-3):179-201.
On the semantics of the universal quantifier.Djordje Ubri - 1997 - Annals of Pure and Applied Logic 87 (3):209-239.
On the semantics of the universal quantifier.Djordje Čubrić - 1997 - Annals of Pure and Applied Logic 87 (3):209-239.

Analytics

Added to PP
2021-08-28

Downloads
29 (#774,799)

6 months
5 (#1,039,842)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Luis Pinto De Sa
Saint Louis University

Citations of this work

No citations found.

Add more citations

References found in this work

Reductive logic and proof-search: proof theory, semantics, and control.David J. Pym - 2004 - New York: Oxford University Press. Edited by Eike Ritter.
Counting proofs in propositional logic.René David & Marek Zaionc - 2009 - Archive for Mathematical Logic 48 (2):185-199.

Add more references