On lengths of proofs in non-classical logics (Q1006613): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.apal.2008.09.013 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.apal.2008.09.013 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2012102524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monotone circuit complexity of Boolean functions / 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: 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: Frege systems for extensible modal logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3758729 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.APAL.2008.09.013 / rank
 
Normal rank

Latest revision as of 12:28, 10 December 2024

scientific article
Language Label Description Also known as
English
On lengths of proofs in non-classical logics
scientific article

    Statements

    On lengths of proofs in non-classical logics (English)
    0 references
    0 references
    25 March 2009
    0 references
    In a pair of recent papers [J. Symb. Log. 72, No. 3, 941--958 (2007; Zbl 1125.03043)], [Ann. Pure Appl. Logic 146, No.~1, 72--90 (2007; Zbl 1115.03081)], the author proved a version of the feasible monotone interpolation property for some propositional proof systems of modal logic and intuitionistic logic, which implies an exponential lower bound for the systems in question. The original proof relied on a complicated model-theoretic construction. In the present paper, the author gives a considerably simpler proof of a more general feasible monotone interpolation theorem for K and intuitionistic logic, using a representation of modal axioms and rules by Horn clauses. The result implies exponential lower bounds on both the number of distributivity axioms and the number of necessitation rules in proofs of variants of the clique-coloring tautologies.
    0 references
    propositional proof complexity
    0 references
    feasible interpolation
    0 references
    modal logic
    0 references
    intuitionistic logic
    0 references

    Identifiers