A proof-theoretic characterization of the basic feasible functionals

DOI10.1016/J.TCS.2004.08.009zbMATH Open1086.03044OpenAlexW1973440844MaRDI QIDQ706620FDOQ706620

Authors: Thomas Strahm 

Publication date: 9 February 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.08.009

Recommendations

• Some applications of logic to feasibility in higher types
• On characterizations of the basic feasible functionals. I
• scientific article; zbMATH DE number 1948174
• scientific article; zbMATH DE number 176200
• scientific article; zbMATH DE number 2110623

zbMATH Keywords

proof theoryapplicative theoriesbasic feasible functionalstype-two feasibility

Mathematics Subject Classification ID

Proof theory in general (including proof-theoretic semantics) (03F03) Higher-type and set recursion theory (03D65) Relative consistency and interpretations (03F25)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A new recursion-theoretic characterization of the polytime functions
• Higher type recursion, ramification and polynomial time
• Title not available (Why is that?)
• Constructivism in mathematics. An introduction. Volume II
• Title not available (Why is that?)
• Title not available (Why is that?)
• Theories with self-application and computational complexity.
• Title not available (Why is that?)
• Functional interpretations of feasibly constructive arithmetic
• Title not available (Why is that?)
• Polytime, combinatory logic and positive safe induction
• Title not available (Why is that?)
• Title not available (Why is that?)
• Polynomial and abstract subrecursive classes
• A foundational delineation of poly-time
• Semantics vs syntax vs computations: Machine models for type-2 polynomial-time bounded functionals
• On characterizations of the basic feasible functionals. I
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A new Characterization of Type-2 Feasibility
• Title not available (Why is that?)
• Logic and Computation

Cited In (11)

• Feasible functions over co-inductive data
• Realisability in weak systems of explicit mathematics
• Elementary explicit types and polynomial time operations
• On the proof theory of type two functionals based on primitive recursive operations
• A new model construction by making a detour via intuitionistic theories. I: Operational set theory without choice is \(\Pi_1\)-equivalent to KP
• On characterizations of the basic feasible functionals. I
• The provably terminating operations of the subsystem PETJ of explicit mathematics
• Some applications of logic to feasibility in higher types
• Theories with self-application and computational complexity.
• Primitive recursive selection functions for existential assertions over abstract algebras
• Title not available (Why is that?)

This page was built for publication: A proof-theoretic characterization of the basic feasible functionals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q706620)