首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   918篇
  免费   19篇
  国内免费   4篇
  2023年   1篇
  2022年   2篇
  2021年   3篇
  2020年   11篇
  2019年   10篇
  2018年   8篇
  2017年   6篇
  2016年   31篇
  2015年   9篇
  2014年   20篇
  2013年   44篇
  2012年   6篇
  2011年   5篇
  2010年   9篇
  2009年   45篇
  2008年   72篇
  2007年   71篇
  2006年   58篇
  2005年   73篇
  2004年   57篇
  2003年   59篇
  2002年   59篇
  2001年   41篇
  2000年   60篇
  1999年   40篇
  1998年   32篇
  1997年   36篇
  1996年   22篇
  1995年   20篇
  1994年   6篇
  1993年   3篇
  1992年   3篇
  1991年   3篇
  1990年   4篇
  1989年   3篇
  1988年   6篇
  1987年   3篇
排序方式: 共有941条查询结果,搜索用时 31 毫秒
31.
The current paradigm in medicine generally distinguishes between genetic and environmental causes of disease. Although the word paradigm has become a commonplace, the theories of Thomas Kuhn have not received much attention in the journals of medicine. Kuhn's structuralist method differs radically from the daily activities of the scientific method itself. Using linguistic theory, this essay offers a structuralist reading of Thomas Kuhn's The Structure of Scientific Revolutions. Our purpose is to highlight the similarities between these structuralist models of science and language. In part, we focus on the logic that enables Kuhn to assert the priority of perception over interpretation in the history of science. To illustrate some of these issues, we refer to the distinction between environmental and genetic causes of disease. While the activity of scientific research results in the revision of concepts in science, the production of significant differences that shape our knowledge is in part a social and linguistic process.  相似文献   
32.
采用理性—经验思维方式量表对105名大学生进行测量,选出高、低理性思维方式各35名大学生进行实验,探讨了逻辑训练对不同理性思维方式大学生三段论推理的影响。结果表明:(1)高理性思维方式个体三段论推理的平均反应时快于低理性思维方式个体;非冲突类型题目推理的平均正确率高于冲突类型题目;逻辑训练可以提高个体三段论推理的平均反应时和正确率;(2)逻辑训练后非冲突任务类型题目的平均正确率高于冲突任务类型题目;(3)逻辑训练对低理性思维方式个体冲突任务类型题目平均正确率的提高效果更明显。这意味着逻辑训练可以显著提升个体的推理成绩,但不能完全消除信念偏差对推理的影响,而且逻辑训练对低理性思维方式个体推理成绩的提升效果更加明显。  相似文献   
33.
It is well known that Frege's system in the Grundgesetze der Arithmetik is formally inconsistent. Frege's instantiation rule for the second-order universal quantifier makes his system, except for minor differences, full (i.e., with unrestricted comprehension) second-order logic, augmented by an abstraction operator that abides to Frege's basic law V. A few years ago, Richard Heck proved the consistency of the fragment of Frege's theory obtained by restricting the comprehension schema to predicative formulae. He further conjectured that the more encompassing 1 1-comprehension schema would already be inconsistent. In the present paper, we show that this is not the case.  相似文献   
34.
We introduce non-associative linear logic, which may be seen as the classical version of the non-associative Lambek calculus. We define its sequent calculus, its theory of proof-nets, for which we give a correctness criterion and a sequentialization theorem, and we show proof search in it is polynomial.  相似文献   
35.
Casadio  Claudia  Lambek  Joachim 《Studia Logica》2002,71(3):315-329
In this paper we consider the relations existing between four deductive systems that have been called categorial grammars and have relevant connections with linguistic investigations: the syntactic calculus, bilinear logic, compact bilinear logic and Curry's semantic calculus.  相似文献   
36.
37.
38.
An assertion of high conditional probability or, more briefly, an HCP assertion is a statement of the type: The conditional probability of B given A is close to one. The goal of this paper is to construct logics of HCP assertions whose conclusions are highly likely to be correct rather than certain to be correct. Such logics would allow useful conclusions to be drawn when the premises are not strong enough to allow conclusions to be reached with certainty. This goal is achieved by taking Adams" (1966) logic, changing its intended application from conditionals to HCP assertions, and then weakening its criterion for entailment. According to the weakened entailment criterion, called the Criterion of Near Surety and which may be loosely interpreted as a Bayesian criterion, a conclusion is entailed if and only if nearly every model of the premises is a model of the conclusion. The resulting logic, called NSL, is nonmonotonic. Entailment in this logic, although not as strict as entailment in Adams" logic, is more strict than entailment in the propositional logic of material conditionals. Next, NSL was modified by requiring that each HCP assertion be scaled; this means that to each HCP assertion was associated a bound on the deviation from 1 of the conditional probability that is the subject of the assertion. Scaling of HCP assertions is useful for breaking entailment deadlocks. For example, it it is known that the conditional probabilities of C given A and of ¬ C given B are both close to one but the bound on the former"s deviation from 1 is much smaller than the latter"s, then it may be concluded that in all likelihood the conditional probability of C given A B is close to one. The resulting logic, called NSL-S, is also nonmonotonic. Despite great differences in their definitions of entailment, entailment in NSL is equivalent to Lehmann and Magidor"s rational closure and, disregarding minor differences concerning which premise sets are considered consistent, entailment in NSL-S is equivalent to entailment in Goldszmidt and Pearl"s System-Z +. Bacchus, Grove, Halpern, and Koller proposed two methods of developing a predicate calculus based on the Criterion of Near Surety. In their random-structures method, which assumed a prior distribution similar to that of NSL, it appears possible to define an entailment relation equivalent to that of NSL. In their random-worlds method, which assumed a prior distribution dramatically different from that of NSL, it is known that the entailment relation is different from that of NSL.  相似文献   
39.
The paper presents an argument against a metaphysical conception of logic according to which logic spells out a specific kind of mathematical structure that is somehow inherently related to our factual reasoning. In contrast, it is argued that it is always an empirical question as to whether a given mathematical structure really does captures a principle of reasoning. (More generally, it is argued that it is not meaningful to replace an empirical investigation of a thing by an investigation of its a priori analyzable structure without paying due attention to the question of whether it really is the structure of the thing in question.) It is proposed to elucidate the situation by distinguishing two essentially different realms with which our reason must deal: the realm of the natural, constituted by the things of our empirical world, and the realm of the formal, constituted by the structures that we use as prisms to view, to make sense of, and to reconstruct the world. It is suggested that this vantage point may throw light on many foundational problems of logic.  相似文献   
40.
Dunn  J. Michael 《Studia Logica》2000,66(1):5-40
This paper explores allowing truth value assignments to be undetermined or "partial" (no truth values) and overdetermined or "inconsistent" (both truth values), thus returning to an investigation of the four-valued semantics that I initiated in the sixties. I examine some natural consequence relations and show how they are related to existing logics, including ukasiewicz's three-valued logic, Kleene's three-valued logic, Anderson and Belnap's (first-degree) relevant entailments, Priest's "Logic of Paradox", and the first-degree fragment of the Dunn-McCall system "R-mingle". None of these systems have nested implications, and I investigate twelve natural extensions containing nested implications, all of which can be viewed as coming from natural variations on Kripke's semantics for intuitionistic logic. Many of these logics exist antecedently in the literature, in particular Nelson's "constructible falsity".  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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