A paraconsistent higher order logic
From MaRDI portal
Abstract: Classical logic predicts that everything (thus nothing useful at all) follows from inconsistency. A paraconsistent logic is a logic where an inconsistency does not lead to such an explosion, and since in practice consistency is difficult to achieve there are many potential applications of paraconsistent logics in knowledge-based systems, logical semantics of natural language, etc. Higher order logics have the advantages of being expressive and with several automated theorem provers available. Also the type system can be helpful. We present a concise description of a paraconsistent higher order logic with countable infinite indeterminacy, where each basic formula can get its own indeterminate truth value (or as we prefer: truth code). The meaning of the logical operators is new and rather different from traditional many-valued logics as well as from logics based on bilattices. The adequacy of the logic is examined by a case study in the domain of medicine. Thus we try to build a bridge between the HOL and MVL communities. A sequent calculus is proposed based on recent work by Muskens.
Recommendations
Cited in
(5)- Paraconsistent orbits of logics
- A paraconsistent extension of Sylvan’s logic
- Supra-logic: using transfinite type theory with type variables for paraconsistency
- scientific article; zbMATH DE number 7561490 (Why is no real title available?)
- scientific article; zbMATH DE number 7063489 (Why is no real title available?)
This page was built for publication: A paraconsistent higher order logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5464717)