An arithmetical hierarchy of the law of excluded middle and related principles
暂无分享,去创建一个
[1] A. S. Troelstra,et al. Chapter VI – Realizability , 1998 .
[2] U. Kohlenbach. Analysing proofs in analysis , 1996 .
[3] Stefano Baratella,et al. Constructivization via Approximations and Examples , 1998 .
[4] Michael Toftdal. A Calibration of Ineffective Theorems of Analysis in a Hierarchy of Semi-classical Logical Principles: (Extended Abstract) , 2004, ICALP.
[5] Stefano Berardi. Classical logic as limit completion , 2005, Math. Struct. Comput. Sci..
[6] Susumu Hayashi. Mathematics Based on Learning , 2002, ALT.
[7] Stefano Berardi. A generalization of a conservativity theorem for classical versus intuitionistic arithmetic , 2004, Math. Log. Q..
[8] A. Troelstra. Models and computability , 1973 .
[9] Susumu Hayashi,et al. Towards Limit Computable Mathematics , 2000, TYPES.