Boolean programs and quantified propositional proof systems

&
Bulletin of the Section of Logic 28 (3):119-129 (1999)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Other Versions

No versions found

Links

PhilArchive



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

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

Propositional consistency proofs.Samuel R. Buss - 1991 - Annals of Pure and Applied Logic 52 (1-2):3-29.
Simulating non-prenex cuts in quantified propositional calculus.Emil Jeřábek & Phuong Nguyen - 2011 - Mathematical Logic Quarterly 57 (5):524-532.
Stephen Cook and Phuong Nguyen. Logical foundations of proof complexity. Perspectives in Logic. Cambridge University Press, New York, 2010, 15 + 479 pp. [REVIEW]Albert Atserias - 2011 - Bulletin of Symbolic Logic 17 (3):462-464.
Meaning is Use: the Case of Propositional Identity.Leonard Kupś & Szymon Chlebowski - 2024 - Bulletin of the Section of Logic 53 (3):275-299.
An Admissible Semantics for Propositionally Quantified Relevant Logics.Robert Goldblatt & Michael Kane - 2010 - Journal of Philosophical Logic 39 (1):73-100.
Functional Completeness in CPL via Correspondence Analysis.Dorota Leszczyńska-Jasion, Yaroslav Petrukhin, Vasilyi Shangin & Marcin Jukiewicz - 2019 - Bulletin of the Section of Logic 48 (1).
A Uniform Method Of Proof Of The Completeness Theorem For The Equivalential Propositional Calculus And For Some Of Its Extentions.Stanislaw Surma - 1972 - Bulletin of the Section of Logic 1 (1):53-62.
Suszko's contribution to the theory of nonaxiomatic proof systems.Andrzej Indrzejczak - 2009 - Bulletin of the Section of Logic 38 (3/4):151-161.
A Survey Of Minor Wajsberg's Results Concerning Fragmentary Systems Of The Classical Propositional Calculus.Teodor Stepien - 1973 - Bulletin of the Section of Logic 2 (2):103-106.
Review: Michael Alekhnovich, Sam Buss, Shlomo Moran, Toniann Pitassi, Minimum Propositional Proof Length Is NP-Hard to Linearly Approximate. [REVIEW]Alexander Razborov - 2002 - Bulletin of Symbolic Logic 8 (2):301-302.

Analytics

Added to PP
2014-01-19

Downloads
8 (#1,588,140)

6 months
8 (#613,944)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Sprague–Grundy theory in bounded arithmetic.Satoru Kuroda - 2021 - Archive for Mathematical Logic 61 (1):233-262.

Add more citations

References found in this work

Add more references