Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
125 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

On Nested Sequents for Constructive Modal Logics (1505.06896v2)

Published 26 May 2015 in cs.LO

Abstract: We present deductive systems for various modal logics that can be obtained from the constructive variant of the normal modal logic CK by adding combinations of the axioms d, t, b, 4, and 5. This includes the constructive variants of the standard modal logics K4, S4, and S5. We use for our presentation the formalism of nested sequents and give a syntactic proof of cut elimination.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (3)
  1. Lutz Strassburger (12 papers)
  2. Anupam Das (36 papers)
  3. Ryuta Arisaka (19 papers)
Citations (35)

Summary

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