Results 261 to 270 of about 10,008 (302)

Algorithms for Relevant Logic

2005
Summary: The classical analytic tableau method has been extended successfully to modal logics and also to relevant and paraconsistent logics. The classical connection method has been extended to modal and intuitionistic logics, and the purpose of this paper is to investigate whether a similar adaptation to relevant logic is possible. A hybrid method is
Gochet, Paul, Gribomont, Pascal, Rossetto, Didier   +2 more
openaire   +3 more sources

RELEVANCE LOGICS AND RELATION ALGEBRAS

The Review of Symbolic Logic, 2009
Relevance logicsare known to be sound and complete for relational semantics with a ternary accessibility relation. This paper investigates the problem of adequacy with respect to special kinds ofdynamic semantics(i.e., proper relation algebras and relevant families of relations). We prove severalsoundnessresults here.
Katalin Bimbó, J. Michael Dunn, Roger D. Maddux   +2 more
openaire   +1 more source

Logical Relevance in Ontologies. [PDF]

, 2012
Most ontology development environments (ODEs) are term oriented and take a frame-based view of the information in an ontology about a given term. Even tools, such as Protégé 4, designed for axiom oriented development preserve the frame-based view as the central mode of interaction with the ontology.
Vescovo, C Del, Parsia, B, Sattler, U; id_orcid 0000-0003-4103-3389   +2 more
openaire   +3 more sources

The Relevance of Relevance to Relevance Logic

2015
I explore the question of whether the concept of relevance is relevant to the study of what Anderson and Belnap call “relevance logic.” The answer should be “Of course!” But there are some twists and turns, as is shown by the fact that it has taken over 50 years to get here. Despite protests by R. K.
openaire   +1 more source

Semantics for relevant logics

Journal of Symbolic Logic, 1972
In what follows there is presented a unified semantic treatment of certain “paradox-free” systems of entailment, including Church's weak theory of implication (Church [7]) and logics akin to the systems E and R of Anderson and Belnap (Anderson [3], Belnap [6]).
openaire   +2 more sources

Relevant deontic logic

Journal of Philosophical Logic, 1992
Novel conditions of relevance are defined for conditionals in order to weed out some of the deontic paradoxes, such as Ross's paradox. Semantically, first-degree positive relevant entailment is defined in terms of fulfilment conditions, which are sets of sets of literals (atomic sentences or their negations).
openaire   +2 more sources

Relevant logic programming

Journal of Automated Reasoning, 1991
Several authors suggested extension of Horn clause programming using bottom-up proof search in Gentzen-type systems for intuitionistic logic with suitable restriction of the language. The author describes a similar program based on the relevance logic LR\(^ +\) without negation and distributivity axiom.
openaire   +2 more sources

An Incomplete Relevant Modal Logic

Journal of Philosophical Logic, 2000
The propositional modal logic \(G\) considered in this paper is an extension of the Anderson-Belnap system \(R\), which is incomplete in Routley-Meyer semantics for relevant modal logics.
openaire   +1 more source

RELEVANCE LOGIC AND THE CALCULUS OF RELATIONS

The Review of Symbolic Logic, 2010
Sound and complete semantics for classical propositional logic can be obtained by interpreting sentences as sets. Replacing sets with commuting dense binary relations produces an interpretation that turns out to be sound but not complete for R. Adding transitivity yields sound and complete semantics for RM, because all normal Sugihara matrices are ...
openaire   +1 more source

Gentzenizations of relevant logics with distribution

Journal of Symbolic Logic, 1996
We establish cut-free left-handed Gentzenizations for a range of major relevant logics from B through to R, all with distribution. B is the basic system of the Routley-Meyer semantics (see [15], pp. 287–300) and R is the logic of relevant implication (see [1], p. 341). Previously, the contractionless logics DW, TW, EW, RW and RWK were Gentzenized in [3]
openaire   +2 more sources