A cut-free sequent system for the smallest interpretability logic (Q1604800)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A cut-free sequent system for the smallest interpretability logic |
scientific article; zbMATH DE number 1764816
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A cut-free sequent system for the smallest interpretability logic |
scientific article; zbMATH DE number 1764816 |
Statements
A cut-free sequent system for the smallest interpretability logic (English)
0 references
8 July 2002
0 references
The interpretability logic IL is an extension of the provability logic GL with a binary modal operator \(\triangleright\) [cf. \textit{A. Visser}, CSLI Lect. Notes 87, 307-359 (1998; Zbl 0915.03020)]. In the paper under review the author gives a cut-free sequent system for the system IL. A cut-elimination theorem for IL is proved.
0 references
interpretability logic
0 references
cut-free sequent system
0 references
cut-elimination theorem
0 references
