Sweet SIXTEEN: Automation via Embedding into Classical Higher-Order Logic
Journal Title: Logic and Logical Philosophy - Year 2016, Vol 25, Issue 4
Abstract
An embedding of many-valued logics based on SIXTEEN in classical higher-order logic is presented. SIXTEEN generalizes the four-valued set of truth degrees of Dunn/Belnap’s system to a lattice of sixteen truth degrees with multiple distinct ordering relations between them. The theoretical motivation is to demonstrate that many-valued logics, like other non-classical logics, can be elegantly modeled (and even combined) as fragments of classical higher-order logic. Equally relevant are the pragmatic aspects of the presented approach: interactive and automated reasoning in many-valued logics, which have broad applications in computer science, artificial intelligence, linguistics, philosophy and mathematics, become readily enabled with state of the art reasoning tools for classical higher-order logic.
Authors and Affiliations
Alexander Steen, Christoph Benzmüller
Composition, identity, and emergence
Composition as Identity (CAI) is the thesis that a whole is, strictly and literally, identical to its parts, considered collectively. McDaniel [2008] argues against CAI in that it prohibits emergent properties. Recently...
Relational semantics for the 4-valued relevant logics BN4 and E4
The logic BN4 was defined by R.T. Brady in 1982. It can be considered as the 4-valued logic of the relevant conditional. E4 is a variant of BN4 that can be considered as the 4-valued logic of (relevant) entailment. The a...
The Case of Dialetheism
The concept of dialetheia and the claim of dialetheism has been examined and compared to such related concept as contradiction, antinomy, consistency and paraconsistency. Dialetheia is a true contradiction and dialetheis...
Mereology and truth-making
Many mereological propositions are true contingently, so we are entitled to ask why they are true. One frequently given type of answer to such questions evokes truth-makers, that is, entities in virtue of whose existence...
Simple cut elimination proof for hybrid logic
In the paper we present a relatively simple proof of cut elimination theorem for variety of hybrid logics in the language with satisfaction operators and universal modality. The proof is based on the strategy introduced...