A Calculus of Realizers for EM 1 Arithmetic (Extended Abstract)

DOI10.1007/978-3-540-87531-4_17zbMath1156.03333OpenAlexW1510765443MaRDI QIDQ3540181

Stefano Berardi, Ugo de'Liguoro

Publication date: 20 November 2008

Published in: Computer Science Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-87531-4_17

Mathematics Subject Classification ID

Computational learning theory (68Q32) First-order arithmetic and fragments (03F30)

Related Items (3)

Unnamed Item ⋮ Constructive forcing, CPS translations and witness extraction in Interactive realizability ⋮ Interactive Learning-Based Realizability Interpretation for Heyting Arithmetic with EM 1

Cites Work

• The epsilon calculus and Herbrand complexity
• Mathematics based on incremental learning -- excluded middle and inductive inference
• Constructivism in mathematics. An introduction. Volume II
• Dependent choice, `quote' and the clock
• Strong termination for the epsilon substitution method
• Iterated Limiting Recursion and the Program Minimization Problem
• A semantics of evidence for classical arithmetic
• Limiting recursion
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Calculus of Realizers for EM 1 Arithmetic (Extended Abstract)