Results 91 to 100 of about 132 (129)

Reasoning about possibilities: Modal logics, possible worlds, and mental models. [PDF]

Psychon Bull Rev
Johnson-Laird PN, Ragni M.
europepmc   +1 more source

Simple Hyperintensional Belief Revision. [PDF]

Erkenntnis, 2019
Berto F.
europepmc   +1 more source

Rough sets: past, present, and future. [PDF]

Nat Comput, 2018
Skowron A, Dutta S.
europepmc   +1 more source

One Heresy and One Orthodoxy: On Dialetheism, Dimathematism, and the Non-normativity of Logic. [PDF]

Erkenntnis
Wansing H.
europepmc   +1 more source

Ontological realism: A methodology for coordinated evolution of scientific ontologies. [PDF]

Appl Ontol, 2010
Smith B, Ceusters W.
europepmc   +1 more source

Paraconsistent Logic

Journal of Japan Society for Fuzzy Theory and Systems, 2001
openaire   +2 more sources

Powerful Paraconsistent Logic

, 1993
W pracy prezentowane są niektóre wyniki dotyczące wprowadzonej, w jednej z poprzednich prac autora, klasy tzw. dyskusyjnych systemów Jaśkowskiego. W szczególności zwraca się uwagę na parakonsystentność owych systemów, brak reguły dołączania prawdziwościowej koniunkcji oraz respektowanie reguły dołączania tzw.
openaire   +1 more source

Paraconsistent logic

, 2008
openaire   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Paraconsistent Orbits of Logics

Logica Universalis, 2021
The 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, Leite, Alexandre Fernandes Batista Costa, Dias, Diogo H. B.   +2 more
openaire   +3 more sources

Aspects of Paraconsistent Logic

Logic Journal of IGPL, 1995
This 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., Béziau, Jean-Yves, Bueno, Otávio A. S.   +2 more
openaire   +1 more source