Pages that link to "Item:Q685962"

The following pages link to Functional interpretations of feasibly constructive arithmetic (Q685962):

Displaying 38 items.

• Realizability models and implicit complexity (Q534712) (← links)
• A complexity analysis of functional interpretations (Q557798) (← links)
• Polynomial-time Martin-Löf type theory (Q688850) (← links)
• A proof-theoretic characterization of the basic feasible functionals (Q706620) (← links)
• Two algorithms in search of a type-system (Q733753) (← links)
• The basic feasible functionals in computable analysis (Q864439) (← links)
• Bounded functional interpretation and feasible analysis (Q866559) (← links)
• Preservation theorems for bounded formulas (Q866887) (← links)
• Provably recursive functions of constructive and relatively constructive theories (Q964451) (← links)
• A semantic proof of polytime soundness of light affine logic (Q987375) (← links)
• Semantics vs syntax vs computations: Machine models for type-2 polynomial-time bounded functionals (Q1362334) (← links)
• A tight relationship between generic oracles and type-2 complexity theory (Q1369098) (← links)
• On parallel hierarchies and \(R_k^i\) (Q1377627) (← links)
• A second-order system for polytime reasoning based on Grädel's theorem. (Q1412837) (← links)
• Theories with self-application and computational complexity. (Q1427856) (← links)
• Tractability of cut-free Gentzen-type propositional calculus with permutation inference. II (Q1575637) (← links)
• On the computational complexity of Longley's \(H\) functional (Q1827400) (← links)
• Saturated models of universal theories (Q1861531) (← links)
• Type-two polynomial-time and restricted lookahead (Q1989320) (← links)
• Game semantics approach to higher-order complexity (Q2396718) (← links)
• Logics for reasoning about cryptographic constructions (Q2490263) (← links)
• A feasible theory of truth over combinatory algebra (Q2637706) (← links)
• Interpreting classical theories in constructive ones (Q2710607) (← links)
• 2000 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium 2000 (Q2732529) (← links)
• Feasible functionals and intersection of ramified types (Q2842842) (← links)
• TWO (OR THREE) NOTIONS OF FINITISM (Q3550708) (← links)
• 2006 Annual Meeting of the Association for Symbolic Logic (Q3594488) (← links)
• Elementary explicit types and polynomial time operations (Q3632522) (← links)
• Polynomial time operations in explicit mathematics (Q4358055) (← links)
• An Application of Category-Theoretic Semantics to the Characterisation of Complexity Classes Using Higher-Order Function Algebras (Q4382502) (← links)
• 2003 Annual Meeting of the Association for Symbolic Logic (Q4678936) (← links)
• CONSISTENCY PROOF OF A FRAGMENT OF PV WITH SUBSTITUTION IN BOUNDED ARITHMETIC (Q4692080) (← links)
• A Logical Autobiography (Q5027230) (← links)
• (Q5094117) (← links)
• Graded multicategories of polynomial-time realizers (Q5096260) (← links)
• Ramified Corecurrence and Logspace (Q5739361) (← links)
• Implicit computation complexity in higher-order programming languages (Q5875893) (← links)
• Proof Complexity of Non-classical Logics (Q5894972) (← links)