Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
156 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Combining intermediate propositional logics with classical logic (1510.05326v1)

Published 19 Oct 2015 in cs.LO

Abstract: In [17], we introduced a modal logic, called $L$, which combines intuitionistic propositional logic $IPC$ and classical propositional logic $CPC$ and is complete w.r.t. an algebraic semantics. However, $L$ seems to be too weak for Kripke-style semantics. In this paper, we add positive and negative introspection and show that the resulting logic $L5$ has a Kripke semantics. For intermediate logics $I$, we consider the parametrized versions $L5(I)$ of $L5$ where $IPC$ is replaced by $I$. $L5(I)$ can be seen as a classical modal logic for the reasoning about truth in $I$. From our results, we derive a simple method for determining algebraic and Kripke semantics for some specific intermediate logics. We discuss some examples which are of interest for Computer Science, namely the Logic of Here-and-There, G\"odel-Dummett Logic and Jankov Logic. Our method provides new proofs of completeness theorems due to Hosoi, Dummett/Horn and Jankov, respectively.

Summary

We haven't generated a summary for this paper yet.