全文获取类型
收费全文 | 908篇 |
免费 | 15篇 |
国内免费 | 2篇 |
出版年
2023年 | 4篇 |
2022年 | 5篇 |
2021年 | 3篇 |
2020年 | 12篇 |
2019年 | 9篇 |
2018年 | 5篇 |
2017年 | 5篇 |
2016年 | 30篇 |
2015年 | 9篇 |
2014年 | 19篇 |
2013年 | 42篇 |
2012年 | 5篇 |
2011年 | 5篇 |
2010年 | 9篇 |
2009年 | 45篇 |
2008年 | 71篇 |
2007年 | 72篇 |
2006年 | 57篇 |
2005年 | 71篇 |
2004年 | 55篇 |
2003年 | 57篇 |
2002年 | 58篇 |
2001年 | 42篇 |
2000年 | 58篇 |
1999年 | 38篇 |
1998年 | 32篇 |
1997年 | 36篇 |
1996年 | 21篇 |
1995年 | 20篇 |
1994年 | 5篇 |
1993年 | 3篇 |
1992年 | 3篇 |
1991年 | 3篇 |
1990年 | 4篇 |
1989年 | 3篇 |
1988年 | 6篇 |
1987年 | 3篇 |
排序方式: 共有925条查询结果,搜索用时 15 毫秒
741.
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). 相似文献
742.
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. 相似文献
743.
We present a finitary regularly algebraizable logic not finitely equivalential, for every similarity type. We associate to
each of these logics a class of algebras with an equivalence relation, with the property that in this class, the identity
is atomatically definable but not finitely atomatically definable.
This revised version was published online in June 2006 with corrections to the Cover Date. 相似文献
744.
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. 相似文献
745.
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. 相似文献
746.
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. 相似文献
747.
Michael Leff 《Argumentation》2000,14(3):241-254
The paper presents a historical overview of some characteristic differences between rhetoric and dialectic in the pre-modern tradition. In the light of this historical analysis, some current approaches to dialectic are characterized, with special attention to Ralph Johnson's concept of dialectical tier. 相似文献
748.
Many-valued reflexive autoepistemic logic 总被引:1,自引:0,他引:1
749.
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. 相似文献
750.