Stable canonical rules
| Authors |
|
|---|---|
| Publication date | 03-2016 |
| Journal | Journal of Symbolic Logic |
| Volume | Issue number | 81 | 1 |
| Pages (from-to) | 284-315 |
| Organisations |
|
| Abstract | We introduce stable canonical rules and prove that each normal modal multi-conclusion consequence relation is axiomatizable by stable canonical rules. We apply these results to construct finite refutation patterns for modal formulas, and prove that each normal modal logic is axiomatizable by stable canonical rules. We also define stable multi-conclusion consequence relations and stable logics and prove that these systems have the finite model property. We conclude the paper with a number of examples of stable and nonstable systems, and show how to axiomatize them. |
| Document type | Article |
| Note | © The Association for Symbolic Logic 2016 |
| Language | English |
| Published at | https://doi.org/10.1017/jsl.2015.54 |
| Downloads |
stable_canonical_rules
(Final published version)
|
| Permalink to this page | |