Decidable and undecidable logics with a binary modality
✍ Scribed by ágnes Kurucz; István Németi; Ildikó Sain; András Simon
- Publisher
- Springer Netherlands
- Year
- 1995
- Tongue
- English
- Weight
- 963 KB
- Volume
- 4
- Category
- Article
- ISSN
- 0925-8531
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
In classical propositional logic, a theory T is prime (i.e., for every pair of formulas F; G, either T F → G or T G → F) i it is complete. In Lukasiewicz inÿnite-valued logic the two notions split, completeness being stronger than primeness. Using toric desingularization algorithms and the ÿne struc
We generalise the result of [H. Ganzinger, C. Meyer, M. Veanes, The two-variable guarded fragment with transitive relations, in: Proc. 14th IEEE Symposium on Logic in Computer Science, IEEE Computer Society Press, 1999, pp. 24-34] on decidability of the two variable monadic guarded fragment of first
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