Papers
Topics
Authors
Recent
Search
2000 character limit reached

Routley Star in Information-Based Semantics

Published 14 Apr 2022 in cs.LO | (2204.06738v1)

Abstract: It is common in various non-classical logics, especially in relevant logics, to characterize negation semantically via the operation known as Routley star. This operation works well within relational semantic frameworks based on prime theories. We study this operation in the context of "information-based" semantics for which it is characteristic that sets of formulas supported by individual information states are theories that do not have to be prime. We will show that, somewhat surprisingly, the incorporation of Routley star into the information-based semantics does not lead to a collapse or a trivialization of the whole semantic system. On the contrary, it leads to a technically elegant though quite restricted semantic framework that determines a particular logic. We study some basic properties of this semantics. For example, we show that within this framework double negation law is valid only in involutive linear frames. We characterize axiomatically the logic of all linear frames and show that the logic of involutive linear frames coincides with a system that Mike Dunn coined Kalman logic. This logic is the fragment (for the language restricted to conjunction, disjunction and negation) of the "semi-relevant" logic known as R-mingle. Finally, we characterize by a deductive system the logic of all information frames equipped with Routley star.

Citations (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.