On the proof complexity of logics of bounded branching

Annals of Pure and Applied Logic 174 (1):103181 (2023)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2022.103181

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,779

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

Proof complexity of substructural logics.Raheleh Jalali - 2021 - Annals of Pure and Applied Logic 172 (7):102972.
Bounded arithmetic, proof complexity and two papers of Parikh.Samuel R. Buss - 1999 - Annals of Pure and Applied Logic 96 (1-3):43-55.
Bounded linear-time temporal logic: A proof-theoretic investigation.Norihiro Kamide - 2012 - Annals of Pure and Applied Logic 163 (4):439-466.
The bounded proof property via step algebras and step frames.Nick Bezhanishvili & Silvio Ghilardi - 2014 - Annals of Pure and Applied Logic 165 (12):1832-1863.
Proof Theory and Logical Complexity. [REVIEW]Helmut Pfeifer - 1991 - Annals of Pure and Applied Logic 53 (4):197.
Bounded-depth Frege complexity of Tseitin formulas for all graphs.Nicola Galesi, Dmitry Itsykson, Artur Riazanov & Anastasia Sofronova - 2023 - Annals of Pure and Applied Logic 174 (1):103166.
On the complexity of finding the chromatic number of a recursive graph I: the bounded case.Richard Beigel & William I. Gasarch - 1989 - Annals of Pure and Applied Logic 45 (1):1-38.
Proof complexity of intuitionistic implicational formulas.Emil Jeřábek - 2017 - Annals of Pure and Applied Logic 168 (1):150-190.
Computational complexity of hybrid interval temporal logics.Przemysław Andrzej Wałęga - 2023 - Annals of Pure and Applied Logic 174 (1):103165.
Algebraic proof theory for substructural logics: cut-elimination and completions.Agata Ciabattoni, Nikolaos Galatos & Kazushige Terui - 2012 - Annals of Pure and Applied Logic 163 (3):266-290.

Analytics

Added to PP
2022-07-28

Downloads
18 (#825,698)

6 months
6 (#701,066)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

Modal Logic.Yde Venema, Alexander Chagrov & Michael Zakharyaschev - 2000 - Philosophical Review 109 (2):286.
Independent bases of admissible rules.Emil Jerábek - 2008 - Logic Journal of the IGPL 16 (3):249-267.

View all 17 references / Add more references