Results 1  10
of
154
Literalparaconsistent and literalparacomplete matrices
 Math. Logic Quart
, 2006
"... We introduce a family of matrices that define logics in which paraconsistency and/or paracompleteness occurs only at the level of literals, that is, formulas that are propositional letters or their iterated negations. We give a sound and complete axiomatization for the logic defined by the class of ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We introduce a family of matrices that define logics in which paraconsistency and/or paracompleteness occurs only at the level of literals, that is, formulas that are propositional letters or their iterated negations. We give a sound and complete axiomatization for the logic defined by the class
Algebraization of logics defined by literalparaconsistent or literalparacomplete matrices
 MATHEMATICAL LOGIC QUARTERLY
, 2008
"... ..."
Supervaluationism and Paraconsistency
 Frontiers in Paraconsistent Logic, Baldock: Research Studies Press, 2000
, 2000
"... . Supervaluational semantics have been applied rather successfully to a variety of phenomena involving truthvalue gaps, such as vagueness, lack of reference, sortal incorrectedness. On the other hand, they have not registered a comparable fortune (if any) in connection with truthvalue gluts, i.e., ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
. Supervaluational semantics have been applied rather successfully to a variety of phenomena involving truthvalue gaps, such as vagueness, lack of reference, sortal incorrectedness. On the other hand, they have not registered a comparable fortune (if any) in connection with truthvalue gluts, i.e., more generally, with semantic phenomena involving overdeterminacy or inconsistency as opposed to indeterminacy and incompleteness. In this paper I review some basic routes that are available for this purpose. The outcome is a family of semantic systems in which (i) logical truths and falsehoods retain their classical status even in the presence gaps and gluts, although (ii) the general notions of satifiability and refutability are radically nonclassical. 1. Introduction Since its first appearance in van Fraassen's semantics for free logic [1966a, 1966b], the notion of a supervaluation has been regarded by many as a powerful tool for dealing with truthvalue gaps and, more generally, with...
AntiIntuitionism and Paraconsistency
 URL = http://www.cle.unicamp.br/eprints/vol 3,n 1,2003.html
, 2003
"... This paper aims to help to elucidate some questions on the duality between the intuitionistic and the paraconsistent paradigms of thought, proposing some new classes of antiintuitionistic propositional logics and investigating their relationships with the original intuitionistic logics. It is s ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
the introduction of an internal implication symbol. Comparing these antiintuitionistic logics with wellknown paraconsistent calculi, we prove that they do not coincide with any of these. On the other hand, by dualizing the hierarchy of the paracomplete (or maximal weakly intuitionistic) manyvalued )n
Adventures in the Paraconsistent Jungle
"... This is a survey of the main contributions of the author to the field of paraconsistent logic. After a brief introduction explaining how the author entered this field, Section 2 describes his work on Csystems: reformulation of the semantics of C1, creation of a sequent systems for C1, proof of cut ..."
Abstract
 Add to MetaCart
This is a survey of the main contributions of the author to the field of paraconsistent logic. After a brief introduction explaining how the author entered this field, Section 2 describes his work on Csystems: reformulation of the semantics of C1, creation of a sequent systems for C1, proof
Limits for Paraconsistent Calculi
 Notre Dame Journal of Formal Logic
, 2001
"... This paper discusses how to define logics as deductive limits of sequences of other logics. The case of da Costa's hierarchy of increasingly weaker paraconsistent calculi, known as $C_n$, $\leq n\leq\omega$, is carefully studied. The calculus $C_\omega$, in particular, constitutes n ..."
Abstract

Cited by 12 (8 self)
 Add to MetaCart
This paper discusses how to define logics as deductive limits of sequences of other logics. The case of da Costa's hierarchy of increasingly weaker paraconsistent calculi, known as $C_n$, $\leq n\leq\omega$, is carefully studied. The calculus $C_\omega$, in particular, constitutes
Real Analysis in Paraconsistent Logic
"... This paper begins an analysis of the real line using an inconsistencytolerant (paraconsistent) logic. We show that basic field and compactness properties hold, by way of novel proofs that make no use of consistencyreliant inferences; some techniques from constructive analysis are used instead. Whi ..."
Abstract
 Add to MetaCart
This paper begins an analysis of the real line using an inconsistencytolerant (paraconsistent) logic. We show that basic field and compactness properties hold, by way of novel proofs that make no use of consistencyreliant inferences; some techniques from constructive analysis are used instead
Modeling Paraconsistent Knowledge in Distributed Systems
, 1994
"... . This paper presents some ideas on using paraconsistent logics to represent and to reason about knowledge in distributed systems. Since one our main research areas is related to robotics and manufacturing systems, we focus our attention on logics and problems relevant to this area. We review the fu ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
. This paper presents some ideas on using paraconsistent logics to represent and to reason about knowledge in distributed systems. Since one our main research areas is related to robotics and manufacturing systems, we focus our attention on logics and problems relevant to this area. We review
Paraconsistent Logics in Artificial Intelligence and Robotics
"... . This papers presents some ideas on using paraconsistent and overcomplete logics to represent and to reason about knowledge in Artificial Intelligence systems. Since one our main research areas is related to robotics and manufacturing systems, we focus our attention on those logics and problems rel ..."
Abstract
 Add to MetaCart
. This papers presents some ideas on using paraconsistent and overcomplete logics to represent and to reason about knowledge in Artificial Intelligence systems. Since one our main research areas is related to robotics and manufacturing systems, we focus our attention on those logics and problems
Results 1  10
of
154