Author:
Spinks Matthew,Veroff Robert
Publisher
Springer International Publishing
Reference202 articles.
1. Abramsky, S. (1993). Computational intepretations of linear logic, Theoretical Computer Science 111, 3–57.
2. Aglianò, P. (2001). Congruence quasi-orderability in subtractive varieties, Journal of the Australian Mathematical Society. Series A — Pure Mathematics and Statistics 71, 421–445.
3. Akama, S. (1997). Tableaux for logic programming with strong negation, In D. Galmiche (Ed.), Automated Reasoning with Analytical Tableaux and Related Methods. International Conference, TABLEAUX’97. Pont-á-Mousson, France, May, 1997. Proceedings, Volume 1227 of Lecture notes in Artificial Intelligence. Subseries of Lecture Notes in Computer Science, Berlin, pp. 31–42. Springer.
4. Almukdad, A. and Nelson, D. (1984). Constructible falsity and inexact predicates, Journal of Symbolic Logic 49, 231–233.
5. van Alten, C. J. (1998). An Algebraic Study of Residuated Ordered Monoids and Logics without Exchange and Contraction, Ph. D. thesis, University of Natal, Durban, http://hdl.handle.net/10413/3961 , accessed 12 March 2016.
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献