Saved in:
Bibliographic Details
Main Authors: Omori, Hitoshi, Arenhart, Jonas R. B.
Format: Preprint
Published: 2024
Subjects:
Online Access:https://arxiv.org/abs/2501.00499
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866929653944418304
author Omori, Hitoshi
Arenhart, Jonas R. B.
author_facet Omori, Hitoshi
Arenhart, Jonas R. B.
contents In this paper, we elaborate on the ordered-pair semantics originally presented by Matthew Clemens for LP (Priest's Logic of Paradox). For this purpose, we build on a generalization of Clemens semantics to the case of n-tuple semantics, for every n. More concretely, i) we deal with the case of a language with quantifiers, and ii) we consider philosophical implications of the semantics. The latter includes, first, a reading of the semantics in epistemic terms, involving multiple agents. Furthermore, we discuss the proper understanding of many-valued logics, namely LP and K3 (Kleene strong 3-valued logic), from the perspective of classical logic, along the lines suggested by Susan Haack. We will also discuss some applications of the semantics to issues related to informative contradictions, i.e. contradictions involving quantification over different respects a vague predicate may have, as advanced by Paul Égré, and also to the mixed consequence relations, promoted by Pablo Cobreros, Paul Égré, David Ripley and Robert van Rooij.
format Preprint
id arxiv_https___arxiv_org_abs_2501_00499
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle The Power of Generalized Clemens Semantics
Omori, Hitoshi
Arenhart, Jonas R. B.
Logic in Computer Science
In this paper, we elaborate on the ordered-pair semantics originally presented by Matthew Clemens for LP (Priest's Logic of Paradox). For this purpose, we build on a generalization of Clemens semantics to the case of n-tuple semantics, for every n. More concretely, i) we deal with the case of a language with quantifiers, and ii) we consider philosophical implications of the semantics. The latter includes, first, a reading of the semantics in epistemic terms, involving multiple agents. Furthermore, we discuss the proper understanding of many-valued logics, namely LP and K3 (Kleene strong 3-valued logic), from the perspective of classical logic, along the lines suggested by Susan Haack. We will also discuss some applications of the semantics to issues related to informative contradictions, i.e. contradictions involving quantification over different respects a vague predicate may have, as advanced by Paul Égré, and also to the mixed consequence relations, promoted by Pablo Cobreros, Paul Égré, David Ripley and Robert van Rooij.
title The Power of Generalized Clemens Semantics
topic Logic in Computer Science
url https://arxiv.org/abs/2501.00499