Tableaux for logic programming with strong negation-Reference-Cited by-同舟云学术

Tableaux for logic programming with strong negation

Published:1997 Issue: Volume: Page:31-42
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Akama Seiki

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/BFb0027403

Reference26 articles.

1. Akama, S. (1987): Resolution in constructivism, Logique et Analyse 120, 385–399.

2. Akama, S. (1988a): On the proof method for constructive falsity, Zeitschrift für mathematische Logik und Grundlagen der Mathematik 34, 385–392.

3. Akama, S. (1988b): Constructive predicate logic with strong negation and model theory, Notre Dame Journal of Formal Logic 29, 18–27.

4. Akama, S. (1989): Constructive Falsity: Foundations and Their Applications to Computer Science, Ph.D. dissertation, Department of Administration Engineering, Keio University, Yokohama, Japan.

5. Akama, S. (1990): Subformula semantics for strong negation systems, The Journal of Philosophical Logic 19, 217–226.

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Paraconsistent constructive logic with strong negation as a contraction-free relevant logic;Don Pigozzi on Abstract Algebraic Logic, Universal Algebra, and Computer Science;2018

2. Non-Classical Negation in the Works of Helena Rasiowa and Their Impact on the Theory of Negation;Studia Logica;2006-10-20

3. Phase Semantics and Petri Net Interpretation for Resource-Sensitive Strong Negation;Journal of Logic, Language and Information;2006-10-17

4. Relevant Logic and Paraconsistency;Inconsistency Tolerance;2005

5. A Space Efficient Implementation of a Tableau Calculus for a Logic with a Constructive Negation;Computer Science Logic;2004