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

From MaRDI portal
Added link to MaRDI item.
Import recommendations run Q6534273
 
(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
Property / Recommended article
 
Property / Recommended article: Q4856172 / rank
 
Normal rank
Property / Recommended article: Q4856172 / qualifier
 
Similarity Score: 0.86614114
Amount0.86614114
Unit1
Property / Recommended article: Q4856172 / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q4850552 / rank
 
Normal rank
Property / Recommended article: Q4850552 / qualifier
 
Similarity Score: 0.85882246
Amount0.85882246
Unit1
Property / Recommended article: Q4850552 / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q4357061 / rank
 
Normal rank
Property / Recommended article: Q4357061 / qualifier
 
Similarity Score: 0.85556066
Amount0.85556066
Unit1
Property / Recommended article: Q4357061 / qualifier
 
Property / Recommended article
 
Property / Recommended article: Witnessing functions in bounded arithmetic and search problems / rank
 
Normal rank
Property / Recommended article: Witnessing functions in bounded arithmetic and search problems / qualifier
 
Similarity Score: 0.8507113
Amount0.8507113
Unit1
Property / Recommended article: Witnessing functions in bounded arithmetic and search problems / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q4818823 / rank
 
Normal rank
Property / Recommended article: Q4818823 / qualifier
 
Similarity Score: 0.82817847
Amount0.82817847
Unit1
Property / Recommended article: Q4818823 / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q4263835 / rank
 
Normal rank
Property / Recommended article: Q4263835 / qualifier
 
Similarity Score: 0.81822217
Amount0.81822217
Unit1
Property / Recommended article: Q4263835 / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q5874190 / rank
 
Normal rank
Property / Recommended article: Q5874190 / qualifier
 
Similarity Score: 0.8116934
Amount0.8116934
Unit1
Property / Recommended article: Q5874190 / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q4893137 / rank
 
Normal rank
Property / Recommended article: Q4893137 / qualifier
 
Similarity Score: 0.8114482
Amount0.8114482
Unit1
Property / Recommended article: Q4893137 / qualifier
 
Property / Recommended article
 
Property / Recommended article: On the complexity of arithmetical interpretations of modal formulae / rank
 
Normal rank
Property / Recommended article: On the complexity of arithmetical interpretations of modal formulae / qualifier
 
Similarity Score: 0.8084678
Amount0.8084678
Unit1
Property / Recommended article: On the complexity of arithmetical interpretations of modal formulae / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q5465359 / rank
 
Normal rank
Property / Recommended article: Q5465359 / qualifier
 
Similarity Score: 0.8035556
Amount0.8035556
Unit1
Property / Recommended article: Q5465359 / qualifier
 

Latest revision as of 20:13, 27 January 2025

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