### 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 countably infinite indeterminacy, where each basic formula can get its own indeterminate truth value. The meaning of the logical operators is new and rather different from traditional many-valued logics as well as from logics based on bilattices. Thus we try to build a bridge between the communities of higher order logic and many-valued logic. A case study is studied and a sequent calculus is proposed based on recent work by Muskens

Original language | English |
---|---|

Title of host publication | A Paraconsistent Higher Order Logic : Artificial Intelligence and Symbolic Computation |

Publisher | Springer |

Publication date | 2004 |

Pages | 38-51 |

ISBN (Print) | 978-3-540-23212-4 |

DOIs | |

Publication status | Published - 2004 |

Externally published | Yes |

Event | 7th International Conference on Artificial Intelligence and Symbolic Computation (AISC 2004) - Linz, Austria Duration: 22 Sep 2004 → 24 Sep 2004 |

### Conference

Conference | 7th International Conference on Artificial Intelligence and Symbolic Computation (AISC 2004) |
---|---|

Country | Austria |

City | Linz |

Period | 22/09/2004 → 24/09/2004 |

Series | Lecture Notes in Computer Science |
---|---|

Volume | 3249 |

ISSN | 0302-9743 |

## Cite this

Villadsen, J. (2004). A Paraconsistent Higher Order Logic. In

*A Paraconsistent Higher Order Logic: Artificial Intelligence and Symbolic Computation*(pp. 38-51). Springer. Lecture Notes in Computer Science, Vol.. 3249 https://doi.org/10.1007/978-3-540-30210-0_5