On the proof complexity of logics of bounded branching (Q2084964): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.apal.2022.103181 / rank
Normal rank
 
Property / Wikidata QID
 
Property / Wikidata QID: Q113880314 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the disjunction and existential properties in intuitionistic logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational content of intuitionistic propositional proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4723713 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128959 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relative efficiency of propositional proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of the disjunction property in intuitionistic and modal logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sequence of decidable finitely axiomatizable intermediate logics with the disjunction property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for modal logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for intuitionistic logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: On lengths of proofs in non-classical logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual weak pigeonhole principle, Boolean complexity, and derandomization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Frege systems for extensible modal logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent Bases of Admissible Rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Substitution Frege and extended Frege proof systems in non-classical logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rules with parameters in modal logic. I. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof complexity of intuitionistic implicational formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rules with parameters in modal logic. II. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Computational Complexity of Provability in Systems of Modal Propositional Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5460922 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On reducibility and symmetry of disjoint NP pairs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: INCOMPLETENESS IN THE FINITE DOMAIN / rank
 
Normal rank
Property / cites work
 
Property / cites work: Admissibility of logical inference rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5668435 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.APAL.2022.103181 / rank
 
Normal rank

Latest revision as of 00:23, 17 December 2024

scientific article
Language Label Description Also known as
English
On the proof complexity of logics of bounded branching
scientific article

    Statements

    On the proof complexity of logics of bounded branching (English)
    0 references
    0 references
    14 October 2022
    0 references
    proof complexity
    0 references
    modal logic
    0 references
    intermediate logic
    0 references
    extended Frege system
    0 references
    disjunction property
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references