Pages that link to "Item:Q3739119"
From MaRDI portal
The following pages link to Strong normalization of barrecursive terms without using infinite terms (Q3739119):
Displaying 4 items.
- Strong normalization theorem for a constructive arithmetic with definition by transfinite recursion and bar induction (Q1130232) (← links)
- On the computational content of the axiom of choice (Q4212925) (← links)
- A DIRECT PROOF OF SCHWICHTENBERG’S BAR RECURSION CLOSURE THEOREM (Q4638975) (← links)
- (Q5129941) (← links)