On decidable consequence operators
✍ Scribed by Jarosław Achinger; Andrzej W. Jankowski
- Publisher
- Springer Netherlands
- Year
- 1986
- Tongue
- English
- Weight
- 575 KB
- Volume
- 45
- Category
- Article
- ISSN
- 0039-3215
No coin nor oath required. For personal study only.
✦ Synopsis
The main theorem says that a consequence operator is an effective part o~ the consequence operator ~or the classical propositional calculus iff it is a consequence operator ~or a logic satisfying the compactness theorem, and in which every finitely axiomatizable theory is decidable.
📜 SIMILAR VOLUMES
In [5, 61 a criterion for the undecidability of second order theories of classes of graphs is introduced. This criterion leads to a "measure of complexity" of a class of graphs. In this note we introduce some graph theoretical operations and prove that the class of all graphs which have the smallest
This paper studies ÿnitary modal logics, interpreted over coalgebras for an endofunctor, and establishes soundness, completeness and decidability results. The logics are studied within the abstract framework of coalgebraic modal logic, which can be instantiated with arbitrary endofunctors on the cat