A Paraconsistent Higher Order Logic
| dc.creator | Villadsen, Jørgen | |
| dc.date | 2002-07-25 | |
| dc.date | 2003-12-26 | |
| dc.date.accessioned | 2026-07-07T03:18:44Z | |
| dc.date.available | 2026-07-07T03:18:44Z | |
| dc.description | 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. | |
| dc.description | Originally in the proceedings of PCL 2002, editors Hendrik Decker, Joergen Villadsen, Toshiharu Waragai (http://floc02.diku.dk/PCL/). Corrected | |
| dc.identifier | https://arxiv.org/abs/cs/0207088 | |
| dc.identifier | http://arxiv.org/abs/cs/0207088 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/31237 | |
| dc.subject | Logic in Computer Science | |
| dc.subject | Artificial Intelligence | |
| dc.subject | F.4.1; I.2.4; I.2.1 | |
| dc.title | A Paraconsistent Higher Order Logic | |
| dc.type | text |