On the algorithmic structure of dialectica realisers
From MaRDI portal
Cites work
- is for Dialectica
- \(\lambda\mu\)-calculus: an algorithmic interpretation of classical natural deduction
- A functional functional interpretation
- A metastable dominated convergence theorem
- An axiomatic basis for computer programming
- Applied Proof Theory: Proof Interpretations and Their Use in Mathematics
- Begründung des ``tertium non datur mittels der Hilbertschen Theorie der Widerspruchsfreiheit.
- Computational interpretations of classical reasoning: from the epsilon calculus to stateful programs
- Dialectica interpretation of well-founded induction
- Eine Variante zur Dialectica-Interpretation der Heyting-Arithmetik endlicher Typen
- Existential witness extraction in classical realizability and via a negative translation
- Functional interpretations of linear and intuitionistic logic
- General logical metatheorems for functional analysis
- Generalized learnability of stochastic principles
- Gödel's functional interpretation and the concept of learning
- scientific article; zbMATH DE number 5851813 (Why is no real title available?)
- scientific article; zbMATH DE number 7585096 (Why is no real title available?)
- Interactive learning-based realizability for Heyting arithmetic with \(\mathrm{EM}_1\)
- Local stability of ergodic averages
- Metamathematical investigation of intuitionistic arithmetic and analysis. With contributions by C. A. Smorynski, J. I. Zucker and W. A. Howard
- On quantitative convergence for stochastic processes: crossings, fluctuations and martingales
- On the computational content of the axiom of choice
- On the concurrent computational content of intermediate logics
- Program extraction from classical proofs
- Proof mining and probability theory
- PROOF-THEORETIC METHODS IN NONLINEAR ANALYSIS
- Proofs as stateful programs: A first-order logic with abstract Hoare triples, and an interpretation into an imperative language
- Some logical metatheorems with applications in functional analysis
- The Logic of Bunched Implications
- Unifying functional interpretations
- VERIFYING PROBABILISTIC PROGRAMS USING A HOARE LIKE LOGIC
- ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES
This page was built for publication: On the algorithmic structure of dialectica realisers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7445676)