Author:
Hayashi Daichi,Leigh Graham E.
Publisher
Springer Nature Switzerland
Reference23 articles.
1. Aschieri, F.: Learning, realizability and games in classical arithmetic. arXiv preprint arXiv:1012.4992 (2010)
2. Aschieri, F.: Interactive realizability for classical peano arithmetic with skolem axioms. In: Computer Science Logic 2012 (2012)
3. Avigad, J.: A realizability interpretation for classical arithmetic. In: Logic Colloquium, vol. 98, pp. 57–90 (2000)
4. Berger, U., Oliva, P.: Modified bar recursion and classical dependent choice. In: Logic Colloquium, vol. 1, pp. 89–107 (2005)
5. Blot, V.: Typed realizability for first-order classical analysis. Log. Methods Comput. Sci. 11 (2015)