Sequent systems for modal logics

H Wansing - Handbook of Philosophical Logic: Volume 8, 2002 - Springer
[T] he framework of ordinary sequents is not capable of handling all interesting logics. There
are logics with nice, simple semantics and obvious interest for which no decent, cut-free …

The proof theory and semantics of intuitionistic modal logic

AK Simpson - 1994 - era.ed.ac.uk
Possible world semantics underlies many of the applications of modal logic in computer
science and philosophy. The standard theory arises from interpreting the semantic …

Tableau methods for modal and temporal logics

R Goré - Handbook of tableau methods, 1999 - Springer
Modal and temporal logics are finding new and varied applications in Computer Science in
fields as diverse as Artificial Intelligence [Marek et al., 1991], Models for Concurrency …

[图书][B] Labelled non-classical logics

L Vigano - 2013 - books.google.com
I am very happy to have this opportunity to introduce Luca Vigano's book on Labelled Non-
Classical Logics. I put forward the methodology of labelled deductive systems to the …

On an intuitionistic modal logic

GM Bierman, VCV de Paiva - Studia Logica, 2000 - Springer
In this paper we consider an intuitionistic variant of the modal logic S4 (which we call IS4).
The novelty of this paper is that we place particular importance on the natural deduction …

[图书][B] Gentzen calculi for modal propositional logic

F Poggiolesi - 2010 - books.google.com
The book is about Gentzen calculi for (the main systems of) modal logic. It is divided into
three parts. In the first part we introduce and discuss the main philosophical ideas related to …

[图书][B] Displaying modal logic

H Wansing - 2013 - books.google.com
The present monograph is a slightly revised version of my Habilitations schrift Proof-
theoretic Aspects of Intensional and Non-Classical Logics, successfully defended at Leipzig …

A new one-pass tableau calculus for PLTL

S Schwendimann - … Conference on Automated Reasoning with Analytic …, 1998 - Springer
The paper presents a one-pass tableau calculus PLTL T for the propositional linear time
logic PLTL. The calculus is correct and complete and unlike in previous decision methods …

Computational types from a logical perspective

PN Benton, GM Bierman… - Journal of Functional …, 1998 - cambridge.org
Moggi's computational lambda calculus is a metalanguage for denotational semantics which
arose from the observation that many different notions of computation have the categorical …

Sequents and trees

A Indrzejczak - Studies in Universal Logic, Birkhäuser, Cham, 2021 - Springer
There are a lot of excellent works in proof theory using various forms of Sequent Calculi (SC)
as the basic formal systems. 1 This book is of a different character. It is not a systematic …