全文获取类型
收费全文 | 247篇 |
免费 | 5篇 |
国内免费 | 10篇 |
出版年
2021年 | 1篇 |
2020年 | 2篇 |
2019年 | 1篇 |
2018年 | 2篇 |
2017年 | 10篇 |
2016年 | 5篇 |
2015年 | 4篇 |
2014年 | 6篇 |
2013年 | 5篇 |
2011年 | 2篇 |
2010年 | 7篇 |
2009年 | 10篇 |
2008年 | 15篇 |
2007年 | 16篇 |
2006年 | 23篇 |
2005年 | 27篇 |
2004年 | 16篇 |
2003年 | 13篇 |
2002年 | 16篇 |
2001年 | 16篇 |
2000年 | 15篇 |
1999年 | 6篇 |
1998年 | 10篇 |
1997年 | 21篇 |
1996年 | 7篇 |
1995年 | 1篇 |
1994年 | 2篇 |
1993年 | 1篇 |
1992年 | 1篇 |
1989年 | 1篇 |
排序方式: 共有262条查询结果,搜索用时 15 毫秒
111.
Dorota Leszczyńska-Jasion 《Journal of Philosophical Logic》2009,38(2):151-177
The aim of this paper is to present a loop-free decision procedure for modal propositional logics K4, S4 and S5. We prove that the procedure terminates and that it is sound and complete. The procedure is based on the method of Socratic
proofs for modal logics, which is grounded in the logic of questions IEL. 相似文献
112.
Josep Maria Font 《Studia Logica》2009,91(3):383-406
This is a contribution to the discussion on the role of truth degrees in manyvalued logics from the perspective of abstract
algebraic logic. It starts with some thoughts on the so-called Suszko’s Thesis (that every logic is two-valued) and on the
conception of semantics that underlies it, which includes the truth-preserving notion of consequence. The alternative usage
of truth values in order to define logics that preserve degrees of truth is presented and discussed. Some recent works studying
these in the particular cases of Łukasiewicz’s many-valued logics and of logics associated with varieties of residuated lattices
are also presented. Finally the extension of this paradigm to other, more general situations is discussed, highlighting the
need for philosophical or applied motivations in the selection of the truth degrees, due both to the interpretation of the
idea of truth degree and to some mathematical difficulties. 相似文献
113.
In the paper we examine the use of non-classical truth values for dealing with computation errors in program specification
and validation. In that context, 3-valued McCarthy logic is suitable for handling lazy sequential computation, while 3-valued
Kleene logic can be used for reasoning about parallel computation. If we want to be able to deal with both strategies without
distinguishing between them, we combine Kleene and McCarthy logics into a logic based on a non-deterministic, 3-valued matrix,
incorporating both options as a non-deterministic choice. If the two strategies are to be distinguished, Kleene and McCarthy
logics are combined into a logic based on a 4-valued deterministic matrix featuring two kinds of computation errors which
correspond to the two computation strategies described above. For the resulting logics, we provide sound and complete calculi
of ordinary, two-valued sequents.
Presented by Yaroslav Shramko and Heinrich Wansing 相似文献
114.
Knowledge on Treelike Spaces 总被引:1,自引:0,他引:1
This paper presents a bimodal logic for reasoning about knowledge during knowledge acquisitions. One of the modalities represents (effort during) non-deterministic time and the other represents knowledge. The semantics of this logic are tree-like spaces which are a generalization of semantics used for modeling branching time and historical necessity. A finite system of axiom schemes is shown to be canonically complete for the formentioned spaces. A characterization of the satisfaction relation implies the small model property and decidability for this system. 相似文献
115.
In [14] we used the term finitely algebraizable for algebraizable logics in the sense of Blok and Pigozzi [2] and we introduced possibly infinitely algebraizable, for short, p.i.-algebraizable logics. In the present paper, we characterize the hierarchy of protoalgebraic, equivalential, finitely equivalential, p.i.-algebraizable, and finitely algebraizable logics by properties of the Leibniz operator. A Beth-style definability result yields that finitely equivalential and finitely algebraizable as well as equivalential and p.i.-algebraizable logics can be distinguished by injectivity of the Leibniz operator. Thus, from a characterization of equivalential logics we obtain a new short proof of the main result of [2] that a finitary logic is finitely algebraizable iff the Leibniz operator is injective and preserves unions of directed systems. It is generalized to nonfinitary logics. We characterize equivalential and, by adding injectivity, p.i.-algebraizable logics. 相似文献
116.
It is shown that de re formulas are eliminable in the modal logic S5 extended with the axiom scheme x x. 相似文献
117.
Cluster differences scaling with a within-clusters loss component and a fuzzy successive approximation strategy to avoid local minima 总被引:2,自引:0,他引:2
Cluster differences scaling is a method for partitioning a set of objects into classes and simultaneously finding a low-dimensional spatial representation ofK cluster points, to model a given square table of dissimilarities amongn stimuli or objects. The least squares loss function of cluster differences scaling, originally defined only on the residuals of pairs of objects that are allocated to different clusters, is extended with a loss component for pairs that are allocated to the same cluster. It is shown that this extension makes the method equivalent to multidimensional scaling with cluster constraints on the coordinates. A decomposition of the sum of squared dissimilarities into contributions from several sources of variation is described, including the appropriate degrees of freedom for each source. After developing a convergent algorithm for fitting the cluster differences model, it is argued that the individual objects and the cluster locations can be jointly displayed in a configuration obtained as a by-product of the optimization. Finally, the paper introduces a fuzzy version of the loss function, which can be used in a successive approximation strategy for avoiding local minima. A simulation study demonstrates that this strategy significantly outperforms two other well-known initialization strategies, and that it has a success rate of 92 out of 100 in attaining the global minimum. 相似文献
118.
广松涉认为,对近代认识论基础的问题式及其构成机制和局限进行反思,首先需要将着眼点放在康德哲学的问题式及其构成机制上。康德哲学的总的问题式就是在以先验逻辑学为基础的逻辑学、认识论和本体论“三位一体”的哲学构架中,探讨人的认识以及纯粹理性的先天综合判断及其能力何以可能。这一问题式潜含着一个意义非常重大的认识论问题——即“主体际共同主观性”问题.需要我们认真地加以研究。 相似文献
119.
120.
Two types of multiple-conclusion systems 总被引:1,自引:0,他引:1