全文获取类型
收费全文 | 325篇 |
免费 | 63篇 |
国内免费 | 48篇 |
专业分类
436篇 |
出版年
2024年 | 1篇 |
2023年 | 10篇 |
2022年 | 4篇 |
2021年 | 19篇 |
2020年 | 17篇 |
2019年 | 21篇 |
2018年 | 21篇 |
2017年 | 20篇 |
2016年 | 20篇 |
2015年 | 19篇 |
2014年 | 22篇 |
2013年 | 36篇 |
2012年 | 14篇 |
2011年 | 19篇 |
2010年 | 12篇 |
2009年 | 18篇 |
2008年 | 18篇 |
2007年 | 21篇 |
2006年 | 17篇 |
2005年 | 14篇 |
2004年 | 18篇 |
2003年 | 18篇 |
2002年 | 7篇 |
2001年 | 6篇 |
2000年 | 8篇 |
1999年 | 4篇 |
1998年 | 6篇 |
1997年 | 5篇 |
1996年 | 7篇 |
1995年 | 2篇 |
1993年 | 1篇 |
1992年 | 1篇 |
1990年 | 1篇 |
1989年 | 1篇 |
1988年 | 2篇 |
1986年 | 2篇 |
1984年 | 1篇 |
1983年 | 1篇 |
1977年 | 1篇 |
1976年 | 1篇 |
排序方式: 共有436条查询结果,搜索用时 0 毫秒
401.
The logic RM and its basic fragments (always with implication) are considered here as entire consequence relations, rather than as sets of theorems. A new observation made here is that the disjunction of RM is definable in terms of its other positive propositional connectives, unlike that of R. The basic fragments of RM therefore fall naturally into two classes, according to whether disjunction is or is not definable. In the equivalent quasivariety semantics of these fragments, which consist of subreducts of Sugihara algebras, this corresponds to a distinction between strong and weak congruence properties. The distinction is explored here. A result of Avron is used to provide a local deduction-detachment theorem for the fragments without disjunction. Together with results of Sobociski, Parks and Meyer (which concern theorems only), this leads to axiomatizations of these entire fragments — not merely their theorems. These axiomatizations then form the basis of a proof that all of the basic fragments of RM with implication are finitely axiomatized consequence relations.Special issue of Studia Logica: Algebraic Theory of Quasivarieties Presented by
M. E. Adams, K. V. Adaricheva, W. Dziobiak, and A. V. Kravchenko 相似文献
402.
Alexander Budkin 《Studia Logica》2004,78(1-2):107-127
The dominion of a subalgebra H in an universal algebra A (in a class
) is the set of all elements
such that for all homomorphisms
if f, g coincide on H, then af = ag. We investigate the connection between dominions and quasivarieties. We show that if a class
is closed under ultraproducts, then the dominion in
is equal to the dominion in a quasivariety generated by
. Also we find conditions when dominions in a universal algebra form a lattice and study this lattice.Special issue of Studia Logica: Algebraic Theory of Quasivarieties Presented by
M. E. Adams, K. V. Adaricheva, W. Dziobiak, and A. V. Kravchenko 相似文献
403.
We investigate the expressive power of Parikh's Game Logic interpreted in Kripke structures, and show that the syntactical alternation hierarchy of this logic is strict. This is done by encoding the winning condition for parity games of rank n. It follows that Game Logic is not captured by any finite level of the modal -calculus alternation hierarchy. Moreover, we can conclude that model checking for the -calculus is efficiently solvable iff this is possible for Game Logic 相似文献
404.
Games are defined as ongoing series of complementary ulterior transactions that are superficially plausible but have a concealed motivation to maximize pay-offs and minimize penalties for the initiator. While some games are harmless and part of socialization, others are destructive. Destructive game-playing in clinical supervision, in which game-playing (initiated by either supervisors or students) interferes with a student's realization of internship goals, has been documented in some allied healthcare professions but has not yet been studied in genetic counseling. Genetic counselors and clinical supervisors of genetic counseling students were anonymously surveyed regarding their experiences with destructive game-playing. Results show that such games do occur in genetic counseling clinical supervision. Some games are the same or similar to ones previously described in other health-care professions; others may be unique to genetic counseling. The purpose of this paper is to document these games as a first step to facilitating dialogue, understanding and awareness of them. 相似文献
405.
406.
In this paper, we further investigate the consistency problem for the qualitative temporal calculus introduced by Pujari et al. [A.K. Pujari, G.V. Kumari, A. Sattar, INDU: An interval and duration network, in: Australian Joint Conference on Artificial Intelligence, 1999, pp. 291–303]. We prove the intractability of the consistency problem for the subset of pre-convex relations, and the tractability of strongly pre-convex relations. Furthermore, we also define another interesting set of relations for which the consistency problem can be decided by the -closure method, a method similar to the usual path-consistency method. Finally, we prove that the -closure method is also complete for the set of atomic relations of implying that the intervals have the same duration. 相似文献
407.
408.
409.
410.
We introduce Łukasiewicz-Moisil relation algebras, obtained by considering a relational dimension over Łukasiewicz-Moisil
algebras. We prove some arithmetical properties, provide a characterization in terms of complex algebras, study the connection
with relational Post algebras and characterize the simple structures and the matrix relation algebras. 相似文献