排序方式: 共有181条查询结果,搜索用时 15 毫秒
151.
内隐记忆的证明逻辑与加工分离说(PDP)的修正模型 总被引:3,自引:0,他引:3
讨论了内隐记忆的证明逻辑和内隐与外显测验中的意识和无意识影响问题。间接证明内隐记忆的逻辑应用在功能分离实验中。它的前提假设是记忆测验都是"纯净"的。直接证明逻辑应用在匹配比较实验中。它认为测验中的意识和无意识影响是并存的,Jacoby等人近期提出的加工分离说(PDP)在匹配比较法的基础上,将测验中的意识和无意识影响进行了分离,并借用经典测验理论的公式计算这两种影响。作者认为,按照概率论关于两个随机独立事件之和与积的运算法则,必须把包含测验(inclusiontest)的公式修正为Inclusion=R(1-a)+A(1-R)。修正过的PDP由四个方程组成。它不仅考虑了原PDP忽视的外显条件下的无意识缺失(1-a),而且可以更加确切地估计回忆概率(R)。这在数学理论上已找到了证据。 相似文献
152.
153.
We show how to use diagrams in order to obtain straightforward completeness theorems for extensions of K4.3 and a very simple and constructive proof of Bull's theorem: every normal extension of S4.3 has the finite model property. 相似文献
154.
155.
Part I of this paper is developed in the tradition of Stone-type dualities, where we present a new topological representation for general lattices (influenced by and abstracting over both Goldblatt's [17] and Urquhart's [46]), identifying them as the lattices of stable compact-opens of their dual Stone spaces (stability refering to a closure operator on subsets). The representation is functorial and is extended to a full duality.In part II, we consider lattice-ordered algebras (lattices with additional operators), extending the Jónsson and Tarski representation results [30] for Boolean algebras with Operators. Our work can be seen as developing, and indeed completing, Dunn's project of gaggle theory [13, 14]. We consider general lattices (rather than Boolean algebras), with a broad class of operators, which we dubb normal, and which includes the Jónsson-Tarski additive operators. Representation of l-algebras is extended to full duality.In part III we discuss applications in logic of the framework developed. Specifically, logics with restricted structural rules give rise to lattices with normal operators (in our sense), such as the Full Lambek algebras (F L-algebras) studied by Ono in [36]. Our Stone-type representation results can be then used to obtain canonical constructions of Kripke frames for such systems, and to prove a duality of algebraic and Kripke semantics for such logics. 相似文献
156.
Kripke bundle [3] and C-set semantics [1] [2] are known as semantics which generalize standard Kripke semantics. In [3] and in [1], [2] it is shown that Kripke bundle and C-set semantics are stronger than standard Kripke semantics. Also it is true that C-set semantics for superintuitionistic logics is stronger than Kripke bundle semantics [5].In this paper, we show that Q-S4.1 is not Kripke bundle complete via C-set models. As a corollary we can give a simple proof showing that C-set semantics for modal logics are stronger than Kripke bundle semantics. 相似文献
157.
Combining non-classical (or sub-classical) logics is not easy, but it is very interesting. In this paper, we combine nonclassical logics of negation and possibility (in the presence of conjunction and disjunction), and then we combine the resulting systems with intuitionistic logic. We will find that Kracht's results on the undecidability of classical modal logics generalise to a non-classical setting. We will also see conditions under which intuitionistic logic can be combined with a non-intuitionistic negation without corrupting the intuitionistic fragment of the logic. 相似文献
158.
Why Combine Logics? 总被引:1,自引:0,他引:1
Combining logics has become a rapidly expanding entreprise that is inspired mainly by concerns about modularity and the wish to join together tailor made logical tools into more powerful but still manageable ones. A natural question is whether it offers anything new over and above existing standard languages.By analysing a number of applications where combined logics arise, we argue that combined logics are a potentially valuable tool in applied logic, and that endorsements of standard languages often miss the point. Using the history of quantified modal logic as our main example, we also show that the use of combined structures and logics is a recurring theme in the analysis of existing logical systems. 相似文献
159.
In order to capture the concept of common knowledge, various extensions of multi-modal epistemic logics, such as fixed-point ones and infinitary ones, have been proposed. Although we have now a good list of such proposed extensions, the relationships among them are still unclear. The purpose of this paper is to draw a map showing the relationships among them. In the propositional case, these extensions turn out to be all Kripke complete and can be comparable in a meaningful manner. F. Wolter showed that the predicate extension of the Halpern-Moses fixed-point type common knowledge logic is Kripke incomplete. However, if we go further to an infinitary extension, Kripke completeness would be recovered. Thus there is some gap in the predicate case. In drawing the map, we focus on what is happening around the gap in the predicate case. The map enables us to better understand the common knowledge logics as a whole. 相似文献
160.
We present a general framework for proof systems for relational theories. We discuss principles of the construction of deduction rules and correspondences reflecting relationships between semantics of relational logics and the rules of the respective proof systems. We illustrate the methods developed in the paper with examples relevant for the Lambek calculus and some of its extensions. 相似文献