Scott Weinstein
Biographical Sketch

Background: Scott Weinstein received his A.B. from Princeton University in 1969 and his Ph.D. from the Rockefeller University in 1975. He joined the faculty of the University of Pennsylvania in 1975 where he is currently a Professor in the Department of Philosophy with secondary appointments in the Departments of Computer and Information Science and Mathematics.

Research Interests: computational learning theory, descriptive complexity theory, finite model theory, mathematical logic, philosophy of mathematics.

Selected publications:
"Some Applications of Kripke Models to Formal Systems of Intuitionistic Analysis," Annals of Mathematical Logic, v. 16, 1979, pp. 1-32.

"The Intended Interpretation of Intuitionistic Logic," Journal of Philosophic Logic, v. 12, 1983, pp.261-270.

"Learning Theory and Natural Language" (with D. Osherson and M. Stob), Cognition, v. 17, 1984, pp. 1-28; reprinted in R. Matthews and W. Demopoulos (eds.), Learnability and Linguistic Theory, Kluwer Academic Publishers, 1989, pp. 19-50.

Systems that Learn: An Introduction for Cognitive and Computer Scientists, (with D. Osherson and M. Stob), MIT Press, 1986.

"Social Learning and Collective Choice," (with D. Osherson and M. Stob), Synthese, v. 30, 1987, pp. 319-347.

"Mechanical Learners Pay a Price for Bayesianism," (with D. Osherson and M. Stob), The Journal of Symbolic Logic, v. 53, 1988, pp. 1245-1251.

"Synthesizing Inductive Expertise," (with D. Osherson and M. Stob), Information and Computation, v. 77, 1988, pp. 138-161.

"Minimal Consequence in Sentential Logic," (with M. A. Papalaskari), The Journal of Logic Programming, v. 7, 1990, pp. 1-13.

"A Reason for Theoretical Terms," (with H. Gaifman and D. Osherson), Erkenntnis, v. 32, 1990, pp. 149-159.

"A Universal Inductive Inference Machine," (with D. Osherson and M. Stob), Journal of Symbolic Logic, v. 56, 1991, pp. 661-672.

"Current Research Trends in Computational Learning Theory in the United States" (in Japanese), (with N. Abe and D. Osherson), Monthly Magazine of the Information Processing Society of Japan, v. 32, 1991, pp. 272-281.

"Universal Methods of Scientific Inquiry," (with D. Osherson and M. Stob), Machine Learning, v. 9, 1992, pp. 261-271.

"Infinitary Logic and Inductive Definability over Finite Structures," (with A. Dawar and S. Lindell), Information and Computation, v. 119, 1995, pp. 160-175.

"On the Study of First Language Acquisition," (with D. Osherson), Journal of Mathematical Psychology, v. 39, 1995, pp. 129-145.

"Preservation Theorems in Finite Model Theory," (with E. Rosen), in Daniel Leivant (ed.), Logic and Computational Complexity, Springer, 1995, pp. 480-502.

"Centering: A Framework for Modelling the Local Coherence of Discourse," (with B. Grosz and A. Joshi) Computational Linguistics v. 21(1995), pp. 203-225.

"k-Universal Finite Graphs," (with E. Rosen and S. Shelah) in Boppana, R. and Lynch, J. (eds.), Logic and Random Structures, American Mathematical Society, 1997, pp. 65-77.

"Formal Learning Theory," (with D. de Jongh, D. Osherson, and E. Martin) in J. van Bentham and A. ter Meulen (eds.), Handbook of Logic and Linguistics, Amsterdam: North-Holland Publishing Company, 1997, pp. 737-775.

"Elementary Properties of the Finite Ranks," (with A. Dawar, K. Doets, and S. Lindell) Mathematical Logic Quarterly, v. 44 (1998), pp. 349-353.

"Path Constraints in Semistructured Databases," (with P. Buneman and W. Fan) Journal of Computer and System Sciences, v. 61 (2000), pp. 146-193.

"Logic in Finite Structures: Definability, Complexity, and Randomness," in D. Jacquette (ed.), Companion to Philosophical Logic, Oxford: Blackwell Publishers, 2002, pp. 332-348.

"Interaction between Path and Type Constraints," (with P. Buneman and W. Fan) ACM Transactions on Computational Logic, v. 4 (2003), pp. 530-577.