全文获取类型
收费全文 | 1389篇 |
免费 | 159篇 |
国内免费 | 79篇 |
专业分类
化学 | 229篇 |
晶体学 | 1篇 |
力学 | 34篇 |
综合类 | 159篇 |
数学 | 745篇 |
物理学 | 459篇 |
出版年
2024年 | 3篇 |
2023年 | 21篇 |
2022年 | 31篇 |
2021年 | 41篇 |
2020年 | 36篇 |
2019年 | 50篇 |
2018年 | 32篇 |
2017年 | 31篇 |
2016年 | 40篇 |
2015年 | 32篇 |
2014年 | 56篇 |
2013年 | 59篇 |
2012年 | 37篇 |
2011年 | 59篇 |
2010年 | 60篇 |
2009年 | 97篇 |
2008年 | 76篇 |
2007年 | 91篇 |
2006年 | 89篇 |
2005年 | 80篇 |
2004年 | 62篇 |
2003年 | 66篇 |
2002年 | 64篇 |
2001年 | 45篇 |
2000年 | 38篇 |
1999年 | 39篇 |
1998年 | 33篇 |
1997年 | 28篇 |
1996年 | 31篇 |
1995年 | 51篇 |
1994年 | 24篇 |
1993年 | 26篇 |
1992年 | 17篇 |
1991年 | 9篇 |
1990年 | 13篇 |
1989年 | 13篇 |
1988年 | 8篇 |
1987年 | 8篇 |
1986年 | 5篇 |
1985年 | 6篇 |
1984年 | 3篇 |
1983年 | 5篇 |
1982年 | 2篇 |
1981年 | 2篇 |
1980年 | 3篇 |
1979年 | 2篇 |
1977年 | 1篇 |
1973年 | 1篇 |
1972年 | 1篇 |
排序方式: 共有1627条查询结果,搜索用时 15 毫秒
71.
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. 相似文献
72.
In this paper, we present the parallelization of tabu search on a network of workstations using PVM. Two parallelization strategies are integrated: functional decomposition strategy and multi-search threads strategy. In addition, domain decomposition strategy is implemented probabilistically. The performance of each strategy is observed and analyzed. The goal of parallelization is to speedup the search in finding better quality solutions. Observations support that both parallelization strategies are beneficial, with functional decomposition producing slightly better results. Experiments were conducted for the VLSI cell placement, an NP-hard problem, and the objective was to achieve the best possible solution in terms of interconnection length, timing performance (circuit speed), and area. The multiobjective nature of this problem is addressed using a fuzzy goal-based cost computation. 相似文献
73.
In this paper we study the relationship between Constraint Programming (CP) and Shortest Path (SP) problems. In particular, we show that classical, multicriteria, partially ordered, and modality-based SP problems can be naturally modeled and solved within the Soft Constraint Logic Programming (SCLP) framework, where logic programming is coupled with soft constraints. In this way we provide this large class of SP problems with a high-level and declarative linguistic support whose semantics takes care of both finding the cost of the shortest path(s) and also of actually finding the path(s). On the other hand, some efficient algorithms for certain classes of SP problems can be exploited to provide some classes of SCLP programs with an efficient way to compute their semantics. 相似文献
74.
75.
In this paper we introduce a modal theory which is sound and complete for arithmetical -interpretations in , in other words, we will show that is the -provability logic of . Moreover we will show that is decidable. As a by-product of these results, we show that has de Jongh property. 相似文献
76.
研究错误逻辑的知识表达模型,以错误逻辑理论结合生态文明"五位一体"所构建的生态文明建设指标体系,进行基于对象识别的知识表达.指标体系内的各元素分别被定义为错误逻辑模型中的事物、特征、函数和规则.建模时,首先进行事物分解,第二步进行特定事物下对应的特性及规则分解,最后根据判别规则G对错误函数f形式的影响,对各项指标所适用的错误函数类型进行分类.对象的生成可以为用矩阵这样的数据结构对逻辑知识进行系统化组织做前期准备. 相似文献
77.
Steffen Lewitzka 《Annals of Pure and Applied Logic》2019,170(2):218-250
In previous work [15], we presented a hierarchy of classical modal systems, along with algebraic semantics, for the reasoning about intuitionistic truth, belief and knowledge. Deviating from Gödel's interpretation of IPC in S4, our modal systems contain IPC in the way established in [13]. The modal operator can be viewed as a predicate for intuitionistic truth, i.e. proof. Epistemic principles are partially adopted from Intuitionistic Epistemic Logic IEL [4]. In the present paper, we show that the S5-style systems of our hierarchy correspond to an extended Brouwer–Heyting–Kolmogorov interpretation and are complete w.r.t. a relational semantics based on intuitionistic general frames. In this sense, our S5-style logics are adequate and complete systems for the reasoning about proof combined with belief or knowledge. The proposed relational semantics is a uniform framework in which also IEL can be modeled. Verification-based intuitionistic knowledge formalized in IEL turns out to be a special case of the kind of knowledge described by our S5-style systems. 相似文献
78.
In 2001, J.-M. Le Bars disproved the zero-one law (that says that every sentence from a certain logic is either true asymptotically almost surely (a.a.s.), or false a.a.s.) for existential monadic second order sentences (EMSO) on undirected graphs. He proved that there exists an EMSO sentence ? such that does not converge as (here, the probability distribution is uniform over the set of all graphs on the labeled set of vertices ). In the same paper, he conjectured that, for EMSO sentences with 2 first order variables, the zero-one law holds. In this paper, we disprove this conjecture. 相似文献
79.
80.
L. L. Maksimova 《Algebra and Logic》2006,45(1):49-66
We look at the interplay between the projective Beth property in non-classical logics and interpolation. Previously, we proved
that in positive logics as well as in superintuitionistic and modal ones, the projective Beth property PB2 follows from Craig's interpolation property and implies the restricted interpolation property IPR. Here, we show that IPR and PB2 are equivalent in positive logics, and also in extensions of the superintuitionistic logic KC and of the modal logic Grz.2.
Supported by RFBR grant No. 06-01-00358, by INTAS grant No. 04-77-7080, and by the Council for Grants (under RF President)
and State Aid of Fundamental Science Schools, project NSh-2069.2003.1.
__________
Translated from Algebra i Logika, Vol. 45, No. 1, pp. 85–113, January–February, 2006. 相似文献