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: 92,261

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

Branching-time logics repeatedly referring to states.Volker Weber - 2009 - Journal of Logic, Language and Information 18 (4):593-624.
Substitution Frege and extended Frege proof systems in non-classical logics.Emil Jeřábek - 2009 - Annals of Pure and Applied Logic 159 (1-2):1-48.
Upper bounds on complexity of Frege proofs with limited use of certain schemata.Pavel Naumov - 2006 - Archive for Mathematical Logic 45 (4):431-446.
A Modal View on Resource-Bounded Propositional Logics.Pere Pardo - 2022 - Studia Logica 110 (4):1035-1080.
Hybrid logics with infinitary proof systems.Rineke Verbrugge, Gerard Renardel de Lavalette & Barteld Kooi - unknown
Bounded arithmetic, propositional logic, and complexity theory.Jan Krajíček - 1995 - New York, NY, USA: Cambridge University Press.
Complexity of admissible rules.Emil Jeřábek - 2007 - Archive for Mathematical Logic 46 (2):73-92.
Sequent Calculi and Interpolation for Non-Normal Modal and Deontic Logics.Eugenio Orlandelli - forthcoming - Logic and Logical Philosophy:1.
Displaying and deciding substructural logics 1: Logics with contraposition.Greg Restall - 1998 - Journal of Philosophical Logic 27 (2):179-216.
Measuring inconsistency in some branching time logics.John Grant - 2021 - Journal of Applied Non-Classical Logics 31 (2):85-107.
Technical report tr-Arp-11-94.Greg Restall - unknown
Approximate counting by hashing in bounded arithmetic.Emil Jeřábek - 2009 - Journal of Symbolic Logic 74 (3):829-860.
Labelled non-classical logics.Luca Viganò - 2000 - Boston: Kluwer Academic Publishers.
Completeness of a Branching-Time Logic with Possible Choices.Roberto Ciuni & Alberto Zanardo - 2010 - Studia Logica 96 (3):393-420.
On the Mosaic Method for Many-Dimensional Modal Logics: A Case Study Combining Tense and Modal Operators. [REVIEW]Carlos Caleiro, Luca Viganò & Marco Volpe - 2013 - Logica Universalis 7 (1):33-69.

Analytics

Added to PP
2022-07-28

Downloads
16 (#911,065)

6 months
5 (#648,432)

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