Proof complexity of intuitionistic implicational formulas (Q331054): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.apal.2016.09.003 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W2211994174 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1512.05667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraizable logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3934450 / 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: Q3128959 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Admissible rules in the implication-negation fragment of intuitionistic logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: The separation theorem of intuitionist propositional calculus / 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: Frege systems for extensible modal logics / 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: Positive Formulas in Intuitionistic and Minimal Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856172 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5460922 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3924171 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.APAL.2016.09.003 / rank
 
Normal rank

Latest revision as of 14:34, 9 December 2024

scientific article
Language Label Description Also known as
English
Proof complexity of intuitionistic implicational formulas
scientific article

    Statements

    Identifiers

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