Optimal triangular decompositions of matrices with entries from residuated lattices

We describe optimal decompositions of an n×m matrix I into a triangular product of an n×k matrix A and a k×m matrix B. We assume that the matrix entries are elements of a residuated lattice, which leaves binary matrices or matrices which contain numbers from the unit interval [0, 1] as special cases. The entries of I, A, and B represent grades to which objects have attributes, factors apply to objects, and attributes are particular manifestations of factors, respectively. This way, the decomposition provides a model for factor analysis of graded data. We prove that fixpoints of particular operators associated with I, which are studied in formal concept analysis, are optimal factors for decomposition of I in that they provide us with decompositions with the smallest number k of factors possible. Moreover, we describe transformations between the m-dimensional space of original attributes and the k-dimensional space of factors. We provide illustrative examples and remarks on the problem of computing the optimal decompositions. Even though we present the results for matrices, i.e. for relations between finite sets in terms of relations, the arguments behind are valid for relations between infinite sets as well.     

On the infinite-valued Łukasiewicz logic that preserves degrees of truth

Łukasiewicz’s infinite-valued logic is commonly defined as the set of formulas that take the value 1 under all evaluations in the Łukasiewicz algebra on the unit real interval. In the literature a deductive system axiomatized in a Hilbert style was associated to it, and was later shown to be semantically defined from Łukasiewicz algebra by using a “truth-preserving” scheme. This deductive system is algebraizable, non-selfextensional and does not satisfy the deduction theorem. In addition, there exists no Gentzen calculus fully adequate for it. Another presentation of the same deductive system can be obtained from a substructural Gentzen calculus. In this paper we use the framework of abstract algebraic logic to study a different deductive system which uses the aforementioned algebra under a scheme of “preservation of degrees of truth”. We characterize the resulting deductive system in a natural way by using the lattice filters of Wajsberg algebras, and also by using a structural Gentzen calculus, which is shown to be fully adequate for it. This logic is an interesting example for the general theory: it is selfextensional, non-protoalgebraic, and satisfies a “graded” deduction theorem. Moreover, the Gentzen system is algebraizable. The first deductive system mentioned turns out to be the extension of the second by the rule of Modus Ponens.While writing this paper, the authors were partially supported by grants MTM2004-03101 and TIN2004-07933-C03-02 of the Spanish Ministry of Education and Science, including FEDER funds of the European Union.     

Categorical abstract algebraic logic: Gentzen π ‐institutions and the deduction‐detachment property

Given a π ‐institution I , a hierarchy of π ‐institutions I ^{(n )} is constructed, for n ≥ 1. We call I ^{(n )} the n‐th order counterpart of I . The second‐order counterpart of a deductive π ‐institution is a Gentzen π ‐institution, i.e. a π ‐institution associated with a structural Gentzen system in a canonical way. So, by analogy, the second order counterpart I ⁽²⁾ of I is also called the “Gentzenization” of I . In the main result of the paper, it is shown that I is strongly Gentzen , i.e. it is deductively equivalent to its Gentzenization via a special deductive equivalence, if and only if it has the deduction‐detachment property . (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

On lattices of congruences of relational systems and universal algebras

Let \(\mathfrak{X}\) =〈X;R〉 be a relational system.X is a non-empty set andR is a collection of subsets ofX ^α, α an ordinal. The system of equivalence relations onX having the substitution property with respect to members ofR form a complete latticeC( \(\mathfrak{X}\) ) containing the identity but not necessarilyX×X. It is shown that for any relational system (X;R) there is a groupoid definable onX whose congruence lattice isC( \(\mathfrak{X}\) )U{X×X} . Theorem 2 and Corollary 2 contain some interesting combinatorial pecularities associated with oriented complete graphs and simple groupoids.     

相似剩余格及其对应逻辑系统的完备性

引入了相似剩余格的概念,讨论了剩余格上相似算子和等价算子的关系,并得到了真值剩余格和相似剩余格相互转化的方法.其次,研究了相似剩余格上的相似滤子,利用相似滤子刻画了可表示的相似剩余格.最后,引入了相似剩余格对应的逻辑系统,证明了其完备性定理,并得到了其成为半线性逻辑的条件.     

On the polynomial-space completeness of intuitionistic propositional logic

We present an alternative, purely semantical and relatively simple, proof of the Statman's result that both intuitionistic propositional logic and its implicational fragment are PSPACE-complete.This paper was supported by grant 401/01/0218 of the Grant Agency of the Czech Republic. % Mathematics Subject Classification (2000):     

Weight of the comprehension axiom in a theory based on logic without contractions

A set-theoretic LST system based on a logic without rules of contraction of identical formulas in the antecedent or succedent of sequents is introduced. The set-theoretic axioms used are the comprehension principle,

On compactness and cocompactness conditions for R-tors,R-pr and (big) lattices of classes of modules

We study conditions related to compactness and cocompactness for some (big) lattices of classes of modules and preradicals. Also, we give some characterizations in terms of rings and modules.     

Beyond abstract elementary classes: On the model theory of geometric lattices

Based on Crapo's theory of one point extensions of combinatorial geometries, we find various classes of geometric lattices that behave very well from the point of view of stability theory. One of them, $({\mathbf{K}}^3,?)$, is ω-stable, it has a monster model and an independence calculus that satisfies all the usual properties of non-forking. On the other hand, these classes are rather unusual, e.g. in $({\mathbf{K}}^3,?)$ the Smoothness Axiom fails, and so $({\mathbf{K}}^3,?)$ is not an AEC.     

On Computing the Size of a Lattice and Related Decision Problems

The problem of determining the size of a finite concept lattice is shown to be #P-complete. Since any finite lattice can be represented as a concept lattice, the problem of determining the size of a lattice given by the ordered sets of its irreducibles is also #P-complete. Some results about NP-completeness or polynomial tractability of decision problems related to concepts with bounded extent, intent, and the sum of both are given. These problems can be reformulated as decision problems about lattice elements generated by a certain amount of irreducibles.     

On the stable containment of two sets

This paper studies the stability of the set containment problem. Given two non-empty sets in the Euclidean space which are the solution sets of two systems of (possibly infinite) inequalities, the Farkas type results allow to decide whether one of the two sets is contained or not in the other one (which constitutes the so-called containment problem). In those situations where the data (i.e., the constraints) can be affected by some kind of perturbations, the problem consists of determining whether the relative position of the two sets is preserved by sufficiently small perturbations or not. This paper deals with this stability problem as a particular case of the maintaining of the relative position of the images of two set-valued mappings; first for general set-valued mappings and second for solution sets mappings of convex and linear systems. Thus the results in this paper could be useful in the postoptimal analysis of optimization problems with inclusion constraints.      

On a system of reaction-diffusion equations describing a population with two age groups

A system of reaction-diffusion equations modelling a population divided into juvenile and adult age groups is studied. The system is not co-operative but its linear part is and this makes it possible to establish existence, non-existence and stability results for non-negative solutions of the system in terms of the principal eigenvalue of the corresponding linearized system.     

On the differentiability of first integrals of two dimensional flows

By using techniques of differential geometry we answer the following open problem proposed by Chavarriga, Giacomini, Giné, and Llibre in 1999. For a given two dimensional flow, what is the maximal order of differentiability of a first integral on a canonical region in function of the order of differentiability of the flow? Moreover, we prove that for every planar polynomial differential system there exist finitely many invariant curves and singular points , such that has finitely many connected open components, and that on each of these connected sets the system has an analytic first integral. For a homogeneous polynomial differential system in , there exist finitely many invariant straight lines and invariant conical surfaces such that their complement in is the union of finitely many open connected components, and that on each of these connected open components the system has an analytic first integral.     

On the Caginalp phase‐field systems with two temperatures and the Maxwell–Cattaneo law

Our aim in this paper is to study generalizations of the nonconserved and conserved Caginalp phase‐field systems based on the Maxwell–Cattaneo law with two temperatures for heat conduction. In particular, we obtain well‐posedness results and study the dissipativity of the associated solution operators. Copyright © 2016 John Wiley & Sons, Ltd.     

On the existence and uniqueness of limit cycles in planar continuous piecewise linear systems without symmetry

Some techniques to show the existence and uniqueness of limit cycles, typically stated for smooth vector fields, are extended to continuous piecewise-linear differential systems.New results are obtained for systems with three linearity zones without symmetry and having one equilibrium point in the central region. We also revisit the case of systems with only two linear zones giving shorter proofs of known results.A relevant application to the McKean piecewise linear model of a single neuron activity is included.     

On the existence of nearly Kirkman triple systems with subsystems

It is proved in this paper that the necessary and sufficient conditions for the existence of an incomplete nearly Kirkman triple system INKTS(u, v) are u ≡ v ≡ 0 (mod 6), u ≥ 3v. As a consequence, we obtain a complete solution to the embedding problem for nearly Kirkman triple systems.      

On the relation between two different concepts of pullback attractors for non-autonomous dynamical systems

For an abstract dynamical system, we establish, under minimal assumptions, the existence of D-attractor, i.e. a pullback attractor for a given class D of families of time varying subsets of the phase space. We relate this concept with the usual attractor of fixed bounded sets, pointing out its usefulness in order to ensure the existence of this last attractor in particular situations. Moreover, we prove that under a simple assumption these two notions of attractors generate, in fact, the same object. This is then applied to a Navier-Stokes model, improving some previous results on attractor theory.     

On the control of queueing systems with failures and repairs

Several classes of problems can be modelled as queueing systems with failures where preventative maintenance has to be optimized: relevant examples are computer systems, databases and production lines. This paper studies a simple case of such a situation based on the M/M/1 queue where the state of the server can take two values (on, off); the transition on–off happens either when there is a failure or when one decides to maintain. The characterization and an approximation of an optimal policy are given. Extensions to more general models, including general Markov processes, are examined.