An Arithmetical Hierarchy of the Law of Excluded Middle and Related Principles

Authors:
Yohji Akama;Stefano Berardi;Susumu Hayashi;Ulrich Kohlenbach
Affiliations:
Tohoku University, Sendai, Japan;University of Turin, Italy;Kobe University, Japan;Darmstadt University of Technology, Germany
Venue:
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Year:
2004

Citing 0
Cited 10

Mathematics based on incremental learning: excluded middle and inductive inference

Theoretical Computer Science - Algorithmic learning theory(ALT 2002)
Can Proofs be Animated by Games?

Fundamenta Informaticae - Typed Lambda Calculi and Applications 2005, Selected Papers
A Calculus of Realizers for EM1 Arithmetic (Extended Abstract)

CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Interactive Learning-Based Realizability Interpretation for Heyting Arithmetic with EM1

TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
Positive arithmetic without exchange is a subclassical logic

APLAS'07 Proceedings of the 5th Asian conference on Programming languages and systems
A new translation for semi-classical theories: backtracking without CPS

FLOPS'08 Proceedings of the 9th international conference on Functional and logic programming
Interactive Realizers: A New Approach to Program Extraction from Nonconstructive Proofs

ACM Transactions on Computational Logic (TOCL)
Inductive logic programming: yet another application of logic

INAP'05 Proceedings of the 16th international conference on Applications of Declarative Programming and Knowledge Management
Can Proofs be Animated by Games?

Fundamenta Informaticae - Typed Lambda Calculi and Applications 2005, Selected Papers
Lifschitz realizability for intuitionistic Zermelo---Fraenkel set theory

Archive for Mathematical Logic

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a concise and natural encoding of the spi-calculus into the more basic 驴-calculus and establish its correctness with respect to a formal notion of testing.This is particularly relevant for security protocols modelled in spi since the tests ...