全文获取类型
收费全文 | 41195篇 |
免费 | 15771篇 |
国内免费 | 55篇 |
专业分类
化学 | 53762篇 |
晶体学 | 22篇 |
力学 | 1112篇 |
数学 | 1327篇 |
物理学 | 798篇 |
出版年
2024年 | 424篇 |
2023年 | 4247篇 |
2022年 | 1412篇 |
2021年 | 2419篇 |
2020年 | 4696篇 |
2019年 | 2233篇 |
2018年 | 2392篇 |
2017年 | 615篇 |
2016年 | 5573篇 |
2015年 | 5535篇 |
2014年 | 4960篇 |
2013年 | 5148篇 |
2012年 | 3106篇 |
2011年 | 1084篇 |
2010年 | 3381篇 |
2009年 | 3302篇 |
2008年 | 1075篇 |
2007年 | 757篇 |
2006年 | 219篇 |
2005年 | 177篇 |
2004年 | 129篇 |
2003年 | 119篇 |
2002年 | 93篇 |
1997年 | 63篇 |
1996年 | 77篇 |
1995年 | 130篇 |
1994年 | 88篇 |
1993年 | 206篇 |
1992年 | 87篇 |
1991年 | 68篇 |
1990年 | 67篇 |
1988年 | 95篇 |
1987年 | 79篇 |
1984年 | 64篇 |
1983年 | 75篇 |
1982年 | 77篇 |
1981年 | 91篇 |
1980年 | 113篇 |
1979年 | 106篇 |
1978年 | 102篇 |
1977年 | 170篇 |
1976年 | 190篇 |
1975年 | 189篇 |
1974年 | 197篇 |
1973年 | 114篇 |
1972年 | 156篇 |
1971年 | 123篇 |
1970年 | 207篇 |
1969年 | 127篇 |
1968年 | 136篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
71.
72.
Gallin Peter Prof. Dr. 《ZDM》2003,35(3):110-119
In order to emphasize functional thinking in mathematical education, arguments are brought forward for an early and frequent use of tree diagrams in teaching stochastics. Since set and tree diagrams can be regarded as two sides of the same matter, Bayes’ theorem, which is strongly associated with predicative set diagrams, need not be dealt with explicitly any longer. Set diagrams are replaced by tree diagrams that are labelled in detail and by tree inversion as a functional instrument of dealing with conditioned probabilities. This technique is demonstrated by three typical problems in the context of conditioned probability. Finally, two letters by Pascal to Fermat are analysed in order to illustrate that predicative and functional approaches were already pursued in the early stages of probability calculus in the 17th century. 相似文献
73.
74.
Johan van Benthem 《Logica Universalis》2007,1(1):125-138
We prove new Lindstr?m theorems for the basic modal propositional language, and for some related fragments of first-order
logic. We find difficulties with such results for modal languages without a finite-depth property, high-lighting the difference
between abstract model theory for fragments and for extensions of first-order logic. In addition we discuss new connections
with interpolation properties, and the modal invariance theorem.
Mathematics Subject Classification (2000): Primary 03B45; Secondary 03C95 相似文献
75.
Prof. Ing. A. Sopková D.Sc. 《Journal of Thermal Analysis and Calorimetry》1996,46(2):335-336
76.
77.
Noga Alon Oded Goldreich Johan Hstad Ren Peralta 《Random Structures and Algorithms》1992,3(3):289-304
We present three alternative simple constructions of small probability spaces on n bits for which any k bits are almost independent. The number of bits used to specify a point in the sample space is (2 + o(1)) (log log n + k/2 + log k + log 1/?), where ? is the statistical difference between the distribution induced on any k bit locations and the uniform distribution. This is asymptotically comparable to the construction recently presented by Naor and Naor (our size bound is better as long as ? < 1/(k log n)). An additional advantage of our constructions is their simplicity. 相似文献
78.
79.
80.