首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   941篇
  免费   16篇
  国内免费   2篇
  2023年   2篇
  2022年   2篇
  2021年   4篇
  2020年   11篇
  2019年   10篇
  2018年   5篇
  2017年   7篇
  2016年   36篇
  2015年   9篇
  2014年   22篇
  2013年   49篇
  2012年   5篇
  2011年   7篇
  2010年   9篇
  2009年   55篇
  2008年   79篇
  2007年   75篇
  2006年   60篇
  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篇
排序方式: 共有959条查询结果,搜索用时 31 毫秒
81.
Abstract

We examine some mathematical tools for dealing with ambiguous situations. The main tool is the use of non-standard logic with truth-values in what is called a locale. This approach is related to fuzzy set theory, which we briefly discuss. We also consider probabilistic concepts. We include specific examples and describe the way a researcher can set up a suitable locale to analyse a concrete situation.  相似文献   
82.
A Dedekind algebra is an ordered pair (B, h), where B is a non-empty set and h is a similarity transformation on B. Among the Dedekind algebras is the sequence of the positive integers. From a contemporary perspective, Dedekind established that the second-order theory of the sequence of the positive integers is categorical and finitely axiomatizable. The purpose here is to show that this seemingly isolated result is a consequence of more general results in the model theory of second-order languages. Each Dedekind algebra can be decomposed into a family of disjoint, countable subalgebras called the configurations of the algebra. There are ?0 isomorphism types of configurations. Each Dedekind algebra is associated with a cardinal-valued function on ω called its configuration signature. The configuration signature counts the number of configurations in each isomorphism type that occurs in the decomposition of the algebra. Two Dedekind algebras are isomorphic iff their configuration signatures are identical. The second-order theory of any countably infinite Dedekind algebra is categorical, and there are countably infinite Dedekind algebras whose second-order theories are not finitely axiomatizable. It is shown that there is a condition on configuration signatures necessary and sufficient for the second-order theory of a Dedekind algebra to be finitely axiomatizable. It follows that the second-order theory of the sequence of the positive integers is categorical and finitely axiomatizable.  相似文献   
83.
A common and much-explored thought is ?ukasiewicz's idea that the future is ‘indeterminate’—i.e., ‘gappy’ with respect to some claims—and that such indeterminacy bleeds back into the present in the form of gappy ‘future contingent’ claims. What is uncommon, and to my knowledge unexplored, is the dual idea of an overdeterminate future—one which is ‘glutty’ with respect to some claims. While the direct dual, with future gluts bleeding back into the present, is worth noting, my central aim is simply to sketch and briefly explore an alternative glutty-future view, one that is conservative—indeed, entirely classical—with respect to the present.

The structure of the paper runs as follows. §1 briefly sketches the target gap picture of an indeterminate future yielding gappy claims at the present. §2 presents the direct dual idea—a glut picture of an overdeterminate future yielding glutty claims at present. §3 sketches the central idea, a more interesting glut picture in which the future contains contradictory states but the present remains entirely classical. §4 contains a general defence of the idea, leaving it open as to whether the gappy-future view enjoys substantive virtues over the proposed glutty-future view of §3.  相似文献   
84.
Theological thinking is influenced by perspectives on the relation of scientific knowledge to reality. Two paradigms for understanding the nature of human knowledge are considered in relation to quantum mechanics: the subjective-observing perspective of Kant, and the objective-participant perspective of Thomas Aquinas. I discuss whether quantum mechanics necessarily implies a subject centered perspective on reality, and argue, with reference to d'Espagnat's notion of veiled reality, that quantum non-separability challenges this view. I then explore whether the objective-participant perspective of Thomas Aquinas provides a more fruitful context for understanding quantum mechanics. I discuss quantum measurement in terms of the transition from potentiality to actuality, and knowledge as the latent intelligibility of the world realized. However, the negative nature of our knowledge of quantum non-separability also challenges this perspective. Our theological thinking in response to quantum knowledge must therefore proceed tentatively, balancing a via positiva, with a via negativa.  相似文献   
85.
Automated reasoning about uncertain knowledge has many applications. One difficulty when developing such systems is the lack of a completely satisfactory integration of logic and probability. We address this problem directly. Expressive languages like higher-order logic are ideally suited for representing and reasoning about structured knowledge. Uncertain knowledge can be modeled by using graded probabilities rather than binary truth values. The main technical problem studied in this paper is the following: Given a set of sentences, each having some probability of being true, what probability should be ascribed to other (query) sentences? A natural wish-list, among others, is that the probability distribution (i) is consistent with the knowledge base, (ii) allows for a consistent inference procedure and in particular (iii) reduces to deductive logic in the limit of probabilities being 0 and 1, (iv) allows (Bayesian) inductive reasoning and (v) learning in the limit and in particular (vi) allows confirmation of universally quantified hypotheses/sentences. We translate this wish-list into technical requirements for a prior probability and show that probabilities satisfying all our criteria exist. We also give explicit constructions and several general characterizations of probabilities that satisfy some or all of the criteria and various (counter)examples. We also derive necessary and sufficient conditions for extending beliefs about finitely many sentences to suitable probabilities over all sentences, and in particular least dogmatic or least biased ones. We conclude with a brief outlook on how the developed theory might be used and approximated in autonomous reasoning agents. Our theory is a step towards a globally consistent and empirically satisfactory unification of probability and logic.  相似文献   
86.
87.
88.
My purpose in this paper is to argue that the classical notion of entailment is not suitable for non-bivalent logics, to propose an appropriate alternative and to suggest a generalized entailment notion suitable to bivalent and non-bivalent logics alike. In classical two valued logic, one can not infer a false statement from one that is not false, any more than one can infer from a true statement a statement that is not true. In classical logic in fact preserving truth and preserving non-falsity are one and the same thing. They are not the same in non-bivalent logics however and I will argue that the classical notion of entailment that preserves only truth is not strong enough for such a logic. I will show that if we retain the classical notion of entailment in a logic that has three values, true, false and a third value in between, an inconsistency can be derived that can be resolved only by measures that seriously disable the logic. I will show this for a logic designed to allow for semantic presuppositions, then I will show that we get the same result in any three valued logic with the same value ordering. I will finally suggest how the notion of entailment should be generalized so that this problem may be avoided. The strengthened notion of entailment I am proposing is a conservative extension of the classical notion that preserves not only truth but the order of all values in a logic, so that the value of an entailed statement must alway be at least as great as the value of the sequence of statements entailing it. A notion of entailment this strong or stronger will, I believe, be found to be applicable to non-classical logics generally. In the opinion of Dana Scott, no really workable three valued logic has yet been developed. It is hard to disagree with this. A workable three valued logic however could perhaps be developed however, if we had a notion of entailment suitable to non-bivalent logics.  相似文献   
89.
90.
The monoidal t-norm based logic MTL is obtained from Hájek's Basic Fuzzy logic BL by dropping the divisibility condition for the strong (or monoidal) conjunction. Recently, Jenei and Montgana have shown MTL to be standard complete, i.e. complete with respect to the class of residuated lattices in the real unit interval [0,1] defined by left-continuous t-norms and their residua. Its corresponding algebraic semantics is given by pre-linear residuated lattices. In this paper we address the issue of standard and rational completeness (rational completeness meaning completeness with respect to a class of algebras in the rational unit interval [0,1]) of some important axiomatic extensions of MTL corresponding to well-known parallel extensions of BL. Moreover, we investigate varieties of MTL algebras whose linearly ordered countable algebras embed into algebras whose lattice reduct is the real and/or the rational interval [0,1]. These embedding properties are used to investigate finite strong standard and/or rational completeness of the corresponding logics.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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