Pages that link to "Item:Q3722497"
From MaRDI portal
The following pages link to Syntactic translations and provably recursive functions (Q3722497):
Displayed 13 items.
- Intuitionistic completeness of first-order logic (Q392280) (← links)
- Functional interpretations of feasibly constructive arithmetic (Q685962) (← links)
- Provably recursive functions of constructive and relatively constructive theories (Q964451) (← links)
- Strong normalization from weak normalization in typed \(\lambda\)-calculi (Q1357009) (← links)
- A note on the independence of premiss rule (Q2793909) (← links)
- Strictly primitive recursive realizability, I (Q4323037) (← links)
- A-translation and looping combinators in pure type systems (Q4764266) (← links)
- Minimal readability of intuitionistic arithmetic and elementary analysis (Q4876321) (← links)
- Refined program extraction from classical proofs (Q5957850) (← links)
- Decidable variables for constructive logics (Q6047667) (← links)
- Program extraction from classical proofs (Q6064277) (← links)
- Intrinsic theories and computational complexity (Q6064281) (← links)
- EXTENDED FRAMES AND SEPARATIONS OF LOGICAL PRINCIPLES (Q6072335) (← links)