57,856 research outputs found

    A Categorical View on Algebraic Lattices in Formal Concept Analysis

    Full text link
    Formal concept analysis has grown from a new branch of the mathematical field of lattice theory to a widely recognized tool in Computer Science and elsewhere. In order to fully benefit from this theory, we believe that it can be enriched with notions such as approximation by computation or representability. The latter are commonly studied in denotational semantics and domain theory and captured most prominently by the notion of algebraicity, e.g. of lattices. In this paper, we explore the notion of algebraicity in formal concept analysis from a category-theoretical perspective. To this end, we build on the the notion of approximable concept with a suitable category and show that the latter is equivalent to the category of algebraic lattices. At the same time, the paper provides a relatively comprehensive account of the representation theory of algebraic lattices in the framework of Stone duality, relating well-known structures such as Scott information systems with further formalisms from logic, topology, domains and lattice theory.Comment: 36 page

    On periodic stable Auslander-Reiten components containing Heller lattices over the symmetric Kronecker algebra

    Full text link
    Let O\mathcal{O} be a complete discrete valuation ring, K\mathcal{K} its quotient field, and let AA be the symmetric Kronecker algebra over O\mathcal{O}. We consider the full subcategory of the category of AA-lattices whose objects are AA-lattices MM such that MOKM\otimes_{\mathcal{O}}\mathcal{K} is projective AOKA\otimes_{\mathcal{O}}\mathcal{K}-modules. In this paper, we study Heller lattices of indecomposable periodic modules over the symmetric Kronecker algebra. As a main result, we determine the shapes of stable Auslander-Reiten components containing Heller lattices of indecomposable periodic modules over the symmetric Kronecker algebra.Comment: 35 pages (v1), correct several errors (v2

    Lattices of quasi-equational theories as congruence lattices of semilattices with operators, Part I

    Get PDF
    We show that for every quasivariety K of structures (where both functions and relations are allowed) there is a semilattice S with operators such that the lattice of quasi-equational theories of K (the dual of the lattice of sub-quasivarieties of K) is isomorphic to Con(S,+,0,F). As a consequence, new restrictions on the natural quasi-interior operator on lattices of quasi-equational theories are found.Comment: Presented on International conference "Order, Algebra and Logics", Vanderbilt University, 12-16 June, 2007 25 pages, 2 figure

    On the isomorphism problem of concept algebras

    Get PDF
    Weakly dicomplemented lattices are bounded lattices equipped with two unary operations to encode a negation on {\it concepts}. They have been introduced to capture the equational theory of concept algebras \cite{Wi00}. They generalize Boolean algebras. Concept algebras are concept lattices, thus complete lattices, with a weak negation and a weak opposition. A special case of the representation problem for weakly dicomplemented lattices, posed in \cite{Kw04}, is whether complete {\wdl}s are isomorphic to concept algebras. In this contribution we give a negative answer to this question (Theorem \ref{T:main}). We also provide a new proof of a well known result due to M.H. Stone \cite{St36}, saying that {\em each Boolean algebra is a field of sets} (Corollary \ref{C:Stone}). Before these, we prove that the boundedness condition on the initial definition of {\wdl}s (Definition \ref{D:wdl}) is superfluous (Theorem \ref{T:wcl}, see also \cite{Kw09}).Comment: 15 page

    A fresh perspective on canonical extensions for bounded lattices

    Full text link
    This paper presents a novel treatment of the canonical extension of a bounded lattice, in the spirit of thetheory of natural dualities. At the level of objects, this can be achieved by exploiting the topological representation due to M. Ploscica, and the canonical extension can be obtained in the same manner as can be done in the distributive case by exploiting Priestley duality. To encompass both objects and morphismsthe Ploscica representation is replaced by a duality due to Allwein and Hartonas, recast in the style of Ploscica's paper. This leads to a construction of canonical extension valid for all bounded lattices,which is shown to be functorial, with the property that the canonical extension functor decomposes asthe composite of two functors, each of which acts on morphisms by composition, in the manner of hom-functors

    A class of infinite convex geometries

    Get PDF
    Various characterizations of finite convex geometries are well known. This note provides similar characterizations for possibly infinite convex geometries whose lattice of closed sets is strongly coatomic and lower continuous. Some classes of examples of such convex geometries are given.Comment: 10 page

    Formal Concept Analysis and Resolution in Algebraic Domains

    Full text link
    We relate two formerly independent areas: Formal concept analysis and logic of domains. We will establish a correspondene between contextual attribute logic on formal contexts resp. concept lattices and a clausal logic on coherent algebraic cpos. We show how to identify the notion of formal concept in the domain theoretic setting. In particular, we show that a special instance of the resolution rule from the domain logic coincides with the concept closure operator from formal concept analysis. The results shed light on the use of contexts and domains for knowledge representation and reasoning purposes.Comment: 14 pages. We have rewritten the old version according to the suggestions of some referees. The results are the same. The presentation is completely differen
    corecore