Dominions in quasivarieties of universal algebras

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 a^f = a^g. 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     

On the consistency problem for the calculus

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.     

Łukasiewicz-Moisil Relation Algebras

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.     

Semantic representations of word meanings by the cerebral hemispheres

Two priming experiments investigated kind and strength of semantic knowledge underlying known, frontier, and unknown low frequency words. Results from Experiment 1 suggest that known words reflect categorical knowledge, but frontier and unknown words reflect thematic knowledge. Thematic knowledge for frontier words appears to be stronger than that for unknown words. Experiment 2 entailed visual half-field presentation of targets. All facilitory effects were restricted to the lvf/RH, and inhibitory effects to the rvf/LH. Experiment 1 findings were mirrored by the RH. Thematic knowledge appears to precede categorical knowledge for the RH, but the opposite may be true of the LH. Results are also discussed in terms of the RH role in meaning acquisition and metacontrol.     

图式化程度对解决代数文字题的影响

本研究探讨了图式化程度即例子的概括化程度对解决代数文字题的影响。结果表明 :(1 )例子的表层类似性与目标问题具有一种格式塔的同型效应 ,容易解决“属性”一一对应的问题。 (2 )由例子表层类似性构成的图式化程度低 ,迁移的范围比较窄 ;由例子结构类似性构成的图式化程度高 ,适用的范围比较宽。 (3 )尽管增加了例子与目标问题的难度 ,由结构类似性形成的代数图式仍然可以比较容易地解决目标问题     

Representation of Game Algebras

We prove that every abstractly defined game algebra can be represented as an algebra of consistent pairs of monotone outcome relations over a game board. As a corollary we obtain Goranko's result that van Benthem's conjectured axiomatization for equivalent game terms is indeed complete.