Polynomially and superexponentially shorter proofs in fragments of arithmetic (Q4032866): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.2307/2275435 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2039356064 / rank
 
Normal rank

Revision as of 00:45, 20 March 2024

scientific article
Language Label Description Also known as
English
Polynomially and superexponentially shorter proofs in fragments of arithmetic
scientific article

    Statements

    Polynomially and superexponentially shorter proofs in fragments of arithmetic (English)
    0 references
    0 references
    1 April 1993
    0 references
    fragments of arithmetic
    0 references
    provability logic
    0 references
    speed-up
    0 references
    modal logic
    0 references
    lengths of proofs
    0 references

    Identifiers

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