Polynomial time operations in explicit mathematics (Q4358055): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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/2275547 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2119127687 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Totality in applicative theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructivism in mathematics. An introduction. Volume I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymmetric Interpretations for Bounded Theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3679172 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A feasible theory for analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Systems of explicit mathematics with non-constructive \(\mu\)-operator. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hilbert's program relativized; Proof-theoretical and foundational reductions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Functional interpretations of feasibly constructive arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146722 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:09, 27 May 2024

scientific article; zbMATH DE number 1067270
Language Label Description Also known as
English
Polynomial time operations in explicit mathematics
scientific article; zbMATH DE number 1067270

    Statements

    Polynomial time operations in explicit mathematics (English)
    0 references
    0 references
    28 September 1997
    0 references
    polytime computation
    0 references
    polynomial time computable arithmetic
    0 references
    self-applicative operations
    0 references
    provably total functions
    0 references
    proof-theoretic strength
    0 references
    Grzegorczyk classes
    0 references

    Identifiers

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