Lower bounds to the size of constant-depth propositional proofs (Q4292593): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Bounds for proof-search and speed-up in the predicate calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution proofs of generalized pigeonhole principles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Provability of the pigeonhole principle and the existence of infinitely many primes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intractability of resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The syntax and semantics of infinitary languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theory / rank
 
Normal rank

Latest revision as of 16:01, 22 May 2024

scientific article; zbMATH DE number 569552
Language Label Description Also known as
English
Lower bounds to the size of constant-depth propositional proofs
scientific article; zbMATH DE number 569552

    Statements

    Lower bounds to the size of constant-depth propositional proofs (English)
    0 references
    0 references
    0 references
    3 November 1994
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    lengths of proofs
    0 references
    propositional calculus
    0 references
    Frege system
    0 references
    Gentzen sequent calculus
    0 references
    propositional logic
    0 references
    pigeonhole principle
    0 references
    0 references