首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   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条查询结果,搜索用时 812 毫秒
761.
The paper discusses the potential value of a deontic approach to database specification. More specifically, some different types of integrity constraints are considered and a distinction is drawn between necessary (hard) and deontic (soft) constraints.Databases are compared with other normative systems. A deontic logic for database specification is proposed and the problems of how to react to, and of how to correct, or repair, a situation which arises through norm violation are discussed in the context of this logic. The limitations of the proposed logic and possible modifications and extensions of it are analysed.  相似文献   
762.
Mark Reynolds 《Studia Logica》1996,57(2-3):279-302
We present an axiomatisation for the first-order temporal logic with connectives Until and Since over the class of all linear flows of time. Completeness of the axiom system is proved.We also add a few axioms to find a sound and complete axiomatisation for the first order temporal logic of Until and Since over rational numbers time.The author would like to thank Dov Gabbay and Ian Hodkinson for helpful discussions on this material. The work was supported by the U.K. Science and Engineering Research Council under the Metatem project (GR/F/28526).Presented by Dov Gabbay  相似文献   
763.
Defeasible reasoning is concerned with the logics of non-deductive argument. As is described in the literature, the study of this type of reasoning is considerably more involved than the study of deductive argument, even so that, in realistic applications, there is often a lack of resources to perform an exhaustive analysis. It follows that, in a theory of defeasible reasoning, the order and direction in which arguments are developed, i.e. theprocedure, is important. The aim of this article is to show that debate is the most efficient procedure to argue in the presence of limited resources. To do so, there is first some general theory on defeasible argumentation, which is followed by an introduction to the problem of dialectical search. The problem of dialectical search is (or at least, should be) the essential issue in every theory on argumentation, and emerges at every occasion that involves adjudication on competing arguments. Starting with an example, it is explained that dialectical search can be best scheduled according to classical debating techniques, that work along well-tried methods. These methods (which include various forms of curtailment, interruption, and interpretation) have proven their value in keeping debating efforts within reasonable bounds. How they apply in a theory of formal argument, will be shown in this article.This research was made possible by SION, and is financed by NWO under contract number 612-316-019. Part of this research has been conducted at the Vrije Universiteit Amsterdam. This article contains fragments of Chapter 6 and Chapter 7 of the author's dissertation. Studies in Defeasible Argumentation (1993).  相似文献   
764.
Since the time of David Hume, many philosophers have held that there is a logical Is/Ought gap. According to the doctrine of the Is/Ought gap, there are no valid (i.e., non-fallacious) arguments from purely factual premises about whatis the case to moral or normative conclusions about whatought to be. Occasionally, this doctrine has been challenged, but frequently it has been accepted without argumentation. Charles Pigden has recently argued for a logical Is/Ought gap on the grounds of the conservativeness of logic. I offer a counter-example which shows that Pigden's argument is unsound and that there need be no logical gap between Is-premises and an Ought-conclusion. My counter-example is an argument which is logically valid, has only Is-premises and an Ought-conclusion, and does not purport to violate the conservativeness of logic. Moreover, my argument does not rely, as other alleged counter-examples do, on controversial assumptions from Aristotelian biology about natures or ends, or about institutions such as promise-making.  相似文献   
765.
Belief Revision From the Point of View of Doxastic Logic   总被引:2,自引:0,他引:2  
  相似文献   
766.
A relational model for temporal logic   总被引:1,自引:0,他引:1  
  相似文献   
767.
Hollenberg  Marco 《Studia Logica》1998,60(3):357-386
Negative definability ([18]) is an alternative way of defining classes of Kripke frames via a modal language, one that enables us, for instance, to define the class of irreflexive frames. Besides a list of closure conditions for negatively definable classes, the paper contains two main theorems. First, a characterization is given of negatively definable classes of (rooted) finite transitive Kripke frames and of such classes defined using both traditional (positive) and negative definitions. Second, we characterize the negatively definable classes of rooted general frames.  相似文献   
768.
In this paper we 1. provide a natural deduction system for full first-order linear logic, 2. introduce Curry-Howard-style terms for this version of linear logic, 3. extend the notion of substitution of Curry-Howard terms for term variables, 4. define the reduction rules for the Curry-Howard terms and 5. outline a proof of the strong normalization for the full system of linear logic using a development of Girard's candidates for reducibility, thereby providing an alternative to Girard's proof using proof-nets.  相似文献   
769.
Goranko  Valentin 《Studia Logica》1998,61(2):179-197
A certain type of inference rules in (multi-) modal logics, generalizing Gabbay's Irreflexivity rule, is introduced and some general completeness results about modal logics axiomatized with such rules are proved.  相似文献   
770.
A Propositional Dynamic Logic with Qualitative Probabilities   总被引:1,自引:0,他引:1  
This paper presents an -completeness theorem for a new propositional probabilistic logic, namely, the dynamic propositional logic of qualitative probabilities (D Q P), which has been introduced by the author as a dynamic extension of the logic of qualitative probabilities (Q P) introduced by Segerberg.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号