全文获取类型
收费全文 | 893篇 |
免费 | 15篇 |
国内免费 | 2篇 |
出版年
2023年 | 1篇 |
2022年 | 2篇 |
2021年 | 3篇 |
2020年 | 11篇 |
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篇 |
排序方式: 共有910条查询结果,搜索用时 15 毫秒
181.
This paper has four parts. In the first part, I present Leniewski's protothetics and the complete system provided for that logic by Henkin. The second part presents a generalized notion of partial functions in propositional type theory. In the third part, these partial functions are used to define partial interpretations for protothetics. Finally, I present in the fourth part a complete system for partial protothetics. Completeness is proved by Henkin's method [4] using saturated sets instead of maximally saturated sets. This technique provides a canonical representation of a partial semantic space and it is suggested that this space can be interpreted as an epistemic state of a non-omniscient agent. 相似文献
182.
We discuss Smirnovs problem of finding a common background for classifying implicational logics. We formulate and solve the problem of extending, in an appropriate way, an implicational fragment H
of the intuitionistic propositional logic to an implicational fragment TV
of the classical propositional logic. As a result we obtain logical constructions having the form of Boolean lattices whose elements are implicational logics. In this way, whole classes of new logics can be obtained. We also consider the transition from implicational logics to full logics. On the base of the lattices constructed, we formulate the main classification principles for propositional logics. 相似文献
183.
184.
185.
In this paper, the authors discuss Frege's theory of logical objects (extensions, numbers, truth-values) and the recent attempts to rehabilitate it. We show that the eta relation George Boolos deployed on Frege's behalf is similar, if not identical, to the encoding mode of predication that underlies the theory of abstract objects. Whereas Boolos accepted unrestricted Comprehension for Properties and used the eta relation to assert the existence of logical objects under certain highly restricted conditions, the theory of abstract objects uses unrestricted Comprehension for Logical Objects and banishes encoding (eta) formulas from Comprehension for Properties. The relative mathematical and philosophical strengths of the two theories are discussed. Along the way, new results in the theory of abstract objects are described, involving: (a) the theory of extensions, (b) the theory of directions and shapes, and (c) the theory of truth values. 相似文献
186.
Decidability of Quantified Propositional Intuitionistic Logic and S4 on Trees of Height and Arity ≤ω
Quantified propositional intuitionistic logic is obtained from propositional intuitionistic logic by adding quantifiers p, p, where the propositional variables range over upward-closed subsets of the set of worlds in a Kripke structure. If the permitted accessibility relations are arbitrary partial orders, the resulting logic is known to be recursively isomorphic to full second-order logic (Kremer, 1997). It is shown that if the Kripke structures are restricted to trees of at height and width at most , the resulting logics are decidable. This provides a partial answer to a question by Kremer. The result also transfers to modal S4 and some Gödel–Dummett logics with quantifiers over propositions. 相似文献
187.
Logics for generally were introduced for handling assertions with vague notions,such as generally, most, several, etc., by generalized quantifiers, ultrafilter logic being an interesting case. Here, we show that ultrafilter logic can be faithfully embedded into a first-order theory of certain functions, called coherent. We also use generic functions (akin to Skolem functions) to enable elimination of the generalized quantifier. These devices permit using methods for classical first-order logic to reason about consequence in ultrafilter logic.Presented by André Fuhrmann 相似文献
188.
The logic of an ought operator O is contranegative with respect to an underlying preference relation if it satisfies the property Op & (¬p)(¬q) Oq. Here the condition that is interpolative ((p (pq) q) (q (pq) p)) is shown to be necessary and sufficient for all -contranegative preference relations to satisfy the plausible deontic postulates agglomeration (Op & OqO(p&q)) and disjunctive division (O(p&q) Op Oq). 相似文献
189.
The classical propositional logic is known to be sound and complete with respect to the set semantics that interprets connectives
as set operations. The paper extends propositional language by a new binary modality that corresponds to partial recursive
function type constructor under the above interpretation. The cases of deterministic and non-deterministic functions are considered
and for both of them semantically complete modal logics are described and decidability of these logics is established.
Presented by Melvin Fitting 相似文献
190.
Representation and Reasoning about Evolutions of the World in the Context of Reasoning about Actions
The first step in reasoning about actions and change involves reasoning about how the world would evolve if a certain action
is executed in a certain state. Most research on this assumes the evolution to be only a single step and focus on formulating
the transition function that defines changes between states due to actions. In this paper we consider cases where the evolution
is more than just a single change between one state and another. This is manifested when the execution of an action may trigger
execution of other actions, or when multiple agents act on the environment following certain strategies. 相似文献