Pages that link to "Item:Q2786136"
From MaRDI portal
The following pages link to Interactive Learning-Based Realizability for Heyting Arithmetic with EM1 (Q2786136):
Displayed 10 items.
- On natural deduction in classical first-order logic: Curry-Howard correspondence, strong normalization and Herbrand's theorem (Q265002) (← links)
- A constructive analysis of learning in Peano arithmetic (Q450942) (← links)
- Bar recursion over finite partial functions (Q515562) (← links)
- Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 5--11, 2017 (Q1731963) (← links)
- A universal algorithm for Krull's theorem (Q2672666) (← links)
- Well Quasi-orders and the Functional Interpretation (Q3295153) (← links)
- Computational Interpretations of Classical Reasoning: From the Epsilon Calculus to Stateful Programs (Q3305635) (← links)
- (Q4957788) (← links)
- GAME SEMANTICS AND THE GEOMETRY OF BACKTRACKING: A NEW COMPLEXITY ANALYSIS OF INTERACTION (Q4977225) (← links)
- Constructive forcing, CPS translations and witness extraction in Interactive realizability (Q5360214) (← links)