Labelled Calculi for Lattice-Based Modal Logics

Research output: Chapter in Book / Report / Conference proceedingConference contributionAcademicpeer-review

8 Downloads (Pure)

Abstract

We introduce labelled sequent calculi for the basic normal non-distri-butive modal logic and 31 of its axiomatic extensions, where the labels are atomic formulas of a first order language which is interpreted on the canonical extensions of the algebras in the variety corresponding to the logic. Modular proofs are presented that these calculi are all sound, complete and conservative w.r.t, and enjoy cut elimination and the subformula property. The introduction of these calculi showcases a general methodology for introducing labelled calculi for the class of LE-logics and their analytic axiomatic extensions in a principled and uniform way.

Original languageEnglish
Title of host publicationLogic and Its Applications
Subtitle of host publication10th Indian Conference, ICLA 2023, Indore, India, March 3–5, 2023, Proceedings
EditorsMohua Banerjee, A.V. Sreejith
PublisherSpringer Science and Business Media Deutschland GmbH
Pages23-47
Number of pages25
ISBN (Electronic)9783031266898
ISBN (Print)9783031266881
DOIs
Publication statusPublished - 2023
Event10th Indian Conference on Logic and Its Applications, ICLA 2023 - Indore, India
Duration: 3 Mar 20235 Mar 2023

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume13963 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference10th Indian Conference on Logic and Its Applications, ICLA 2023
Country/TerritoryIndia
CityIndore
Period3/03/235/03/23

Bibliographical note

Publisher Copyright:
© 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

Keywords

  • Algorithmic correspondence theory
  • Algorithmic proof theory
  • Labelled calculi
  • Non-distributive modal logic

Fingerprint

Dive into the research topics of 'Labelled Calculi for Lattice-Based Modal Logics'. Together they form a unique fingerprint.

Cite this