Proof theory for indexed nested sequents

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

Abstract

Fitting’s indexed nested sequents can be used to give deductive systems to modal logics which cannot be captured by pure nested sequents. In this paper we show how the standard cut-elimination procedure for nested sequents can be extended to indexed nested sequents, and we discuss how indexed nested sequents can be used for intuitionistic modal logics.

Original languageEnglish
Title of host publicationAutomated Reasoning with Analytic Tableaux and Related Methods - 26th International Conference, TABLEAUX 2017, Proceedings
EditorsClaudia Nalon, Renate A. Schmidt
PublisherSpringer Verlag
Pages81-97
Number of pages17
ISBN (Print)9783319669014
DOIs
Publication statusPublished - 1 Jan 2017
Event26th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods, TABLEAUX 2017 - Brasilia, Brazil
Duration: 25 Sept 201728 Sept 2017

Publication series

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

Conference

Conference26th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods, TABLEAUX 2017
Country/TerritoryBrazil
CityBrasilia
Period25/09/1728/09/17

Fingerprint

Dive into the research topics of 'Proof theory for indexed nested sequents'. Together they form a unique fingerprint.

Cite this