Multi-Valued Logic and Gröbner Bases with Applications to Modal Logic
暂无分享,去创建一个
[1] P. F. Gibbins. VDM: Axiomatising its Propositional Logic , 1988, Comput. J..
[2] Nachum Dershowitz,et al. Rewrite Methods for Clausal and Non-Clausal Theorem Proving , 1983, ICALP.
[3] Elliott Mendelson,et al. Introduction to Mathematical Logic , 1979 .
[4] Richard C. T. Lee,et al. Symbolic logic and mechanical theorem proving , 1973, Computer science classics.
[5] Paliath Narendran,et al. Only Prime Superpositions Need be Considered in the Knuth-Bendix Completion Procedure , 1988, J. Symb. Comput..
[6] S. C. Kleene,et al. Introduction to Metamathematics , 1952 .
[7] Bruno Buchberger,et al. A criterion for eliminating unnecessary reductions in the Knuth-Bendix algorithm , 1983, SIGS.
[8] Richard S. Bird,et al. Programs and Machines , 1976 .
[9] Jieh Hsiang,et al. Refutational Theorem Proving Using Term-Rewriting Systems , 1985, Artif. Intell..
[10] B. Buchberger,et al. Grobner Bases : An Algorithmic Method in Polynomial Ideal Theory , 1985 .
[11] Bruno Buchberger,et al. A criterion for detecting unnecessary reductions in the construction of Groebner bases , 1979, EUROSAM.
[12] M. Stone,et al. The Theory of Representation for Boolean Algebras , 1936 .