Combined reasoning by automated cooperation

Different reasoning systems have different strengths and weaknesses, and often it is useful to combine these systems to gain as much as possible from their strengths and retain as little as possible from their weaknesses. Of particular interest is the integration of first-order and higher-order techniques. First-order reasoning systems, on the one hand, have reached considerable strength in some niches, but in many areas of mathematics they still cannot reliably solve relatively simple problems, for example, when reasoning about sets, relations, or functions. Higher-order reasoning systems, on the other hand, can solve problems of this kind automatically. But the complexity inherent in their calculi prevents them from solving a whole range of problems. However, while many problems cannot be solved by any one system alone, they can be solved by a combination of these systems.We present a general agent-based methodology for integrating different reasoning systems. It provides a generic integration framework which facilitates the cooperation between diverse reasoners, but can also be refined to enable more efficient, specialist integrations. We empirically evaluate its usefulness, effectiveness and efficiency by case studies involving the integration of first-order and higher-order automated theorem provers, computer algebra systems, and model generators.     

Weakly higher order cylindric algebras and finite axiomatization of the representables

We show that the variety of n-dimensional weakly higher order cylindric algebras, introduced in Németi [9], [8], is finitely axiomatizable when n > 2. Our result implies that in certain non-well-founded set theories the finitization problem of algebraic logic admits a positive solution; and it shows that this variety is a good candidate for being the cylindric algebra theoretic counterpart of Tarski’s quasi-projective relation algebras. Supported by the Hungarian National Foundation for Scientific Research grant T73601.     

部件、结构和名称对图形相似性判断的影响

以不同基本形状构成的几何图形为材料,研究了图形的部件形状、整体结构和名称对相似判断的影响。结论为:1)部件形状、整体结构和名称对相似判断估计值均有非常显著影响,且部件形状和整体结构的交互作用也非常显著;2)部件形状、整体结构和名称对相似判断反应时没有显著的影响,但部件形状和整体结构、整体结构和名称两组交互作用均非常显著;3)部件形状和整体结构相同对相似判断估计值的影响更大;名称和部件形状、名称和整体结构相同的条件居次;只有一个因素相同时,部件形状相同影响最大,其次是整体结构和名称。     

The Hennessy–Milner equivalence for continuous time stochastic logic with mu-operator

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.     

On the Nature of Continuous Physical Quantities in Classical and Quantum Mechanics

Journal of Philosophical Logic - Within the traditional Hilbert space formalism of quantum mechanics, it is not possible to describe a particle as possessing, simultaneously, a sharp position value...     

Generalized structured component analysis

We propose an alternative method to partial least squares for path analysis with components, called generalized structured component analysis. The proposed method replaces factors by exact linear combinations of observed variables. It employs a well-defined least squares criterion to estimate model parameters. As a result, the proposed method avoids the principal limitation of partial least squares (i.e., the lack of a global optimization procedure) while fully retaining all the advantages of partial least squares (e.g., less restricted distributional assumptions and no improper solutions). The method is also versatile enough to capture complex relationships among variables, including higher-order components and multi-group comparisons. A straightforward estimation algorithm is developed to minimize the criterion.The work reported in this paper was supported by Grant A6394 from the Natural Sciences and Engineering Research Council of Canada to the second author. We wish to thank Richard Bagozzi for permitting us to use his organizational identification data and Wynne Chin for providing PLS-Graph 3.0.     

Fragments of R-Mingle

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     

Quasi-varieties: A special access

Quasi-equational logic concerns with a completeness theorem, i. e. a list of general syntactical rules such that, being given a set of graded quasi-equations Q, the closure Cl Q = Qeq Fun Q can be derived from by the given rules. Those rules do exist, because our consideration could be embedded into the logic of first order language. But, we look for special (quasi-equational) rules. Suitable rules were already established for the (non-functorial) case of partial algebras in Definition 3.1.2 of [27], p. 108, and [28], p. 102. (For the case of total algebras, see [35].) So, one has to translate these rules to the (functorial) language of partial theories .Surprisingly enough, partial theories can be replaced up to isomorphisms by partial Dale monoids (cf. Section 3), which, in the total case are ordinary monoids.Special issue of Studia Logica: Algebraic Theory of Quasivarieties Presented by M. E. Adams, K. V. Adaricheva, W. Dziobiak, and A. V. Kravchenko     

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