Pages that link to "Item:Q3107339"

The following pages link to Realisability in weak systems of explicit mathematics (Q3107339):

Displaying 3 items.

• Admissible closures of polynomial time computable arithmetic (Q634777) (← links)
• The provably terminating operations of the subsystem PETJ of explicit mathematics (Q639690) (← links)
• A feasible theory of truth over combinatory algebra (Q2637706) (← links)