Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic (Q4358049): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.2307/2275541 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2044632231 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q106785017 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4735163 / 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 complexity of explicit definitions / 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
Property / cites work
 
Property / cites work: Linear reasoning. A new form of the Herbrand-Gentzen theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of cutting-plane proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every Prime Has a Succinct Certificate / 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: On the scheme of induction for bounded arithmetic formulas / 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: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tautologies with a unique Craig interpolant, uniform vs. nonuniform complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for the complexity of Craig's interpolants in sentential logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: On induction-free provability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantified propositional calculi and fragments of bounded arithmetic / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:09, 27 May 2024

scientific article; zbMATH DE number 1067264
Language Label Description Also known as
English
Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic
scientific article; zbMATH DE number 1067264

    Statements

    Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic (English)
    0 references
    0 references
    8 July 1998
    0 references
    Craig interpolation theorem
    0 references
    interpolant
    0 references
    circuit-size
    0 references
    communication complexity
    0 references
    proof systems
    0 references
    bounded arithmetic
    0 references
    exponential lower bounds
    0 references
    feasible monotone interpolation theorem
    0 references
    weak pigeonhole principle
    0 references

    Identifiers

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