Results 31 to 40 of about 5,334 (208)
Inconsistency, paraconsistency and ω-inconsistency [PDF]
In this paper I'll explore the relation between ω-inconsistency and plain inconsistency, in the context of theories that intend to capture semantic concepts. In particular, I'll focus on two very well known inconsistent but non-trivial theories of truth:
Da Re, Bruno
core +2 more sources
Unpicking Priest's Bootstraps [PDF]
Date of Acceptance: 13/07/2015Peer ...
Meadows, Toby
core +1 more source
On the algebra of possibly paraconsistent sets [PDF]
In this paper we define the notion of possibly paraconsistent sets. We introduce algebraic operations on them and we analyze their properties. Moreover, it is shown that our class can be considered as isomorphic to the classes of intuitionistic and weak ...
Tomasz Witczak
doaj +1 more source
Real Analysis in Paraconsistent Logic [PDF]
A logic \(S\) is paraconsistent if it lacks the rule ECQ (``ex contradictione quodlibet'', i.e., \(A,\lnot A\Rightarrow B\)) or, from another point of view, if inconsistent theories built upon \(S\) are not necessarily trivial (i.e., do not necessarily contain every well-formed formula). Paraconsistent mathematics is the development of mathematics in a
McKubre-Jordens, M, Weber, Z
openaire +3 more sources
Paraconsistent Logic and Its Place in Latin American Philosophy
This study presents an overview of paraconsistent logic, tracing its historical origins and development within what may be referred to as the Latin American school of paraconsistency.
Lauro de Matos Nunes Filho
doaj +1 more source
Paraconsistent Logic and Weakening of Intuitionistic Negation
A paraconsistent logic is a logical system that attempts to deal with contradictions in a discriminating way. In an earlier paper [Notre Dame J. Form. Log.
Majkić Zoran
doaj +1 more source
Paraconsistent OWL and related logics [PDF]
The Web Ontology Language OWL is currently the most prominent formalism for representing ontologies in Semantic Web applications. OWL is based on description logics, and automated reasoners are used to infer knowledge implicitly present in OWL ontologies.
Maier, Frederick +2 more
openaire +2 more sources
Contradiction-tolerant process algebra with propositional signals
In a previous paper, an ACP-style process algebra was proposed in which propositions are used as the visible part of the state of processes and as state conditions under which processes may proceed.
Bergstra, J. A., Middelburg, C. A.
core +1 more source
Paracomplete logics which are dual to the paraconsistent logics L3A and L3B [PDF]
In 2016 Beziau, introduce a more restricted concept of paraconsistency, namely the genuine paraconsistency. He calls genuine paraconsistent logic those logic rejecting φ, ¬φ |- ψ and |- ¬(φ ∧ ¬φ).
Borja-Macı́as, Verónica +2 more
core +1 more source
Logics of formal inconsistency arising from systems of fuzzy logic
This paper proposes the meeting of fuzzy logic with paraconsistency in a very precise and foundational way. Specifically, in this paper we introduce expansions of the fuzzy logic MTL by means of primitive operators for consistency and inconsistency in ...
Coniglio, Marcelo +2 more
core +1 more source

