全文获取类型
收费全文 | 899篇 |
免费 | 15篇 |
国内免费 | 3篇 |
专业分类
917篇 |
出版年
2023年 | 4篇 |
2022年 | 5篇 |
2021年 | 3篇 |
2020年 | 12篇 |
2019年 | 9篇 |
2018年 | 5篇 |
2017年 | 4篇 |
2016年 | 30篇 |
2015年 | 9篇 |
2014年 | 19篇 |
2013年 | 42篇 |
2012年 | 5篇 |
2011年 | 5篇 |
2010年 | 9篇 |
2009年 | 45篇 |
2008年 | 71篇 |
2007年 | 71篇 |
2006年 | 57篇 |
2005年 | 71篇 |
2004年 | 55篇 |
2003年 | 57篇 |
2002年 | 58篇 |
2001年 | 39篇 |
2000年 | 58篇 |
1999年 | 38篇 |
1998年 | 32篇 |
1997年 | 33篇 |
1996年 | 21篇 |
1995年 | 20篇 |
1994年 | 5篇 |
1993年 | 3篇 |
1992年 | 3篇 |
1991年 | 3篇 |
1990年 | 4篇 |
1989年 | 3篇 |
1988年 | 6篇 |
1987年 | 3篇 |
排序方式: 共有917条查询结果,搜索用时 15 毫秒
181.
TIM HEYSSE 《Argumentation》1997,11(2):211-224
Philosophically, the study of argumentation is important because it holds out the prospect of an interpretation of rationality. For this we need to identify a transcendent perspective on the argumentative interaction. We need a normative theory of argumentation that provides an answer to the question: should the hearer accept the argument of the speaker. In this article I argue that formal logic implies a notion of transcendence that is not suitable for the study of argumentation, because, from a logical point of view, argumentation disappears from sight. We should therefore not expect formal logic to provide an interesting interpretation of the rationality intrinsic in argument and discussion. 相似文献
182.
JAN SMEDSLUND 《Scandinavian journal of psychology》1990,31(2):110-120
Tversky and Kahneman explain cognitive errors in terms of either misunderstanding or fallacy , but have failed to define these concepts. Therefore, they are unable to derive strict diagnostic criteria for distinguishing between them. The lack of conceptual clarification also has prevented them from recognizing the circular relationship between understanding and logicality. Diagnosis of understanding presupposes logicality, and diagnosis of logicality presupposes understanding. This circularity follows when understanding is defined as grasping what is and is not logically implied by a given expression as intended, and when fallacy is defined as logical error. Alternative definitions are discussed and rejected. Tversky and Kahneman fail to realize that one cannot explain and understand what is genuinely illogical, and that, therefore, errors must always be regarded as failure to understand, that is, as logical inference from erroneous premises. 相似文献
183.
Lenore Langsdorf 《Argumentation》1990,4(3):259-268
The interpretation of discourse covers a continuum with two extremes: on the one hand, a text considered as an ideal, distant object, and on the other hand, a conversation regarded as a real, present event. On the basis of a distinction between relatively context-invariant propositions and relatively context-dependent statements, it is argued that statements in conversational discourse are easier to interpret than statements in texts, whereas only propositions in symbolic logic can be interpreted with exactitude. In the same way, the interpretation of dialogical arguments proceeds more easily than the interpretation of arguments in texts. While dialogical argumentation requires a dialectical approach, textual argumentation necessitates an imaginative reconstruction of the argument. From this it can be concluded that for different sorts of argumentative discourse diverse sorts of interpretative activities have to be used. 相似文献
184.
185.
186.
涵义语义与关于概称句推理的词项逻辑 总被引:1,自引:0,他引:1
概称句推理具有以词项为单位的特征并且词项的涵义在其中起到了重要的作用。已有的处理用A一表达式表达涵义,不够简洁和自然。亚里斯多德三段论是一种词项逻辑,但它是外延的和单调的。这两方面的情况使得有必要考虑新的词项逻辑。涵义语义的基本观点是:语词首先表达的是涵义,通过涵义的作用,语词有了指称,表达概念。概称句三段论是更为常用的推理,有两个基本形式GAG和Gaa。在涵义语义的基础上建立的系统GAG和Gaa是关于这两种推理的公理系统。 相似文献
187.
The addition of actually operators to modal languages allows us to capture important inferential behaviours which cannot be adequately captured in logics formulated in simpler languages. Previous work on modal logics containing actually operators has concentrated entirely upon extensions of KT5 and has employed a particular model-theoretic treatment of them. This paper proves completeness and decidability results for a range of normal and nonnormal but quasi-normal propositional modal logics containing actually operators, the weakest of which are conservative extensions of K, using a novel generalisation of the standard semantics. 相似文献
188.
There has been considerable work on practical reasoning in artificial intelligence and also in philosophy. Typically, such
reasoning includes premises regarding means–end relations. A clear semantics for such relations is needed in order to evaluate
proposed syllogisms. In this paper, we provide a formal semantics for means–end relations, in particular for necessary and
sufficient means–end relations. Our semantics includes a non-monotonic conditional operator, so that related practical reasoning
is naturally defeasible. This work is primarily an exercise in conceptual analysis, aimed at clarifying and eventually evaluating
existing theories of practical reasoning (pending a similar analysis regarding desires, intentions and other relevant concepts).
“They were in conversation without speaking. They didn’t need to speak. They just changed reality so that they had spoken.”
Terry Pratchett, Reaper Man 相似文献
189.
Lawrence S. Moss 《Journal of Philosophical Logic》2007,36(6):605-640
This paper obtains the weak completeness and decidability results for standard systems of modal logic using models built from
formulas themselves. This line of work began with Fine (Notre Dame J. Form. Log. 16:229–237, 1975). There are two ways in
which our work advances on that paper: First, the definition of our models is mainly based on the relation Kozen and Parikh
used in their proof of the completeness of PDL, see (Theor. Comp. Sci. 113–118, 1981). The point is to develop a general model-construction
method based on this definition. We do this and thereby obtain the completeness of most of the standard modal systems, and
in addition apply the method to some other systems of interest. None of the results use filtration, but in our final section
we explore the connection. 相似文献
190.
We investigate computational properties of propositional logics for dynamical systems. First, we consider logics for dynamic topological systems (W.f), fi, where W is a topological space and f a homeomorphism on W. The logics come with ‘modal’ operators interpreted by the topological closure and interior, and temporal operators interpreted along the orbits {w, f(w), f2
(w), ˙˙˙} of points w ε W. We show that for various classes of topological spaces the resulting logics are not recursively enumerable (and so not recursively axiomatisable). This gives a ‘negative’ solution to a conjecture of Kremer and Mints. Second, we consider logics for dynamical systems (W, f), where W is a metric space and f and isometric function. The operators for topological interior/closure are replaced by distance operators of the form ‘everywhere/somewhere in the ball of radius a, ‘for a ε Q
+. In contrast to the topological case, the resulting logic turns out to be decidable, but not in time bounded by any elementary function. 相似文献