摘要
本文试图解决有穷深度的传递的濒表格逻辑的公理化问题.这是作者之前所解决的传递的濒表格逻辑判据工作的后继.本文使用了模态逻辑的先进技术典范公式来解决NExtK4格(即传递逻辑格)中的每一个有穷深度濒表格逻辑的公理化问题.我们所得到的结论不仅是它们的有穷可公理化,更是如何可公理化的可操作性方法.这种可操作性方法是和模型密切相关的.
Abstract
This paper attempts to resolve the problem of how to axiomatize transitive pretab-ular logics of finite depth.It is the follow-up work on transitive pretabular logics after the crieria for transitive pretabular logics.This paper uses canonical formulas to axiomatize each pretabular logic of finite depth in NExtK4.
基金项目
Fundamental Research Funds for the Central Universities(410500139)
维普
万方数据