Results 71 to 80 of about 105 (101)
Some of the next articles are maybe not open access.
Paraconsistent Orbits of Logics
Logica Universalis, 2021The paper examines \textit{paraconsistentization by consistent sets} of logics viewed as consequence relations. In this sense, given a logic \( L=(X,\vdash _{L})\), the paraconsistentization of \(L\) by consistent sets is, \textit{grosso modo}, the result of restricting \(\vdash _{L}\) to pairs \( \left\langle \Gamma ,A\right\rangle \) where \(\Gamma \)
Souza, Edelcio G. de +2 more
openaire +3 more sources
Journal of Philosophical Logic, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
South African Journal of Philosophy, 2007
No Abstract.South African Journal of Philosophy Vol.26 (2) 2007:239 ...
openaire +2 more sources
No Abstract.South African Journal of Philosophy Vol.26 (2) 2007:239 ...
openaire +2 more sources
Resource-Bounded Paraconsistent Inference
Annals of Mathematics and Artificial Intelligence, 2003zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Marquis, Pierre, Porquet, Nadège
openaire +3 more sources
2002
A logic is paraconsistent if it does not validate the principle that from a pair of contradictory sentences, A and ∼A, everything follows, as most orthodox logics do. If a theory has a paraconsistent underlying logic, it may be inconsistent without being trivial (that is, entailing everything).
openaire +2 more sources
A logic is paraconsistent if it does not validate the principle that from a pair of contradictory sentences, A and ∼A, everything follows, as most orthodox logics do. If a theory has a paraconsistent underlying logic, it may be inconsistent without being trivial (that is, entailing everything).
openaire +2 more sources
Studia Logica, 1984
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Carnielli, Walter Alexandre +1 more
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Carnielli, Walter Alexandre +1 more
openaire +1 more source
Aspects of Paraconsistent Logic
Logic Journal of IGPL, 1995This paper discusses an extension \(C^+_1\) of da Costa's system \(C_1\) of paraconsistent logic. A Hilbert-style version and a sequent calculus version of the system are presented as well as a bivalent non-truth-functional semantics. It is shown that \(C^+_1\) is semantically decidable, but that the replacement theorem does not hold.
da Costa, Newton C. A. +2 more
openaire +1 more source
Journal of Philosophical Logic, 1995
\textit{G. Priest} [``The logic of paradox'', J. Philos. Logic 8, 219-241 (1979; Zbl 0402.03012)] presents a paraconsistent logic, that is, one which does not collapse into all statements being provable but in which nevertheless ``\(A\vee \neg A\)'' is logically true and ``\(A \wedge\neg A\)'' is logically false. But, argues Slater in the present paper,
openaire +2 more sources
\textit{G. Priest} [``The logic of paradox'', J. Philos. Logic 8, 219-241 (1979; Zbl 0402.03012)] presents a paraconsistent logic, that is, one which does not collapse into all statements being provable but in which nevertheless ``\(A\vee \neg A\)'' is logically true and ``\(A \wedge\neg A\)'' is logically false. But, argues Slater in the present paper,
openaire +2 more sources
Paraconsistent Computation Tree Logic
New Generation Computing, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kaneiwa, Ken, Kamide, Norihiro
openaire +2 more sources
Paraconsistent Logics and Translations
Synthese, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
D'Ottaviano, Itala M. Loffredo +1 more
openaire +2 more sources

