A proof-theoretic characterization of the basic feasible functionals (Q706620): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3342534 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3679172 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3757915 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new recursion-theoretic characterization of the polytime functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Higher type recursion, ramification and polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3800030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5702663 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polytime, combinatory logic and positive safe induction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4934292 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035304 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Functional interpretations of feasibly constructive arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4128540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3882452 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3773876 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4722037 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On characterizations of the basic feasible functionals, Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new Characterization of Type-2 Feasibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: A foundational delineation of poly-time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501154 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4850553 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411835 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial and abstract subrecursive classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4218943 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semantics vs syntax vs computations: Machine models for type-2 polynomial-time bounded functionals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theories with self-application and computational complexity. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructivism in mathematics. An introduction. Volume II / rank
 
Normal rank

Revision as of 16:55, 7 June 2024

scientific article
Language Label Description Also known as
English
A proof-theoretic characterization of the basic feasible functionals
scientific article

    Statements

    A proof-theoretic characterization of the basic feasible functionals (English)
    0 references
    0 references
    9 February 2005
    0 references
    basic feasible functionals
    0 references
    applicative theories
    0 references
    proof theory
    0 references
    type-two feasibility
    0 references

    Identifiers