A Characterisation of Definable NP Search Problems in Peano Arithmetic (Q3638270): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-642-02261-6_1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W122675930 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of cut-reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: POLYNOMIAL LOCAL SEARCH IN THE POLYNOMIAL HIERARCHY AND WITNESSING IN FRAGMENTS OF BOUNDED ARITHMETIC / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3081638 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordinal notations and well-orderings in bounded arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Application of Boolean Complexity to Separation Problems in Bounded Arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Notation systems for infinitary derivations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4364500 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5556414 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How easy is local search? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079564 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fragments of Bounded Arithmetic and Bounded Query Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP search problems in low fragments of bounded arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite investigations of transfinite derivations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof theory. The first step into impredicativity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure and definability in general bounded arithmetic theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5477362 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3689182 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The provably total search problems of bounded arithmetic / rank
 
Normal rank

Latest revision as of 18:41, 1 July 2024

scientific article
Language Label Description Also known as
English
A Characterisation of Definable NP Search Problems in Peano Arithmetic
scientific article

    Statements

    A Characterisation of Definable NP Search Problems in Peano Arithmetic (English)
    0 references
    0 references
    2 July 2009
    0 references
    0 references
    0 references