Ordinal Bounds for Programs
暂无分享,去创建一个
[1] H. Schwichtenberg. Primitive Recursion on the Partial Continuous Functionals , 1991 .
[2] W. Buchholz. Iterated Inductive Definitions and Subsystems of Analysis: Recent Proof-theoretical Studies , 1981 .
[3] S. Shelah,et al. Annals of Pure and Applied Logic , 1991 .
[4] A. Troelstra,et al. Constructivism in Mathematics: An Introduction , 1988 .
[5] Stanley S. Wainer. Slow Growing Versus Fast Growing , 1989, J. Symb. Log..
[6] Wilfried Buchholz,et al. An independence result for (II11-CA)+BI , 1987, Ann. Pure Appl. Log..
[7] Manfred Broy,et al. Informatik und Mathematik , 1991 .
[8] Toshiyasu Arai. A Slow Growing Analogue to Buchholz' Proof , 1991, Ann. Pure Appl. Log..
[9] John Fitch,et al. Course notes , 1975, SIGS.
[10] W. G. Handley,et al. Equational Derivation vs. Computation , 1994, Ann. Pure Appl. Log..
[11] A. Troelstra. Constructivism in mathematics , 1988 .
[12] S. S. Wainer,et al. Ordinal Complexity of Recursive Definitions , 1992, Inf. Comput..
[13] Walter Dosch,et al. Reduction Relations in Strict Applicative Language , 1992, ISTCS.
[14] Wilfried Buchholz,et al. A new system of proof-theoretic ordinal functions , 1986, Ann. Pure Appl. Log..
[15] H. Schwichtenberg. Proofs as programs , 1993 .
[16] G.D. Plotkin,et al. LCF Considered as a Programming Language , 1977, Theor. Comput. Sci..