Levi Isaac. For the sake of the argument. Ramsey test conditionals, inductive inference, and nonmonotonic reasoning. Cambridge University Press, Cambridge, New York, and Oakleigh, Victoria, 1996, xv + 341 pp.

1997 ◽  
Vol 62 (3) ◽  
pp. 1041-1043
Author(s):  
R. D. Rosenkrantz
Keyword(s):  
New York ◽  
Inductive Inference ◽  
Nonmonotonic Reasoning ◽  
Ramsey Test ◽  
Cambridge University

For the Sake of the Argument: Ramsey Test Conditionals, Inductive Inference, and Nonmonotonic Reasoning.

1998 ◽  
Vol 95 (10) ◽  
pp. 540
Author(s):  
Michael Morreau ◽  
Isaac Levi
Keyword(s):  
Inductive Inference ◽  
Nonmonotonic Reasoning ◽  
Ramsey Test

Computability, enumerability, unsolvability, Directions in recursion theory, edited by S. B. Cooper, T. A. Slaman, and S. S. Wainer, London Mathematical Society lecture note series, no. 224, Cambridge University Press, Cambridge, New York, and Oakleigh, Victoria, 1996, vii + 347 pp. - Leo Harrington and Robert I. Soare, Dynamic properties of computably enumerable sets, Pp. 105–121. - Eberhard Herrmann, On the ∀∃-theory of the factor lattice by the major subset relation, Pp. 139–166. - Manuel Lerman, Embeddings into the recursively enumerable degrees, Pp. 185–204. - Xiaoding Yi, Extension of embeddings on the recursively enumerable degrees modulo the cappable degrees, Pp. 313–331. - André Nies, Relativization of structures arising from computability theory. Pp. 219–232. - Klaus Ambos-Spies, Resource-bounded genericity. Pp. 1–59. - Rod Downey, Carl G. Jockusch, and Michael Stob. Array nonrecursive degrees and genericity, Pp. 93–104. - Masahiro Kumabe, Degrees of generic sets, Pp. 167–183. - Marat M. Arslanov, Steffen Lempp, and Richard A. Shore, On isolating r.e. and isolated d-r.e. degrees, Pp. 61–80. - S. Barry Cooper, A characterisation of the jumps of minimal degrees below 0′, Pp. 81–92. - Michael E. Mytilinaios and Theodore A. Slaman, On a question of Brown and Simpson, Pp. 205–218. - Andrew J. Heaton and Stanley S. Wainer. Axioms for subrecursion theories, Pp. 123–138. - Dag Normann, A hierarchy of domains with totality, but without density, Pp. 233–257. - Piergiorgio Odifreddi, Inductive inference of total functions, Pp. 259–288. - Andrea Sorbi, The Medvedev lattice of degrees of difficulty, Pp. 289–312. - S. B. Cooper, T. A. Slaman, and S. S. Wainer, Appendix: questions in recursion theory, Pp. 333–347.

1999 ◽  
Vol 64 (3) ◽  
pp. 1362-1365
Author(s):  
C. T. Chong
Keyword(s):  
New York ◽  
Inductive Inference ◽  
Dynamic Properties ◽  
London Mathematical Society ◽  
Recursion Theory ◽  
Cambridge University ◽  
Computably Enumerable Sets ◽  
Recursively Enumerable ◽  
Medvedev Lattice ◽  
Major Subset
Sign in / Sign up

Export Citation Format

Share Document