Results 201 to 210 of about 801,927 (249)

Paraconsistent Logical Consequence

Journal of Applied Non-Classical Logics, 1998
ABSTRACT The concept of paraconsistent logical consequence is usually negatively defined as a validity semantics in which not every sentences is deducible or in which inferential explosion does not occur. Paraconsistency has been negatively characterized in this way because paraconsistent logics have been designed specifically to avoid the ...
openaire   +1 more source

Paraconsistent Logic: Consistency, Contradiction and Negation

History and Philosophy of Logic, 2021
A. Rodrigues
semanticscholar   +1 more source

Logical Weak Completions of Paraconsistent Logics

Journal of Logic and Computation, 2008
Let P be an arbitrary theory and let X be any given logic. Let M be a set of atoms. We say that M is a X-stable model of P if M is a classical model of P and P∪¬M~ proves in logic X all atoms in M, this is denoted by P∪¬M~ ⊩xM. We prove that being an X-stable model is an invariant property for disjunctive programmes under a large class of logics.
M. Osorio Galindo, J. R. Arrazola Ramirez, J. L. Carballido   +2 more
openaire   +1 more source

Modal (Logic) Paraconsistency

2003
According to the standard definition, a logic is said to be paraconsistent if it fails the (so-called) rule of ex falso: i.e., α, ¬α ∀ β. Thus, paraconsistency captures an important sense in which a logic is inconsistency-tolerant, namely when arbitrary inference is prohibited in the presence of inconsistencies.
Philippe Besnard, Paul Wong
openaire   +1 more source

Paraconsistent Classical Logic

2002
But the ambiguity will not trouble us, since the relata will always allow us to tell which relation is meant. We take it for granted that we are dealing with a standard sort of formal language1, and a standard recursive definition of truth-ina-model. Since the details of the language do not matter for our purposes, we will forgo specifying them.
openaire   +2 more sources

Annotated Paraconsistent Logic

2009
This paper presents a general view from the Two-Valued Annotated Paraconsistent Logic – 2vAPL to the Four-Valued Annotated Paraconsistent Logic – 4vAPL. The purpose to expand 2vAPL to 4vAPL is to enable the insertion of opinions from Experts in the knowledge base, so that the problems described approach their real condition, once ...
Martins Helga Gonzaga, de Moraes Carlos Henrique Valério, Costa Cláudio Inácio de Almeida, Lambert-Torres Germano, Neto Antônio Faria   +4 more
openaire   +1 more source

Paraconsistent Logics: Preamble

2015
In this introductory chapter it is introduced some aspects of paraconsistent logics, such as its brief historical developments, some main systems and mention some applications. The chapter obviously does not cover many topics: moreover it is far from to be complete. In fact, the theme is now widespread and occupies a distinguished position in academia.
openaire   +1 more source

Lattice-Based Paraconsistent Logic

2006
In this paper we describe a procedure for developing models and associated proof systems for two styles of paraconsistent logic. We first give an Urquhart-style representation of bounded not necessarily discrete lattices using (grill, cogrill) pairs. From this we develop Kripke semantics for a logic permitting 3 truth values: true, false and both true ...
Wendy MacCaull, Dimiter Vakarelov
openaire   +1 more source

Paraconsistency: Logic and Applications

2023
A logic is called 'paraconsistent' if it rejects the rule called 'ex contradictione quodlibet', according to which any conclusion follows from inconsistent premises. While logicians have proposed many technically developed paraconsistent logical systems and contemporary philosophers like Graham Priest have advanced the view that some contradictions can
openaire   +1 more source

Reasoning in Paraconsistent Logics

1991
Databases and knowledge bases could be inconsistent in many ways. For example, if a programmer is constructing an expert system ES relating to a domain D,he does so by consulting several experts (say n in number) in the field D. From each expert d i , 1 ≤ i ≤ n, he obtains some information, and this may be represented in logic as a collection of ...
James J. Lu, Lawrence J. Henschen, V. S. Subrahmanian, Newton C. A. da Costa   +3 more
openaire   +1 more source