Ordinal notations and well-orderings in bounded arithmetic (Q1861331): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Chris Pollett / rank
Normal rank
 
Property / author
 
Property / author: Chris Pollett / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5691043 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Notations for exponentiation. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3476809 / 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: Systems of predicative analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Systems of predicative analysis, II: Representations of ordinals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5286672 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How easy is local search? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856172 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof theory. An introduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4143279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140643 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:47, 5 June 2024

scientific article
Language Label Description Also known as
English
Ordinal notations and well-orderings in bounded arithmetic
scientific article

    Statements

    Ordinal notations and well-orderings in bounded arithmetic (English)
    0 references
    0 references
    0 references
    0 references
    16 March 2003
    0 references
    0 references
    0 references
    0 references
    0 references
    ordinal notations
    0 references
    well-foundedness
    0 references
    bounded arithmetic
    0 references
    fragments of Peano arithmetic
    0 references
    polynomial local search
    0 references