A 'Theory' Mechanism for a Proof-Verifier Based on First-Order Set Theory
暂无分享,去创建一个
[1] William M. Farmer,et al. IMPS: An interactive mathematical proof system , 1990, Journal of Automated Reasoning.
[2] Toby Walsh,et al. Automated Deduction—CADE-11 , 1992, Lecture Notes in Computer Science.
[3] Edmund M. Clarke,et al. Analytica - A Theorem Prover in Mathematica , 1992, CADE.
[4] José Meseguer,et al. Principles of OBJ2 , 1985, POPL.
[5] Thierry Coquand,et al. The Calculus of Constructions , 1988, Inf. Comput..
[6] Joseph A. Goguen,et al. Algebraic semantics of imperative programs , 1996, Foundations of computing series.
[7] E. Landau,et al. Foundations of analysis : the arithmetic of whole, rational, irrational, and complex numbers , 1966 .
[8] Joseph A. Goguen,et al. Putting Theories Together to Make Specifications , 1977, IJCAI.
[9] Alonzo Church,et al. A formulation of the simple theory of types , 1940, Journal of Symbolic Logic.
[10] Per Martin-Löf,et al. Intuitionistic type theory , 1984, Studies in proof theory.
[11] Andreas Blass,et al. The Logic of Choice , 2000, Journal of Symbolic Logic.
[12] Minoru Taya,et al. CHAPTER 2 – Foundation of Analysis , 1989 .
[13] Patrick Cegielski. Un fondement des Mathématiques , 1999 .
[14] Andrea Formisano,et al. An Equational Re-engineering of Set Theories , 1998, FTP.
[15] R. Godement. Cours d'algèbre , 1963 .
[16] Douglas S. Bridges,et al. Foundations of real and abstract analysis , 1997, Graduate texts in mathematics.
[17] Gernot Salzer,et al. Automated Deduction in Classical and Non-Classical Logics , 2002, Lecture Notes in Computer Science.
[18] Ronald Regan. Basic Set Theory , 2000 .