Completeness proofs for propositional logic with polynomial-time connectives

&
Annals of Pure and Applied Logic 44 (1-2):39-52 (1989)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/0168-0072(89)90044-4

Other Versions

No versions found

Links

PhilArchive



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

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

On arithmetical completeness of the logic of proofs.Sohei Iwata & Taishi Kurahashi - 2019 - Annals of Pure and Applied Logic 170 (2):163-179.
On the computational content of intuitionistic propositional proofs.Samuel R. Buss & Pavel Pudlák - 2001 - Annals of Pure and Applied Logic 109 (1-2):49-64.
Addendum to “Choiceless polynomial time”.Andreas Blass, Yuri Gurevich & Saharon Shelah - 2001 - Annals of Pure and Applied Logic 112 (1):117.
Propositional proofs and reductions between NP search problems.Samuel R. Buss & Alan S. Johnson - 2012 - Annals of Pure and Applied Logic 163 (9):1163-1182.
Propositional consistency proofs.Samuel R. Buss - 1991 - Annals of Pure and Applied Logic 52 (1-2):3-29.
On the polynomial-space completeness of intuitionistic propositional logic.Vítězslav Švejdar - 2003 - Archive for Mathematical Logic 42 (7):711-716.
BLASS. A., A game semantics for linear logic CENZER, D. and REMMEL, J., Polynomial-time Abehan groups CLOTE, P. and TAKEUTI, G., Bounded arithmetic for NC, ALogTIME, L and NL. [REVIEW]P. Lincoln, J. Mitchell & A. Scedrov - 1992 - Annals of Pure and Applied Logic 56:365.
Logic of proofs.Sergei Artëmov - 1994 - Annals of Pure and Applied Logic 67 (1-3):29-59.
Decision problems for propositional linear logic.Patrick Lincoln, John Mitchell, Andre Scedrov & Natarajan Shankar - 1992 - Annals of Pure and Applied Logic 56 (1-3):239-311.
Non decomposable connectives of linear logic.Roberto Maieli - 2019 - Annals of Pure and Applied Logic 170 (11):102709.

Analytics

Added to PP
2014-01-16

Downloads
15 (#1,234,199)

6 months
8 (#587,211)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Semantical Analysis of Intuitionistic Logic I.Saul A. Kripke - 1963 - In Michael Dummett & J. N. Crossley (eds.), Formal Systems and Recursive Functions. Amsterdam,: North Holland. pp. 92-130.
On the Computational Complexity of Algorithms.J. Hartmanis & R. E. Stearns - 1967 - Journal of Symbolic Logic 32 (1):120-121.

Add more references