排序方式: 共有220条查询结果,搜索用时 686 毫秒
121.
The present paper is a study in abstract algebraic logic. We investigate the correspondence between the metalogical Beth property
and the algebraic property of surjectivity of epimorphisms. It will be shown that this correspondence holds for the large
class of equivalential logics. We apply our characterization theorem to relevance logics and many-valued logics.
Dedicated to the memory of Willem Johannes Blok 相似文献
122.
We investigate the complexity of the model checking problem for hybrid logics. We provide model checking algorithms for various hybrid fragments and we prove PSPACE-completeness for hybrid fragments including binders. We complement and motivate our complexity results with an application of model checking in hybrid logic to the problems of query and constraint evaluation for semistructured data. 相似文献
123.
124.
125.
MV*--Algebras 总被引:1,自引:0,他引:1
126.
We study the matrices, reduced matrices and algebras associated to the systems SAT of structural annotated logics. In previous papers, these systems were proven algebraizable in the finitary case and the class of matrices analyzed here was proven to be a matrix semantics for them.We prove that the equivalent algebraic semantics associated with the systems SAT are proper quasivarieties, we describe the reduced matrices, the subdirectly irreducible algebras and we give a general decomposition theorem. As a consequence we obtain a decision procedure for these logics. 相似文献
127.
In a famous and controversial paper, B. H. Slater has argued against the possibility of paraconsistent logics. Our reply is centred on the distinction between two aspects of the meaning of a logical constant *c* in a given logic: its operational meaning, given by the operational rules for *c* in a cut-free sequent calculus for the logic at issue, and its global meaning, specified by the sequents containing *c* which can be proved in the same calculus. Subsequently, we use the same strategy to counter Quine's meaning variance argument against deviant logics. In a nutshell, we claim that genuine rivalry between (similar) logics *L* and *L* is possible whenever each constant in *L* has the same operational meaning as its counterpart in *L* although differences in global meaning arise in at least one case. 相似文献
128.
Riccardo Rosati 《Studia Logica》2001,69(1):171-191
We define a tableau calculus for the logic of only knowing and knowing at most ON, which is an extension of Levesque's logic of only knowing O. The method is based on the possible-world semantics of the logic ON, and can be considered as an extension of known tableau calculi for modal logic K45. From the technical viewpoint, the main features of such an extension are the explicit representation of "unreachable" worlds in the tableau, and an additional branch closure condition implementing the property that each world must be either reachable or unreachable. The calculus allows for establishing the computational complexity of reasoning about only knowing and knowing at most. Moreover, we prove that the method matches the worst-case complexity lower bound of the satisfiability problem for both ON and O. With respect to [22], in which the tableau calculus was originally presented, in this paper we both provide a formal proof of soundness and completeness of the calculus, and prove the complexity results for the logic ON. 相似文献
129.
130.
We present a new prefixed tableau system for verification of validity in modal logic . The system is deterministic, it uniquely generates exactly one proof tree for each clausal representation of formulas, and, moreover, it uses some syntactic reductions of prefixes. is defined in the original methodology of tableau systems, without any external technique such as backtracking, backjumping, etc. Since all the necessary bookkeeping is built into the rules, the system is not only a basis for a validity algorithm, but is itself a decision procedure. We present also a deterministic tableau decision procedure which is an extension of and can be used for the global assumptions problem. 相似文献