全文获取类型
收费全文 | 926篇 |
免费 | 15篇 |
国内免费 | 2篇 |
出版年
2023年 | 4篇 |
2022年 | 6篇 |
2021年 | 5篇 |
2020年 | 13篇 |
2019年 | 9篇 |
2018年 | 5篇 |
2017年 | 4篇 |
2016年 | 31篇 |
2015年 | 10篇 |
2014年 | 19篇 |
2013年 | 45篇 |
2012年 | 5篇 |
2011年 | 7篇 |
2010年 | 9篇 |
2009年 | 47篇 |
2008年 | 73篇 |
2007年 | 75篇 |
2006年 | 58篇 |
2005年 | 72篇 |
2004年 | 56篇 |
2003年 | 57篇 |
2002年 | 59篇 |
2001年 | 40篇 |
2000年 | 58篇 |
1999年 | 38篇 |
1998年 | 33篇 |
1997年 | 33篇 |
1996年 | 21篇 |
1995年 | 20篇 |
1994年 | 5篇 |
1993年 | 4篇 |
1992年 | 3篇 |
1991年 | 3篇 |
1990年 | 4篇 |
1989年 | 3篇 |
1988年 | 6篇 |
1987年 | 3篇 |
排序方式: 共有943条查询结果,搜索用时 31 毫秒
121.
每一个文明都有自己存在的理由和发展的逻辑线路,不同文明可以有不同的发展程度,但不能有凌驾于其他文明之上的话语解释权.近代科学作为近代西方文明的产物,也同时是古代多种文明融合的产物.科学发展离不开自身所属的文化逻辑,但反过来具备同等文化逻辑的文明未必就一定产生科学.科学作为文化的一种形态,它没有必要成为所有文明的必经之路.我们在尊重、发展作为现代化工具的科学技术的同时,要反对用科学话语来解释工具之上的东西. 相似文献
122.
Lou Goble 《Studia Logica》2004,76(1):17-66
Combinator logics are a broad family of substructual logics that are formed by extending the basic relevant logic B with axioms that correspond closely to the reduction rules of proper combinators in combinatory logic. In the Routley-Meyer relational semantics for relevant logic each such combinator logic is characterized by the class of frames that meet a first-order condition that also directly corresponds to the same combinator's reduction rule. A second family of logics is also introduced that extends B with the addition of propositional constants that correspond to combinators. These are characterized by relational frames that meet first-order conditions that reflect the structures of the combinators themselves. 相似文献
123.
Peter Gärdenfors has developed a semantics for conditional logic, based on the operations of expansion and revision applied to states of information. The account amounts to a formalisation of the Ramsey test for conditionals. A conditional A > B is declared accepted in a state of information K if B is accepted in the state of information which is the result of revising K with respect to A. While Gärdenfors's account takes the truth-functional part of the logic as given, the present paper proposes a semantics entirely based on epistemic states and operations on these states. The semantics is accompanied by a syntactic treatment of conditional logic which is formally similar to Gentzen's sequent formulation of natural deduction rules. Three of David Lewis's systems of conditional logic are represented. The formulations are attractive by virtue of their transparency and simplicity. 相似文献
124.
As with the development of several logical notions, it is shown that the concept of resource-consciousness, i. e. the concern over the number of times that a given sentence is used in the proof of another sentence, has its origin in the foundations of geometry, pre-dating its appearence in logical circles as BCK-logic or affine logic. 相似文献
125.
In this essay we advance the view that analytical epistemology and artificial intelligence are complementary disciplines. Both fields study epistemic relations, but whereas artificial intelligence approaches this subject from the perspective of understanding formal and computational properties of frameworks purporting to model some epistemic relation or other, traditional epistemology approaches the subject from the perspective of understanding the properties of epistemic relations in terms of their conceptual properties. We argue that these two practices should not be conducted in isolation. We illustrate this point by discussing how to represent a class of inference forms found in standard inferential statistics. This class of inference forms is interesting because its members share two properties that are common to epistemic relations, namely defeasibility and paraconsistency. Our modeling of standard inferential statistical arguments exploits results from both logical artificial intelligence and analytical epistemology. We remark how our approach to this modeling problem may be generalized to an interdisciplinary approach to the study of epistemic relations. 相似文献
126.
Athanasios Tsakonas Vasilios Aggelis Ioannis Karkazis Georgios Dounias 《Journal of Applied Logic》2004,2(3):349
Nowadays, intelligent connectionist systems such as artificial neural networks have been proved very powerful in a wide area of applications. Consequently, the ability to interpret their structure was always a desirable feature for experts. In this field, the neural logic networks (NLN) by their definition are able to represent complex human logic and provide knowledge discovery. However, under contemporary methodologies, the training of these networks may often result in non-comprehensible or poorly designed structures. In this work, we propose an evolutionary system that uses current advances in genetic programming that overcome these drawbacks and produces neural logic networks that can be arbitrarily connected and are easily interpretable into expert rules. To accomplish this task, we guide the genetic programming process using a context-free grammar and we encode indirectly the neural logic networks into the genetic programming individuals. We test the proposed system in two problems of medical diagnosis. Our results are examined both in terms of the solution interpretability that can lead in knowledge discovery, and in terms of the achieved accuracy. We draw conclusions about the effectiveness of the system and we propose further research directions. 相似文献
127.
128.
Paolo Gentilini 《Journal of Applied Logic》2011,9(3):171-202
A proof-theoretic analysis and new arithmetical semantics are proposed for some paraconsistent C-systems, which are a relevant sub-class of Logics of Formal Inconsistency (LFIs) introduced by W.A. Carnielli et al. (2002, 2005) [8] and [9]. The sequent versions BC, CI, CIL of the systems bC, Ci, Cil presented in Carnielli et al. (2002, 2005) [8] and [9] are introduced and examined. BC, CI, CIL admit the cut-elimination property and, in general, a weakened sub-formula property. Moreover, a formal notion of constructive paraconsistent system is given, and the constructivity of CI is proven. Further possible developments of proof theory and provability logic of CI-based arithmetical systems are sketched, and a possible weakened Hilbert?s program is discussed. As to the semantical aspects, arithmetical semantics interprets C-system formulas into Provability Logic sentences of classical Arithmetic PA (Artemov and Beklemishev (2004) [2], Japaridze and de Jongh (1998) [19], Gentilini (1999) [15], Smorynski (1991) [22]): thus, it links the notion of truth to the notion of provability inside a classical environment. It makes true infinitely many contradictions B∧¬B and falsifies many arbitrarily complex instances of non-contradiction principle ¬(A∧¬A). Moreover, arithmetical models falsify both classical logic LK and intuitionistic logic LJ, so that a kind of metalogical completeness property of LFI-paraconsistent logic w.r.t. arithmetical semantics is proven. As a work in progress, the possibility to interpret CI-based paraconsistent Arithmetic PACI into Provability Logic of classical Arithmetic PA is discussed, showing the role that PACIarithmetical models could have in establishing new meta-mathematical properties, e.g. in breaking classical equivalences between consistency statements and reflection principles. 相似文献
129.
130.
Hybrid logics internalize their own semantics. Members of the newer family of justification logics internalize their own proof methodology. It is an appealing goal to combine these two ideas into a single system, and in this paper we make a start. We present a hybrid/justification version of the modal logic T. We give a semantics, a proof theory, and prove a completeness theorem. In addition, we prove a Realization Theorem, something that plays a central role for justification logics generally. Since justification logics are newer and less well known than hybrid logics, we sketch their background, and give pointers to their range of applicability. We conclude with suggestions for future research. Indeed, the main goal of this paper is to encourage others to continue the investigation begun here. 相似文献