Results 261 to 270 of about 79,232 (299)
Some of the next articles are maybe not open access.

On the Finite Model Property of Non-normal Modal Logics

Logic, Rationality, and Interaction, 2023
Yu Peng, Yiheng Wang
semanticscholar   +1 more source

The decidable normal modal logics are not recursively enumerable

Journal of Philosophical Logic, 1985
The author uses a construction of Urquhart to show that there is no effective enumeration of algorithms which includes at least one for every decidable normal modal logic and no others. This also shows that the set of all recursive presentations which determine decidable modal logics is not recursively enumerable.
openaire   +1 more source

Sequent Calculi for Normal Modal Propositional Logics

Journal of Logic and Computation, 1994
This is a streamlined exposition of \textit{N. Belnap}'s display logic DL [J. Philos. Logic 11, 375-417 (1982; Zbl 0509.03008)]. DL can be seen as an encoding of a formalization introduced by \textit{S. Kripke} [Z. Math. Logik Grundlagen Math. 9, 67-96 (1963; Zbl 0118.013)] where finite systems of sequents \(S; \sigma_ 1 S_ 1; \sigma_ 2 S_ 2;\dots ...
openaire   +3 more sources

On detachment-substitutional formalization in normal modal logics

Studia Logica, 1977
The aim of this paper is to propose a criterion of finite detachment-substitutional formalization for normal modal systems. The criterion will comprise only those normal modal systems which are finitely axiomatizable by means of the substitution, detachment for material implication and Godel rules.
openaire   +2 more sources

On Independent Axiomatizability of Quasi-Normal Modal Logics

Studia Logica: An International Journal for Symbolic Logic, 2022
Igor Gorbunov, D. Shkatov
semanticscholar   +1 more source

Combining Monotone and Normal Modal Logic in Nested Sequents - with Countermodels

International Conference on Theorem Proving with Analytic Tableaux and Related Methods, 2019
Björn Lellmann
semanticscholar   +1 more source

A Deduction Theorem for Normal Modal Propositional Logic [PDF]

open access: possible, 2007
We develop a Hilbert style calculus for modal propositional logic which allows for the deduction theorem. Labels are used to keep track of both modalities that have been entered and assumptions that have been made. The main technical result of this paper is the equivalence of the labelled deductive calculus to the normal calculus for modal ...
openaire   +1 more source

Home - About - Disclaimer - Privacy