Abstract
The main goal of the paper is to suggest some analytic proof systems for LC and its finite-valued counterparts which are suitable for proof-search. This goal is achieved through following the general Rasiowa-Sikorski methodology for constructing analytic proof systems for semantically-defined logics. All the systems presented here are terminating, contraction-free, and based on invertible rules, which have a local character and at most two premises.
Original language | English |
---|---|
Pages (from-to) | 197-219 |
Number of pages | 23 |
Journal | Studia Logica |
Volume | 69 |
Issue number | 2 |
DOIs | |
State | Published - 2001 |
Keywords
- Analytic rules
- Decomposition Systems
- Fuzzy Logics
- Gentzen-type systems
- Gödel Logics
- Hypersequents
- Intermediate Logics
- Tableaux