A semantics of evidence for classical arithmetic
From MaRDI portal
Recommendations
Cited in
(44)- Toward the interpretation of non-constructive reasoning as non-monotonic learning
- Classical realizability in the CPS target language
- Getting results from programs extracted from classical proofs
- Dependent choice, `quote' and the clock
- Herbrand's theorem as higher order recursion
- A sequent calculus for limit computable mathematics
- Programming interfaces and basic topology
- On natural deduction in classical first-order logic: Curry-Howard correspondence, strong normalization and Herbrand's theorem
- A finitization of Littlewood's Tauberian theorem and an application in Tauberian remainder theory
- Sequential games and optimal strategies
- Computational interpretations of classical reasoning: from the epsilon calculus to stateful programs
- Gödel's Reformulation of Gentzen's First Consistency Proof For Arithmetic: The No-Counterexample Interpretation
- Realizability for Peano arithmetic with winning conditions in HON games
- Positive Arithmetic Without Exchange Is a Subclassical Logic
- A Calculus of Realizers for EM 1 Arithmetic (Extended Abstract)
- Semantics for Intuitionistic Arithmetic Based on Tarski Games with Retractable Moves
- Interactive Learning-Based Realizability Interpretation for Heyting Arithmetic with EM 1
- Between proof and truth
- Erratum to: ``Between proof and truth
- Imperative programs as proofs via game semantics
- Fluctuations, effective learnability and metastability in analysis
- Symmetry and Interactivity in Programming
- Propositional games with explicit strategies
- Game semantics and the geometry of backtracking: a new complexity analysis of interaction
- Lorenzen and constructive mathematics
- The true concurrency of Herbrand's theorem
- Semirings of Evidence
- Expansion trees with cut
- Program testing and the meaning explanations of intuitionistic type theory
- Classical realizability and arithmetical formulæ
- A New Translation for Semi-classical Theories — Backtracking without CPS
- Interactive realizability for second-order Heyting arithmetic with EM1 and SK1
- Dialogues and Proofs; Yankov’s Contribution to Proof Theory
- Game semantics of Martin-Löf type theory
- Totality in arena games
- Games with 1-backtracking
- Classical proof forestry
- A tale of additives and concurrency in game semantics
- On the reverse mathematics of cut-elimination and determinacy
- Generalized learnability of stochastic principles
- Non-elementary compression of first-order proofs in deep inference using epsilon-terms
- Dialogical logic and constructive type theory: new explorations
- Peano arithmetic, games and descent recursion
- Mathematics based on incremental learning -- excluded middle and inductive inference
This page was built for publication: A semantics of evidence for classical arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4836058)
