Computerizing mathematics: logic and computation
暂无分享,去创建一个
[1] W. Bledsoe,et al. Automated Theorem Proving: After 25 Years , 1984 .
[2] S. Feferman. Constructive Theories of Functions and Classes , 1979 .
[3] M. H. Protter,et al. THE SOLUTION OF THE PROBLEM OF INTEGRATION IN FINITE TERMS , 1970 .
[4] de Ng Dick Bruijn,et al. A survey of the project Automath , 1980 .
[5] Per Martin-Löf,et al. Intuitionistic type theory , 1984, Studies in proof theory.
[6] A. Kolmogoroff. Zur Deutung der intuitionistischen Logik , 1932 .
[7] M. Beeson. Foundations of Constructive Mathematics , 1985 .
[8] G. W. Leibniz,et al. Die Philosophischen Schriften , 1960 .
[9] D. Knuth,et al. Simple Word Problems in Universal Algebras , 1983 .
[10] Richard H. Rand,et al. Computer algebra in applied mathematics: An introduction to MACSYMA , 1984 .
[11] Larry Wos,et al. Automated Reasoning: Introduction and Applications , 1984 .
[12] Chris Goad,et al. Special purpose automatic programming for 3D model-based vision , 1987 .
[13] A. Turing. On Computable Numbers, with an Application to the Entscheidungsproblem. , 1937 .
[14] Richard Fikes,et al. STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving , 1971, IJCAI.
[15] J. A. Robinson,et al. A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.
[16] H. Dreyfus. Mind Over Machine , 1986 .
[17] Jörg H. Siekmann,et al. Universal Unification , 1982, GWAI.
[18] Jacques Calmet,et al. Computer Algebra Systems , 1983 .
[19] Franz Winkler,et al. Arithmetic in Basic Algebraic Domains , 1983 .
[20] Joel Moses,et al. Symbolic integration: the stormy decade , 1966, CACM.
[21] R. Duda,et al. Recognition of a Hidden Mineral Deposit by an Artificial Intelligence Program , 1982, Science.
[22] Michael J. O'Donnell,et al. Equational Logic as a Programming Language , 1985, Logic of Programs.
[23] E H Shortliffe,et al. PUFF: an expert system for interpretation of pulmonary function data. , 1982, Computers and biomedical research, an international journal.
[24] David Hilbert. Philosophy of mathematics: On the infinite , 1984 .
[25] Ernst Specker,et al. Nicht konstruktiv beweisbare Sätze der Analysis , 1949, Journal of Symbolic Logic.
[26] John Wylie Lloyd,et al. Foundations of Logic Programming , 1987, Symbolic Computation.
[27] Mark E. Stickel,et al. A Case Study of Theorem Proving by the Knuth-Bendix Method: Discovering That x³=x Implies Ring Commutativity , 1984, CADE.
[28] Robert S. Boyer,et al. Computational Logic , 1990, ESPRIT Basic Research Series.
[29] Donald A. Waterman,et al. A Guide to Expert Systems , 1986 .