Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. Akama, Y., Berardi, S., Hayashi, S., Kohlenbach, U.: An Arithmetical Hierarchy of the Law of Excluded Middle and Related Principles. In: Proceedings of IEEE Symposium on Logic in Computer Science (LICS), pp. 192–201 (2004)
2. Kobayashi, S., Tatsuta, M.: Realizability Interpretation of Generalized Inductive Definitions. Theoretical Computer Science 131(1), 121–138 (1994)
3. Kobayashi, S.: Kyoukugen Keisan Kanou Suugaku no Geimu Imiron (English title: Game Semantics of Limit Computable Mathematics). In: Proceedings of the 24th JSSST Annual Symposia (2007)
4. Berardi, S.: An Semantic for Intuitionistic Arithmetic based on Tarski Games with retractable moves. In: Typed Lambda Calculi and Applications (TLCA) (2007)
5. Berardi, S.: Some intuitionistic equivalents of classical principles for degree 2 formulas. Ann. Pure Appl. Logic 139(1-3), 185–200 (2006)