首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   98篇
  免费   0篇
  国内免费   6篇
  2021年   1篇
  2020年   1篇
  2018年   1篇
  2017年   1篇
  2015年   3篇
  2014年   2篇
  2013年   9篇
  2012年   1篇
  2011年   1篇
  2010年   1篇
  2009年   3篇
  2008年   11篇
  2007年   8篇
  2006年   6篇
  2005年   6篇
  2004年   9篇
  2003年   9篇
  2002年   4篇
  2001年   4篇
  2000年   5篇
  1999年   2篇
  1998年   6篇
  1997年   2篇
  1996年   6篇
  1995年   1篇
  1988年   1篇
排序方式: 共有104条查询结果,搜索用时 15 毫秒
91.
It has been recently shown [4] that the lattice effect algebras can be treated as a subvariety of the variety of so-called basic algebras. The open problem whether all subdirectly irreducible distributive lattice effect algebras are just subdirectly irreducible MV-chains and the horizontal sum of two 3-element chains is in the paper transferred into a more tractable one. We prove that modulo distributive lattice effect algebras, the variety generated by MV-algebras and is definable by three simple identities and the problem now is to check if these identities are satisfied by all distributive lattice effect algebras or not. Presented by Daniele Mundici  相似文献   
92.
A continuous stochastic logic with a μ-operator μCSL is defined, and an interpretation through stochastic relations is proposed. We investigate morphisms for models of μCSL, showing that the associated congruences can be used for an investigation of bisimilarity. The Hennessy–Milner equivalence for μCSL is discussed, and it is shown that models are equivalent iff they are bisimilar, using a general criterion for bisimilarity from the theory of stochastic relations.  相似文献   
93.
94.
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  相似文献   
95.
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  相似文献   
96.
97.
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.  相似文献   
98.
99.
100.
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.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号