An Arithmetically Complete Predicate Modal Logic
This paper investigates a first-order extension of GL called \(\textup{ML}^3\). We outline briefly the history that led to \(\textup{ML}^3\), its key properties and some of its toolbox: the \emph{conservation theorem}, its cut-free Gentzenisation, the ``formulators'' tool. Its semantic com...
Main Authors: | Yunge Hao, George Tourlakis |
---|---|
Format: | Article |
Language: | English |
Published: |
Lodz University Press
2021-12-01
|
Series: | Bulletin of the Section of Logic |
Subjects: | |
Online Access: | https://czasopisma.uni.lodz.pl/bulletin/article/view/8441 |
Similar Items
-
Completeness of the First-Order Logic of Partial Quasiary Predicates with the Complement Composition
by: Mykola Nikitchenko, et al.
Published: (2019-09-01) -
Neutrosophic Modal Logic
by: Florentin Smarandache
Published: (2019-04-01) -
Switching theory : insight through predicate logic /
by: Vingron, Shimon Peter, 1936-
Published: (2004) -
Proof methods for modal and intuitionistic logics /
by: Fitting, Melvin, 1942-
Published: (1983) -
Fractional-Valued Modal Logic and Soft Bilateralism
by: Mario Piazza, et al.
Published: (2023-08-01)