Relevant logic and paraconsistency

Authors:
John Slaney
Affiliations:
The Australian National University , and National ICT Australia, Canberra, Australia
Venue:
Inconsistency Tolerance
Year:
2004

Citing 6
Cited 2

Linear logic

Theoretical Computer Science
Logic of Information Structures

Logic of Information Structures
Representing Knowledge in A-Prolog

Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
Logic for Two: The Semantics of Distributive Substructural Logics

ECSQARU/FAPR '97 Proceedings of the First International Joint Conference on Qualitative and Quantitative Practical Reasoning
Tableaux for Logic Programming with Strong Negation

TABLEAUX '97 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
The implications of paraconsistency

IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 2

A framework for web science

Foundations and Trends in Web Science
Detecting Inconsistencies in the Gene Ontology Using Ontology Databases with Not-gadgets

OTM '09 Proceedings of the Confederated International Conferences, CoopIS, DOA, IS, and ODBASE 2009 on On the Move to Meaningful Internet Systems: Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

This is an account of the approach to paraconsistency associated with relevant logic. The logic fde of first degree entailments is shown to arise naturally out of the deeper concerns of relevant logic. The relationship between relevant logic and resolution, and especially the disjunctive syllogism, is then examined. The relevant refusal to validate these inferences is defended, and finally it is suggested that more needs to be done towards a satisfactory theory of when they may nonetheless safely be used.