Department of Computer Science and Technology University of Peloponnese End of Karaiskaki Street, 22 100 Tripolis, Greece;
Graduate Programme in Logic, Algorithms and Computation (MPLA) Department of Mathematics, University of Athens Panepistimioupolis, 157 84 ILissia, Greece;
Department of Computer Science and Engineering University of Ioannina P.O. Box 1186, 45110 Ioannina, Greece;
Graduate Programme in Logic, Algorithms and Computation (MPLA) Department of Mathematics, University of Athens Panepistimioupolis, 157 84 ILissia, Greece;
default modality; majority modal logic; tableaux proof procedure;
机译:模态逻辑计算特性,复杂性和方法论的一步式设计
机译:地面和自由变量Tableaux用于量化模态逻辑的变体
机译:艾伦关于理性的关系的模态逻辑片段的可判定性和复杂性
机译:在“许多情况下”的方式:表格,可解密性,复杂性,变体
机译:统一模数公用列表函数讨论观察者理论的各种组合的模数复杂性和可判定性
机译:决定何时决定:时变顺序抽样模型解释人脑中基于价值的决策的出现
机译:标记模态表的相对复杂性