Pages that link to "Item:Q1427856"

The following pages link to Theories with self-application and computational complexity. (Q1427856):

Displaying 11 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)
• A proof-theoretic characterization of the basic feasible functionals (Q706620) (← links)
• Primitive recursive selection functions for existential assertions over abstract algebras (Q941429) (← links)
• Implicit recursion-theoretic characterizations of counting classes (Q2085583) (← links)
• Applicative theories for logarithmic complexity classes (Q2346995) (← links)
• Remarks on applicative theories (Q2566067) (← links)
• A feasible theory of truth over combinatory algebra (Q2637706) (← links)
• Realisability in weak systems of explicit mathematics (Q3107339) (← links)
• About Truth and Types (Q3305551) (← links)
• Elementary explicit types and polynomial time operations (Q3632522) (← links)