A Sequent Calculus for a Paraconsistent Nonmonotonic Logic ?
نویسنده
چکیده
In spite of sequent calculus being an appealing tool for describing logical systems, its use along with nonmonotonic logics has been largely neglected. Reasons may be the hardness in implementing a context sensitive mechanism able to detect changes in the theory. This seems to brake the locality of context of sequent rules. Nevertheless, a nonmo-notonic sequent calculus may be helpful if results obtained from other sequent calculus in formalising logical systems are here inherited. Furthermore , against the main trend, we make use of non-classical logics in formalising the deductive part of the reasoning. Here, this nonmonotonic basis is a paraconsistent logic of epistemic inconsistency, LEI, especially designed to deal with contradictions introduced by the reasoning under incomplete knowledge whereas the nonmonotonic part is performed by the inconsistent default logic, IDL. Thus, to provide an uniform description for the system IDL/LEI, in the sequent calculus style, is the aim of the present paper.
منابع مشابه
Nonmonotonic Skeptical Consequence Relation in Constrained Default Logic
This paper presents a study of the nonmonotonic consequence relation which models the skeptical reasoning formalised by constrained default logic. The nonmonotonic skeptical consequence relation is defined using the sequent calculus axiomatic system. We study the formal properties desirable for a “good” nonmonotonic relation: supraclassicality, cut, cautious monotony, cumulativity, absorption, ...
متن کاملAxiomatization of Credulous Reasoning in Rational Default Logic
Nonmonotonic reasoning is succesfully formalized by the class of default logics. In this paper we introduce an axiomatic system for credulous reasoning in rational default logic. Based on classical sequent calculus and anti-sequent calculus, an abstract characterization of credulous nonmonotonic default inference in this variant of default logic is presented.
متن کاملAutomated Support for the Investigation of Paraconsistent and Other Logics
We automate the construction of analytic sequent calculi and effective semantics for a large class of logics formulated as Hilbert calculi. Our method applies to infinitely many logics, which include the family of paraconsistent C-systems, as well as to other logics for which neither analytic calculi nor suitable semantics have so far been available.
متن کاملOn All Strong Kleene Generalizations of Classical Logic
By using the notions of exact truth (‘true and not false’) and exact falsity (‘false and not true’), one can give 16 distinct definitions of classical consequence. This paper studies the class of relations that results from these definitions in settings that are paracomplete, paraconsistent or both and that are governed by the (extended) Strong Kleene schema. Besides familiar logics such as Str...
متن کاملWintein On All Strong Kleene Generalizations of Classical Logic
By using the notions of exact truth (‘true and not false’) and exact falsity (‘false and not true’), one can give 16 distinct definitions of classical consequence. This paper studies the class of relations that results from these definitions in settings that are paracomplete, paraconsistent or both and that are governed by the (extended) Strong Kleene schema. Besides familiar logics such as Str...
متن کامل