全文获取类型
收费全文 | 322篇 |
免费 | 4篇 |
国内免费 | 35篇 |
专业分类
数学 | 361篇 |
出版年
2021年 | 4篇 |
2020年 | 2篇 |
2019年 | 3篇 |
2018年 | 7篇 |
2017年 | 3篇 |
2016年 | 6篇 |
2014年 | 8篇 |
2013年 | 13篇 |
2012年 | 8篇 |
2011年 | 5篇 |
2010年 | 4篇 |
2009年 | 8篇 |
2008年 | 7篇 |
2007年 | 6篇 |
2006年 | 9篇 |
2005年 | 11篇 |
2004年 | 9篇 |
2003年 | 16篇 |
2002年 | 11篇 |
2001年 | 12篇 |
2000年 | 7篇 |
1999年 | 12篇 |
1998年 | 4篇 |
1997年 | 9篇 |
1996年 | 14篇 |
1995年 | 5篇 |
1994年 | 13篇 |
1993年 | 12篇 |
1992年 | 6篇 |
1991年 | 5篇 |
1990年 | 12篇 |
1989年 | 12篇 |
1988年 | 5篇 |
1987年 | 4篇 |
1986年 | 7篇 |
1985年 | 10篇 |
1984年 | 12篇 |
1983年 | 8篇 |
1982年 | 6篇 |
1981年 | 8篇 |
1980年 | 2篇 |
1979年 | 2篇 |
1978年 | 6篇 |
1977年 | 4篇 |
1976年 | 3篇 |
1975年 | 3篇 |
1974年 | 2篇 |
1973年 | 6篇 |
1972年 | 2篇 |
1971年 | 3篇 |
排序方式: 共有361条查询结果,搜索用时 265 毫秒
1.
We construct a generic extension in which the ℵ2nd canonical function on ℵ1 exists.
Supported by NSF and by a Fulbright grant.
Publ. 378. Partially supported by the B.S.F. 相似文献
2.
When p = c/n and c goes from less than one to greater than one, the random graph G(n, p) experiences the double jump. The first order language is too weak to recognize this change while there are properties expressable in the second order monadic language for which the change is clear. © 1994 John Wiley & Sons, Inc. 相似文献
3.
Techniques of uniformization are used to prove that it is not consistent that the Whitehead groups of cardinality ℵ1 are exactly the strongly ℵ1-free groups. Some consequences of the assumption that every strongly ℵ1-free group of cardinality ℵ1 is Whitehead are derived. Other results about uniformization are also proved.
Research partially supported by NSERC grant #9848.
Research partially supported by the BSF. The authors thank Rutgers University for its support. Publication #441. 相似文献
4.
Saharon Shelah 《Israel Journal of Mathematics》1993,83(3):369-374
LetT be the family of open subsets of a topological space (not necessarily Hausdorff or evenT
0). We prove that ifT has a countable base and is not countable, thenT has cardinality at least continuum.
Partially supported by the Basic Research Fund, Israeli Academy of Sciences. Publication no. 454 done 6,8/1991.
Partially sponsored by the Edmund Landau Center for research in Mathematical Analysis, supported by the Minerva Foundation
(Germany). 相似文献
5.
We continue investigations of forcing notions with strong ccc properties introducing new methods of building sweet forcing notions. We also show that quotients of topologically sweet forcing notions over Cohen reals are topologically sweet while the quotients over random reals do not have to be such. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim) 相似文献
6.
A model in which strongness of is indestructible under + -weakly closed forcing notions satisfying the Prikry condition is constructed. This is applied to solve a question of Hajnal on the number of elements of {
|2
<}. 相似文献
7.
Saharon Shelah 《Israel Journal of Mathematics》1987,60(2):146-166
Let \(\bar B^* \) be a separable reduced (abelian)p-group which is torsion complete. We ask whether for \(G \subseteq \bar B^* \) there is \(H \subseteq _{pr} \bar B^* ,H[p] = G[p]\) ,H[p]=G[p],H not isomorphic toG. IfG is the sum of cyclic groups or is torsion complete, the answer is easily no. For otherG, we prove that the answer is yes assuming G.C.H. Even without G.C.H. the answer is yes if the density character ofG is equal to Min n<ω|p nG|, i.e., $$\mathop {Min}\limits_{n< \omega } |p^n G| = \mathop {Min}\limits_m \mathop \Sigma \limits_{n > m} |(p^n G)[p]/(p^{n + 1} G)[p]|$$ Of course, instead of two non-isomorphic we can get many, but we do not deal much with this. 相似文献
8.
The main result of this paper is that ifV satisfies GCH andω 1<λ<μ are arbitrary regular cardinals, then in some cardinal preserving forcing extensionW ofV we have λ<λ=λ=2 N 0,μ=2 λ and there are a hereditarily separableX ?2 λ with |X|= \(2^{\aleph _0 } \) =μ and a hereditarily LindelöfY ?2 μ withw(Y)= \(2^{2^\aleph 0} \) =μ. So far similar results have only been obtained under the assumption of CH. 相似文献
9.
Diestel Reinhard; Shelah Saharon; Steprans Juris 《Journal London Mathematical Society》1994,49(1):16-24
A graph is called dominating if its vertices can be labelledwith integers in such a way that for every function : thegraph contains a ray whose sequence of labels eventually exceeds. We obtain a characterization of these graphs by producinga small family of dominating graphs with the property that everydominating graph must contain some member of the family. 相似文献
10.
Shai Ben-David Saharon Shelah 《Proceedings of the American Mathematical Society》1996,124(9):2827-2837
We show that the transfer property for singular does not imply (even) the existence of a non-reflecting stationary subset of . The result assumes the consistency of ZFC with the existence of infinitely many supercompact cardinals. We employ a technique of ``resurrection of supercompactness'. Our forcing extension destroys the supercompactness of some cardinals; to show that in the extended model they still carry some of their compactness properties (such as reflection of stationary sets), we show that their supercompactness can be resurrected via a tame forcing extension.