全文获取类型
收费全文 | 146篇 |
免费 | 1篇 |
专业分类
147篇 |
出版年
2021年 | 4篇 |
2020年 | 2篇 |
2019年 | 3篇 |
2018年 | 5篇 |
2017年 | 3篇 |
2016年 | 3篇 |
2014年 | 2篇 |
2013年 | 11篇 |
2011年 | 7篇 |
2010年 | 4篇 |
2009年 | 8篇 |
2007年 | 3篇 |
2006年 | 2篇 |
2005年 | 6篇 |
2004年 | 7篇 |
2003年 | 3篇 |
2002年 | 4篇 |
1998年 | 1篇 |
1997年 | 1篇 |
1996年 | 2篇 |
1995年 | 4篇 |
1994年 | 5篇 |
1993年 | 1篇 |
1992年 | 1篇 |
1991年 | 2篇 |
1990年 | 3篇 |
1989年 | 2篇 |
1988年 | 1篇 |
1987年 | 1篇 |
1986年 | 4篇 |
1985年 | 4篇 |
1984年 | 3篇 |
1982年 | 2篇 |
1981年 | 2篇 |
1978年 | 2篇 |
1976年 | 2篇 |
1975年 | 1篇 |
1974年 | 1篇 |
1973年 | 1篇 |
1972年 | 1篇 |
1971年 | 1篇 |
1968年 | 1篇 |
1967年 | 2篇 |
1962年 | 2篇 |
1961年 | 2篇 |
1960年 | 1篇 |
1958年 | 1篇 |
1956年 | 2篇 |
1955年 | 1篇 |
1949年 | 1篇 |
排序方式: 共有147条查询结果,搜索用时 15 毫秒
1.
Andrzej W. Jankowski 《Studia Logica》1986,45(2):155-166
D. Scott in his paper [5] on the mathematical models for the Church-Curry -calculus proved the following theorem.A topological space X. is an absolute extensor for the category of all topological spaces iff a contraction of X. is a topological space of Scott's open sets in a continuous lattice.In this paper we prove a generalization of this theorem for the category of , -closure spaces. The main theorem says that, for some cardinal numbers , , absolute extensors for the category of , -closure spaces are exactly , -closure spaces of , -filters in , >-semidistributive lattices (Theorem 3.5).If = and = we obtain Scott's Theorem (Corollary 2.1). If = 0 and = we obtain a characterization of closure spaces of filters in a complete Heyting lattice (Corollary 3.4). If = 0 and = we obtain a characterization of closure space of all principial filters in a completely distributive complete lattice (Corollary 3.3). 相似文献
2.
The main theorem says that a consequence operator is an effective part of the consequence operator for the classical prepositional calculus iff it is a consequence operator for a logic satisfying the compactness theorem, and in which every finitely axiomatizable theory is decidable. 相似文献
3.
Dr. Andrzej Kocikowski 《Science and engineering ethics》1996,2(2):201-210
Several context-specific social and political factors in Eastern and Central Europe are described — factors that must be considered
while developing strategies to introduce Computer Ethics. Poland is used as a primary example. GNP per capita, the cost of
hardware and software, uneven and scant distribution of computing resources, and attitudes toward work and authority are discussed.
Such “geographical factors” must be taken into account as the new field of Computer Ethics develops. 相似文献
4.
Andrzej Strzalecki 《Acta psychologica》1978,42(5):429-440
The purpose of this experiment has been to test the value of an exponent of the power function describing the relation between emotional involvement and subjective distance, called the inverse square root law (Ekman and Bratfisch 1965). A group of 113 subjects were instructed to estimate 65 inter-city distances with Opole, Poland, as the center, and, next, to estimate the importance attributed to the cities, their own personal interest in them and involvement to them. The experiment partly confirmed the results obtained in original investigations, that is the inverse square root law holds true for cities of a range of distance not exceeding about 5000 km. For more distant cities a different trend has been observed, namely an increase of emotional involvement with increase of subjective distance to these cities. This might lead to the supposition that the relation between emotional involvement and subjective distance could be described by a parabolic relation. 相似文献
5.
Periods of 24 to 48 hours of food deprivation reliably induced pup-killing in 30–50% of non-killer male mice. The behavior was prevented by previous experience with young and did not perseverate to non-deprived states. Castrated males and intact females also exhibited pup-killing following food deprivation, suggesting that the behavior is neither sexdependent nor related to the presence of testosterone. The findings are discussed in terms of their relationship to predatory behaviors and population dynamics. 相似文献
6.
Studia Logica - Pietruszczak (Bull Sect Log 38(3/4):163–171, 2009. https://doi.org/10.12775/LLP.2009.013) proved that the normal logics $$\mathrm {K45}$$, $$\mathrm {KB4}$$ ($$=\mathrm... 相似文献
7.
8.
9.
10.
Grammar logics were introduced by Fariñas del Cerro and Penttonen in 1988 and have been widely studied. In this paper we consider regular grammar logics with converse (REG c logics) and present sound and complete tableau calculi for the general satisfiability problem of REG c logics and the problem of checking consistency of an ABox w.r.t. a TBox in a REG c logic. Using our calculi we develop ExpTime (optimal) tableau decision procedures for the mentioned problems, to which various optimization techniques can be applied. We also prove a new result that the data complexity of the instance checking problem in REG c logics is coNP-complete. 相似文献