全文获取类型
收费全文 | 971篇 |
免费 | 23篇 |
国内免费 | 8篇 |
出版年
2023年 | 3篇 |
2022年 | 2篇 |
2021年 | 3篇 |
2020年 | 15篇 |
2019年 | 12篇 |
2018年 | 7篇 |
2017年 | 6篇 |
2016年 | 33篇 |
2015年 | 10篇 |
2014年 | 20篇 |
2013年 | 49篇 |
2012年 | 9篇 |
2011年 | 5篇 |
2010年 | 10篇 |
2009年 | 47篇 |
2008年 | 75篇 |
2007年 | 77篇 |
2006年 | 62篇 |
2005年 | 76篇 |
2004年 | 60篇 |
2003年 | 61篇 |
2002年 | 60篇 |
2001年 | 46篇 |
2000年 | 65篇 |
1999年 | 40篇 |
1998年 | 34篇 |
1997年 | 36篇 |
1996年 | 25篇 |
1995年 | 21篇 |
1994年 | 7篇 |
1993年 | 3篇 |
1992年 | 3篇 |
1991年 | 4篇 |
1990年 | 4篇 |
1989年 | 3篇 |
1988年 | 6篇 |
1987年 | 3篇 |
排序方式: 共有1002条查询结果,搜索用时 15 毫秒
811.
This article demonstrates that typical restrictions which are imposed in dialogical logic in order to recover first-order logical consequence from a fragment of natural language argumentation are also forthcoming from preference profiles of boundedly rational players, provided that these players instantiate a specific player type and compute partial strategies. We present two structural rules, which are formulated similarly to closure rules for tableaux proofs that restrict players' strategies to a mapping between games in extensive forms (i.e., game trees) and proof trees. Both rules are motivated from players' preferences and limitations; they can therefore be viewed as being player-self-imposable. First-order logical consequence is thus shown to result from playing a specific type of argumentation game. The alignment of such games with the normative model of the Pragma-dialectical theory of argumentation is positively evaluated. But explicit rules to guarantee that the argumentation game instantiates first-order logical consequence have now become gratuitous, since their normative content arises directly from players' preferences and limitations. A similar naturalization for non-classical logics is discussed. 相似文献
812.
813.
通过两个实验探讨了时间压力对类比推理的直觉加工的影响。实验1采用三因素混合实验设计,以48名大学生为被试,在不同时间压力条件下对不同相似性言语类比推理题进行喜好度判断和类比推理逻辑判断。实验2是在实验1的基础上用图形类比推理题代替语义类比推理题,以56名大学生为被试。结果发现:(1)时间压力下,对跨领域言语类比推理的直觉加工效应显著高于逻辑加工效应;(2)时间压力下,低难度图形类比推理题的直觉加工效应显著高于逻辑加工效应。无时间压力条件下,图形类比推理的逻辑加工效应优势明显;(3)时间压力对类比推理的直觉加工和逻辑加工均有影响 相似文献
814.
David Bailey Ashantha Goonetilleke Duncan Campbell 《Journal of Multi-Criteria Decision Analysis》2003,12(6):337-347
Multiple criteria group site selection problems involve a group of individuals evaluating a set of alternative sites on the basis of multiple criteria. This paper presents an application of a new fuzzy algorithm for finding and exploring potential solutions to these problems in a raster Geographical Information System (GIS) environment. Linguistic assessments from decision‐makers are represented as triangular fuzzy numbers (TFN's), which are adjusted for uncertainty in the source data and their relationship to suitability by using an approach based on type‐2 fuzzy sets. The first aggregation of inputs is a compensatory one based on fuzzy multiattribute decision‐making (MADM) theory. An adjusted aggregation then factors in conflicts, risks and uncertainties to enable a variety of compensatory and non‐compensatory outcomes to be generated based on decision‐maker preferences. The algorithm was implemented in ArcView GIS as part of an ongoing collaborative project with Brisbane Airport. This paper outlines the fuzzy algorithm and its use in site selection for a recycling facility on the Brisbane Airport site. Copyright © 2005 John Wiley & Sons, Ltd. 相似文献
815.
We explore some logics of change, focusing on commands to change the world in such a way that certain elementary propositions become true or false. This investigation starts out from the following two simplifying assumptions: (1) the world is a collection of facts (Wittgenstein), and (2), the world can be changed by changing elementary facts (Marx). These assumptions allow us to study the logic of imperatives in the simplest possible setting. 相似文献
816.
A method for constructing continua of logics squeezed between some intermediate predicate logics, developed by Suzuki [8], is modified and applied to intervals of the form [L, L+ ¬¬S], where Lis a predicate logic, Sis a closed predicate formula. This solves one of the problems from Suzuki's paper. 相似文献
817.
Henkin quantifiers have been introduced in Henkin (1961). Walkoe (1970) studied basic model-theoretical properties of an extension L
*
1(H) of ordinary first-order languages in which every sentence is a first-order sentence prefixed with a Henkin quantifier. In this paper we consider a generalization of Walkoe's languages: we close L
*
1(H) with respect to Boolean operations, and obtain the language L
1(H). At the next level, we consider an extension L
*
2(H) of L
1(H) in which every sentence is an L
1(H)-sentence prefixed with a Henkin quantifier. We repeat this construction to infinity. Using the (un)-definability of truth – in – N for these languages, we show that this hierarchy does not collapse. In addition, we compare some of the present results to the ones obtained by Kripke (1975), McGee (1991), and Hintikka (1996). 相似文献
818.
On the one hand, the absence of contraction is a safeguard against the logical (property theoretic) paradoxes; but on the other hand, it also disables inductive and recursive definitions, in its most basic form the definition
of the series of natural numbers, for instance. The reason for this is simply that the effectiveness of a recursion clause
depends on its being available after application, something that is usually assured by contraction. This paper presents a
way of overcoming this problem within the framework of a logic based on inclusion and unrestricted abstraction, without any
form of extensionality.
This revised version was published online in June 2006 with corrections to the Cover Date. 相似文献
819.
In this paper we consider an intuitionistic variant of the modal logic S4 (which we call IS4). The novelty of this paper is that we place particular importance on the natural deduction formulation of IS4— our formulation has several important metatheoretic properties. In addition, we study models of IS4— not in the framework of Kirpke semantics, but in the more general framework of category theory. This allows not only a more abstract definition of a whole class of models but also a means of modelling proofs as well as provability. 相似文献
820.
The main goal of this paper is to explain the link between the algebraic and the Kripke-style models for certain classes of
propositional logics. We start by presenting a Priestley-type duality for distributive lattices endowed with a general class
of well-behaved operators. We then show that finitely-generated varieties of distributive lattices with operators are closed
under canonical embedding algebras. The results are used in the second part of the paper to construct topological and non-topological
Kripke-style models for logics that are sound and complete with respect to varieties of distributive lattices with operators
in the above-mentioned classes.
This revised version was published online in June 2006 with corrections to the Cover Date. 相似文献