Proof complexity of intuitionistic implicational formulas

Annals of Pure and Applied Logic 168 (1):150-190 (2017)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



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

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Uniqueness of normal proofs in implicational intuitionistic logic.Takahito Aoto - 1999 - Journal of Logic, Language and Information 8 (2):217-242.
Bi-Simulating in Bi-Intuitionistic Logic.Guillermo Badia - 2016 - Studia Logica 104 (5):1037-1050.
Linearizing intuitionistic implication.Patrick Lincoln, Andre Scedrov & Natarajan Shankar - 1993 - Annals of Pure and Applied Logic 60 (2):151-177.
Implicational f-structures and implicational relevance logics.A. Avron - 2000 - Journal of Symbolic Logic 65 (2):788-802.
Self-referentiality of Brouwer–Heyting–Kolmogorov semantics.Junhua Yu - 2014 - Annals of Pure and Applied Logic 165 (1):371-388.
Implicational formulas in intuitionistic logic.Alasdair Urquhart - 1974 - Journal of Symbolic Logic 39 (4):661-664.
Implicational complexity in intuitionistic arithmetic.Daniel Leivant - 1981 - Journal of Symbolic Logic 46 (2):240-248.
On the unity of logic.Jean-Yves Girard - 1993 - Annals of Pure and Applied Logic 59 (3):201-217.

Analytics

Added to PP
2016-09-22

Downloads
30 (#519,519)

6 months
8 (#342,364)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

Admissibility in Positive Logics.Alex Citkin - 2017 - Logica Universalis 11 (4):421-437.
On the proof complexity of logics of bounded branching.Emil Jeřábek - 2023 - Annals of Pure and Applied Logic 174 (1):103181.

Add more citations