Pages that link to "Item:Q2776806"
From MaRDI portal
The following pages link to Update procedures and the 1-consistency of arithmetic (Q2776806):
Displaying 11 items.
- A constructive analysis of learning in Peano arithmetic (Q450942) (← links)
- Bar recursion over finite partial functions (Q515562) (← links)
- The epsilon calculus and Herbrand complexity (Q817706) (← links)
- Ackermann's substitution method (remixed) (Q2503393) (← links)
- Computational Interpretations of Classical Reasoning: From the Epsilon Calculus to Stateful Programs (Q3305635) (← links)
- Gödel's Reformulation of Gentzen's First Consistency Proof For Arithmetic: The No-Counterexample Interpretation (Q3370623) (← links)
- Interactive Learning-Based Realizability Interpretation for Heyting Arithmetic with EM 1 (Q3637184) (← links)
- Updateable Inner Product Argument with Logarithmic Verifier and Applications (Q5041169) (← links)
- Constructive forcing, CPS translations and witness extraction in Interactive realizability (Q5360214) (← links)
- Interactive Realizability for second-order Heyting arithmetic with EM1 and SK1 (Q5740401) (← links)
- Herbrand complexity and the epsilon calculus with equality (Q6178471) (← links)