成为并分裂的可判定性
Decidability of Being a Union-splitting
AI总结:
本文证明了正规模态逻辑格中并分裂性质的可判定性,通过有限模态代数刻画,并进一步证明公理化问题与公式可判定性的可判定性,解决两个开放问题。
摘要:
许多逻辑性质已知对于正规模态逻辑是不可判定的,但少数例外如一致性和与$\mathsf{K}$的一致性除外。本文证明了在正规模态逻辑格$\mathsf{NExt}\mathsf{K}$中,成为并分裂的性质是可判定的,从而回答了开放问题[WZ07, Problem 2]。这是通过提供并分裂在有限模态代数上的语义刻画来实现的。此外,通过阐明与并分裂的联系,我们证明了在$\mathsf{NExt}\mathsf{K}$中,具有可判定的公理化问题和成为(不可)判定公式也是可判定的。后者回答了$\mathsf{NExt}\mathsf{K}$的[CZ97, Problem 17.3]。
英文摘要:
Many logical properties are known to be undecidable for normal modal logics, with few exceptions such as consistency and coincidence with $\mathsf{K}$. This paper shows that the property of being a union-splitting in $\mathsf{NExt}\mathsf{K}$, the lattice of normal modal logics, is decidable, thus answering the open problem [WZ07, Problem 2]. This is done by providing a semantic characterization of union-splittings in terms of finite modal algebras. Moreover, by clarifying the connection to union-splittings, we show that in $\mathsf{NExt}\mathsf{K}$, having a decidable axiomatization problem and being a (un)decidable formula are also decidable. The latter answers [CZ97, Problem 17.3] for $\mathsf{NExt}\mathsf{K}$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。