304 search results - page 2 / 61 » Analysis of the paraconsistency in some logics |
NDJFL
1998
13 years 5 months ago
1998
Using methods of abstract logic and the theory of valuation, we prove that there is no paraconsistent negation obeying the law of double negation and such that ¬(a ∧ ¬a) is a t...
LOGCOM
2010
13 years 7 days ago
2010
We describe a method to axiomatize computations in deterministic Turing machines (TMs). When applied to computations in non-deterministic TMs, this method may produce contradictor...
CORR
2011
Springer
13 years 14 days ago
2011
Springer
In [1], systems of weakening of intuitionistic negation logic called Zn and CZn were developed in the spirit of da Costa’s approach(c.f. [2]) by preserving, differently from da C...
IJAR
2008
13 years 5 months ago
2008
We introduce a general framework that is based on distance semantics and investigate the main properties of the entailment relations that it induces. It is shown that such entailm...
LANMR
2007
13 years 7 months ago
2007
Abstract We study the notion of strong equivalence between two disjunctive logic programs under the G3-stable model semantics, also called the P-stable semantics, and we show how s...