排序方式: 共有193条查询结果,搜索用时 15 毫秒
131.
Continuing work initiated by Jónsson, Daigneault, Pigozzi and others; Maksimova proved that a normal modal logic (with a single unary modality) has the Craig interpolation property iff the corresponding class of algebras has the superamalgamation property (cf. [Mak 91], [Mak 79]). The aim of this paper is to extend the latter result to a large class of logics. We will prove that the characterization can be extended to all algebraizable logics containing Boolean fragment and having a certain kind of local deduction property. We also extend this characterization of the interpolation property to arbitrary logics under the condition that their algebraic counterparts are discriminator varieties. We also extend Maksimova's result to normal multi-modal logics with arbitrarily many, not necessarily unary modalities, and to not necessarily normal multi-modal logics with modalities of ranks smaller than 2, too.The problem of extending the above characterization result to no n-normal non-unary modal logics remains open.Related issues of universal algebra and of algebraic logic are discussed, too. In particular we investigate the possibility of extending the characterization of interpolability to arbitrary algebraizable logics. 相似文献
132.
GL-Quantales: Q-Valued Sets and Their Singletons 总被引:1,自引:0,他引:1
Ulrich Höhle 《Studia Logica》1998,61(1):123-148
Q-valued sets are non-classical models of the formalized theory of identity with existence predicate based on the axioms of a non-commutative and non-idempotent logic. The singleton monad on the category of Q-valued sets is constructed, and elementary properties of T-algebras of the singleton monad are investigated. 相似文献
133.
We generalize the incompleteness proof of the modal predicate logic Q-S4+ p p + BF described in Hughes-Cresswell [6]. As a corollary, we show that, for every subframe logic Lcontaining S4, Kripke completeness of Q-L+ BF implies the finite embedding property of L. 相似文献
134.
This paper is a survey of V.A. Smirnovs main results in modern logic. 相似文献
135.
136.
This is a purely conceptual paper. It aims at presenting and putting into perspective the idea of a proof-theoretic semantics
of the logical operations. The first section briefly surveys various semantic paradigms, and Section 2 focuses on one particular
paradigm, namely the proof-theoretic semantics of the logical operations.
This revised version was published online in June 2006 with corrections to the Cover Date. 相似文献
137.
The aim of this paper is to apply properties of the double dual endofunctor on the category of bounded distributive lattices
and some extensions thereof to obtain completeness of certain non-classical propositional logics in a unified way. In particular,
we obtain completeness theorems for Moisil calculus, n-valued Łukasiewicz calculus and Nelson calculus. Furthermore we show some conservativeness results by these methods.
This revised version was published online in June 2006 with corrections to the Cover Date. 相似文献
138.
Wojciech Buszkowski 《Studia Logica》2007,87(2-3):145-169
We discuss the logic of pregroups, introduced by Lambek [34], and its connections with other type logics and formal grammars.
The paper contains some new ideas and results: the cut-elimination theorem and a normalization theorem for an extended system
of this logic, its P-TIME decidability, its interpretation in L1, and a general construction of (preordered) bilinear algebras and pregroups whose universe is an arbitrary monoid.
Special Issue Categorial Grammars and Pregroups Edited by
Wojciech Buszkowski and Anne Preller 相似文献
139.
Peter Verdée 《Synthese》2009,167(1):93-104
In this article complexity results for adaptive logics using the minimal abnormality strategy are presented. It is proven
here that the consequence set of some recursive premise sets is -complete. So, the complexity results in (Horsten and Welch, Synthese 158:41–60, 2007) are mistaken for adaptive logics using
the minimal abnormality strategy. 相似文献
140.
The paper aims at providing the multi-modal propositional logicLTK with a sound and complete axiomatisation. This logic combinestemporal and epistemic operators and focuses on m odeling thebehaviour of a set of agents operating in a system on the backgroundof a temporal framework. Time is represented as linear and discrete,whereas knowledge is modeled as an S5-like modality. A furthermodal operator intended to represent environment knowledge isadded to the system in order to achieve the expressive powersufficient to describe the piece of information available tothe agents at each moment in the flow of time. 相似文献