全文获取类型
收费全文 | 2454篇 |
免费 | 266篇 |
国内免费 | 113篇 |
专业分类
化学 | 251篇 |
晶体学 | 2篇 |
力学 | 510篇 |
综合类 | 191篇 |
数学 | 1285篇 |
物理学 | 594篇 |
出版年
2024年 | 4篇 |
2023年 | 37篇 |
2022年 | 51篇 |
2021年 | 61篇 |
2020年 | 64篇 |
2019年 | 71篇 |
2018年 | 54篇 |
2017年 | 60篇 |
2016年 | 80篇 |
2015年 | 65篇 |
2014年 | 116篇 |
2013年 | 117篇 |
2012年 | 72篇 |
2011年 | 114篇 |
2010年 | 103篇 |
2009年 | 150篇 |
2008年 | 123篇 |
2007年 | 151篇 |
2006年 | 134篇 |
2005年 | 140篇 |
2004年 | 111篇 |
2003年 | 110篇 |
2002年 | 112篇 |
2001年 | 94篇 |
2000年 | 70篇 |
1999年 | 71篇 |
1998年 | 54篇 |
1997年 | 58篇 |
1996年 | 67篇 |
1995年 | 82篇 |
1994年 | 39篇 |
1993年 | 35篇 |
1992年 | 27篇 |
1991年 | 12篇 |
1990年 | 19篇 |
1989年 | 16篇 |
1988年 | 15篇 |
1987年 | 14篇 |
1986年 | 5篇 |
1985年 | 13篇 |
1984年 | 8篇 |
1983年 | 6篇 |
1982年 | 5篇 |
1981年 | 5篇 |
1980年 | 4篇 |
1979年 | 4篇 |
1978年 | 3篇 |
1977年 | 2篇 |
1976年 | 2篇 |
1973年 | 2篇 |
排序方式: 共有2833条查询结果,搜索用时 15 毫秒
101.
Iain A. Stewart 《Mathematical Logic Quarterly》1997,43(1):1-21
We investigate the definability in monadic ∑11 and monadic Π11 of the problems REGk, of whether there is a regular subgraph of degree k in some given graph, and XREGk, of whether, for a given rooted graph, there is a regular subgraph of degree k in which the root has degree k, and their restrictions to graphs in which every vertex has degree at most k, namely REGkk and XREGkk, respectively, for k ≥ 2 (all our graphs are undirected). Our motivation partly stems from the fact (which we prove here) that REGkk and XREGkk are logspace equivalent to CONN and REACH, respectively, for k ≥ 3, where CONN is the problem of whether a given graph is connected and REACH is the problem of whether a given graph has a path joining two given vertices. We use monadic first - order reductions, monadic ∑11 games and a recent technique due to Fagin, Stockmeyer and Vardi to almost completely classify whether these problems are definable in monadic ∑11 and monadic Π11, and we compare the definability of these problems (in monadic ∑11 and monadic Π11 with their computational complexity (which varies from solvable using logspace to NP - complete). 相似文献
102.
Thomas Cornides 《Mathematical Social Sciences》1983,6(1):1-11
The work of Karl Menger in social science is briefly surveyed, in particular in the areas of marginal utility and diminishing value, utility, and uncertainty, a logic of imperatives based on deterrence, and a theory of voluntary associations in which cohesive groups are studied combinatorially. 相似文献
103.
Sheldon M Ross 《Stochastic Processes and their Applications》1976,4(2):167-173
Consider an n-component reliability system having the property that at any time each of its components is either up (i.e., working) or down (i.e., being repaired). Each component acts independently and we suppose that each time the ith component goes up it remains up for an exponentially distributed time having mean μi, and each time it goes down it remains down for an exponentially distributed time having mean υi. We further suppose that whether or not the system itself is up at any time depends only on which components are up at that time. We are interested in the distribution of the time of first system failure when all components are initially up at time zero. In section 2 we show that this distribution has the NBU (i.e., new better than used) property, and in Section 3 we make use of this and other results to obtain a lower bound to the mean time until first system failure. 相似文献
104.
Herman Dishkant 《Fuzzy Sets and Systems》1981,5(2):141-147
A logical approach to fuzzy sets method originated by Giles is developed. The infinitely many-valued logic tω is taken as basic. We accept, it is correct to use the strong conjunction by the logical analysis of the summation of fuzzy items. Under some broad conditions it is proved. that the sum of many fuzzy variables is a variable whose membership function is approximately equal to , where a and c are some constant parameters. A method of estimation of the unknown parameters is developed in a general case. The proposed fuzzy method coincides with the method of maximum likelihood if used in problems of classical mathematical statistics. 相似文献
105.
Kenji Tokuo 《International Journal of Theoretical Physics》2004,43(12):2461-2481
106.
Radosav?Dordevi? Miodrag? Ra?kovi? Zoran?Ognjanovi?Email author 《Archive for Mathematical Logic》2004,43(4):557-563
A propositional logic is defined which in addition to propositional language contains a list of probabilistic operators of the form Ps (with the intended meaning the probability is at least s). The axioms and rules syntactically determine that ranges of probabilities in the corresponding models are always finite. The completeness theorem is proved. It is shown that completeness cannot be generalized to arbitrary theories.This research was supported by Ministarstvo za nauku, tehnologije i razvoj Republike Srbije, through Matematiki institut, under grant 1379Mathematics Subject Classification (2000): 03C70, 03B48 相似文献
107.
V. F. Murzina 《Algebra and Logic》2003,42(3):181-191
A modal logic associated with the
-spaces introduced by Ershov is examined. We construct a modal calculus that is complete w.r.t. the class of all strictly linearly ordered
-frames, and the class of all strictly linearly ordered
-frames. 相似文献
108.
We present an alternative, purely semantical and relatively simple, proof of the Statman's result that both intuitionistic propositional logic and its implicational fragment are PSPACE-complete.This paper was supported by grant 401/01/0218 of the Grant Agency of the Czech Republic. %
Mathematics Subject Classification (2000): 相似文献
109.
Saharon Shelah Pauli Vä isä nen 《Transactions of the American Mathematical Society》2001,353(5):1781-1817
We prove that if is consistent then is consistent with the following statement: There is for every a model of cardinality which is -equivalent to exactly non-isomorphic models of cardinality . In order to get this result we introduce ladder systems and colourings different from the ``standard' counterparts, and prove the following purely combinatorial result: For each prime number and positive integer it is consistent with that there is a ``good' ladder system having exactly pairwise nonequivalent colourings.
110.
电流控阈技术及三值电流型 CMOS施密特电路 总被引:1,自引:1,他引:0
本文以开关信号理论为指导 ,对电流型 CM OS电路中如何实现阈值控制进行研究. 建立实现阈 值控制电路的电流传输开关运算 ,并用于指导电流型 CMOS施密特电路的开关级设计 .用 PSPICE程序 模拟证明了所设计的电路具有理想的施密特电路特性. 相似文献