Pages that link to "Item:Q706620"

The following pages link to A proof-theoretic characterization of the basic feasible functionals (Q706620):

Displaying 6 items.

• A new model construction by making a detour via intuitionistic theories. I: Operational set theory without choice is \(\Pi_1\)-equivalent to KP (Q476116) (← links)
• The provably terminating operations of the subsystem PETJ of explicit mathematics (Q639690) (← links)
• Primitive recursive selection functions for existential assertions over abstract algebras (Q941429) (← links)
• Theories with self-application and computational complexity. (Q1427856) (← links)
• Type-two polynomial-time and restricted lookahead (Q1989320) (← links)
• Realisability in weak systems of explicit mathematics (Q3107339) (← links)