-
The courses given at the 1st C.I.M.E. Summer School of 1988 dealt with the main areas on the borderline between applied logic and theoretical computer science. These courses are recorded here in five expository papers: S. Homer: The Isomorphism Conjecture and its Generalization.- A. Nerode: Some Lectures on Intuitionistic Logic.- R.A. Platek: Making Computers Safe for the World. An Introduction to Proofs of Programs. Part I. - G.E. Sacks: Prolog Programming.- A. Scedrov: A Guide to Polymorphic T…Read more
-
3Inadmissibility, Tame r.e. Sets and the Admissible CollapseJournal of Symbolic Logic 46 (3): 665-667. 1981.
-
18Wolfgang Maass. Inadmissibility, tame r.e. sets and the admissible collapse. Annals of mathematical logic, vol. 13 no. 2 , pp. 149–170 (review)Journal of Symbolic Logic 46 (3): 665-667. 1981.
-
27Sy D. Friedman, β-recursion theory. Transactions of the American Mathematical Society, vol. 255 , pp. 173–200. - Sy D. Friedman. Post's problem without admissibility. Advances in mathematics, vol. 35 , pp. 30–49 (review)Journal of Symbolic Logic 46 (3): 664-665. 1981.
-
Omnibus Review (review)Journal of Symbolic Logic 64 (1): 399-401. 1999.Reviewed Works:Andrea Sorbi, Complexity, Logic, and Recursion Theory.Klaus Ambos-Spies, Elvira Mayordomo, Resource-Bounded Measure and Randomness.Marat Arslanov, Degree Structures in Local Degree Theory.Jose L. Balcazar, Ricard Gavalda, Montserrat Hermo, Compressibility of Infinite Binary Sequences.S. Barry Cooper, Beyond Godel's Theorem: The Failure to Capture Information Content.Robert A. Di Paola, Franco Montagna, Progressions of Theories of Bounded Arithmetic.Rodney G. Downey, On Presentatio…Read more
-
7Complexity, logic, and recursion theory, edited by Sorbi Andrea, Lecture notes in pure and applied mathematics, vol. 187, Marcel Dekker, Inc., New York, Basel, and Hong Kong, 1997, viii + 363 pp (review)Journal of Symbolic Logic 64 (1): 399-401. 1999.
-
19The bounded injury priority method and the learnability of unions of rectanglesAnnals of Pure and Applied Logic 77 (2): 143-168. 1996.We develop a bounded version of the finite injury priority method in recursion theory. We use this to study the learnability of unions of rectangles over the domain {0, …, n − 1}d with only equivalence queries. Applying this method, we show three main results:1. The class of unions of rectangles is polynomial time learnable for constant dimension d.2. The class of unions of rectangles whose projections at some unknown dimension are pairwise-disjoint is polynomial time learnable.3. The class of u…Read more
-
12[Omnibus Review]Journal of Symbolic Logic 64 (1): 399-401. 1999.Reviewed Works:Andrea Sorbi, Complexity, Logic, and Recursion Theory.Klaus Ambos-Spies, Elvira Mayordomo, Resource-Bounded Measure and Randomness.Marat Arslanov, Degree Structures in Local Degree Theory.Jose L. Balcazar, Ricard Gavalda, Montserrat Hermo, Compressibility of Infinite Binary Sequences.S. Barry Cooper, Beyond Godel's Theorem: The Failure to Capture Information Content.Robert A. Di Paola, Franco Montagna, Progressions of Theories of Bounded Arithmetic.Rodney G. Downey, On Presentatio…Read more