Search results for 'Lattices, Distributive' (try it on Scholar)

141 found
Sort by:
  1. Vincenzo Marra (2008). A Characterization of MV-Algebras Free Over Finite Distributive Lattices. Archive for Mathematical Logic 47 (3):263-276.score: 132.0
    Mundici has recently established a characterization of free finitely generated MV-algebras similar in spirit to the representation of the free Boolean algebra with a countably infinite set of free generators as any Boolean algebra that is countable and atomless. No reference to universal properties is made in either theorem. Our main result is an extension of Mundici’s theorem to the whole class of MV-algebras that are free over some finite distributive lattice.
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  2. Alejandro Petrovich (1996). Distributive Lattices with an Operator. Studia Logica 56 (1-2):205 - 224.score: 96.0
    It was shown in [3] (see also [5]) that there is a duality between the category of bounded distributive lattices endowed with a join-homomorphism and the category of Priestley spaces endowed with a Priestley relation. In this paper, bounded distributive lattices endowed with a join-homomorphism, are considered as algebras and we characterize the congruences of these algebras in terms of the mentioned duality and certain closed subsets of Priestley spaces. This enable us to characterize the simple and subdirectly (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  3. Viorica Sofronie-Stokkermans (2000). Duality and Canonical Extensions of Bounded Distributive Lattices with Operators, and Applications to the Semantics of Non-Classical Logics II. Studia Logica 64 (2):151-172.score: 96.0
    The main goal of this paper is to explain the link between the algebraic models and the Kripke-style models for certain classes of propositional non-classical logics. We consider logics that are sound and complete with respect to varieties of distributive lattices with certain classes of well-behaved operators for which a Priestley-style duality holds, and present a way of constructing topological and non-topological Kripke-style models for these types of logics. Moreover, we show that, under certain additional assumptions on the variety (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  4. Klaus Ambos-Spies, Peter A. Fejer, Steffen Lempp & Manuel Lerman (1996). Decidability of the Two-Quantifier Theory of the Recursively Enumerable Weak Truth-Table Degrees and Other Distributive Upper Semi-Lattices. Journal of Symbolic Logic 61 (3):880-905.score: 96.0
    We give a decision procedure for the ∀∃-theory of the weak truth-table (wtt) degrees of the recursively enumerable sets. The key to this decision procedure is a characterization of the finite lattices which can be embedded into the r.e. wtt-degrees by a map which preserves the least and greatest elements: a finite lattice has such an embedding if and only if it is distributive and the ideal generated by its cappable elements and the filter generated by its cuppable elements (...)
    Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  5. John Bell (1999). Boolean Algebras and Distributive Lattices Treated Constructively. Mathematical Logic Quarterly 45 (1):135-143.score: 96.0
    No categories
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  6. Alasdair Urquhart (1981). Distributive Lattices with a Dual Homomorphic Operation. II. Studia Logica 40 (4):391 - 404.score: 96.0
    An Ockham lattice is defined to be a distributive lattice with 0 and 1 which is equipped with a dual homomorphic operation. In this paper we prove: (1) The lattice of all equational classes of Ockham lattices is isomorphic to a lattice of easily described first-order theories and is uncountable, (2) every such equational class is generated by its finite members. In the proof of (2) a characterization of orderings of with respect to which the successor function is decreasing (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  7. Sergio Celani & Ramon Jansana (2005). Bounded Distributive Lattices with Strict Implication. Mathematical Logic Quarterly 51 (3):219-246.score: 96.0
    No categories
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  8. Sergio Arturo Celani (1999). Distributive Lattices with a Negation Operator. Mathematical Logic Quarterly 45 (2):207-218.score: 96.0
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  9. Roberto Cignoli (1996). Free Q-Distributive Lattices. Studia Logica 56 (1-2):23 - 29.score: 96.0
    The dual spaces of the free distributive lattices with a quantifier are constructed, generalizing Halmos' construction of the dual spaces of free monadic Boolean algebras.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  10. Yuri Gurevich (1983). Decision Problem for Separated Distributive Lattices. Journal of Symbolic Logic 48 (1):193-196.score: 96.0
    It is well known that for all recursively enumerable sets X 1 , X 2 there are disjoint recursively enumerable sets Y 1 , Y 2 such that $Y_1 \subseteq X_1, Y_2 \subseteq X_2$ and Y 1 ∪ Y 2 = X 1 ∪ X 2 . Alistair Lachlan called distributive lattices satisfying this property separated. He proved that the first-order theory of finite separated distributive lattices is decidable. We prove here that the first-order theory of all separated (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  11. Viorica Sofronie-Stokkermans (2000). Duality and Canonical Extensions of Bounded Distributive Lattices with Operators, and Applications to the Semantics of Non-Classical Logics I. Studia Logica 64 (1):93-132.score: 96.0
    The main goal of this paper is to explain the link between the algebraic and the Kripke-style models for certain classes of propositional logics. We start by presenting a Priestley-type duality for distributive lattices endowed with a general class of well-behaved operators. We then show that finitely-generated varieties of distributive lattices with operators are closed under canonical embedding algebras. The results are used in the second part of the paper to construct topological and non-topological Kripke-style models for logics (...)
    Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  12. Guram Bezhanishvili & Ramon Jansana (2011). Priestley Style Duality for Distributive Meet-Semilattices. Studia Logica 98 (1-2):83-122.score: 90.0
    We generalize Priestley duality for distributive lattices to a duality for distributive meet-semilattices. On the one hand, our generalized Priestley spaces are easier to work with than Celani’s DS-spaces, and are similar to Hansoul’s Priestley structures. On the other hand, our generalized Priestley morphisms are similar to Celani’s meet-relations and are more general than Hansoul’s morphisms. As a result, our duality extends Hansoul’s duality and is an improvement of Celani’s duality.
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  13. Saburo Tamura (1975). Two Identities for Lattices, Distributive Lattices and Modular Lattices with a Constant. Notre Dame Journal of Formal Logic 16 (1):137-140.score: 90.0
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  14. John Bell, A Representation Theory for Modalized Distributive Lattices.score: 84.0
    By a lattice we shall always mean a distributive lattice which is bounded, i.e. has both a bottom element 0 and a top element 1. Lattice homomorphisms will always be assumed to preserve 0 and 1.
    No categories
     
    My bibliography  
     
    Export citation  
  15. Alasdair Urquhart (1979). Distributive Lattices with a Dual Homomorphic Operation. Studia Logica 38 (2):201 - 209.score: 78.0
    The lattices of the title generalize the concept of a De Morgan lattice. A representation in terms of ordered topological spaces is described. This topological duality is applied to describe homomorphisms, congruences, and subdirectly irreducible and free lattices in the category. In addition, certain equational subclasses are described in detail.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  16. Gabriela Hauser-Bordalo (2011). Prime Filters, Normality and Irreducibility in Lattices. Studia Logica 98 (1-2):5-7.score: 78.0
    We recall some notions introduced and developed by António Aniceto Monteiro, and show how these notions have been used and generalised, thus establishing a direct and indirect influence of Monteiro’s work that extends to this day.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  17. Sebastiaan A. Terwijn (2007). Kripke Models, Distributive Lattices, and Medvedev Degrees. Studia Logica 85 (3):319 - 332.score: 74.0
    We define a variant of the standard Kripke semantics for intuitionistic logic, motivated by the connection between constructive logic and the Medvedev lattice. We show that while the new semantics is still complete, it gives a simple and direct correspondence between Kripke models and algebraic structures such as factors of the Medvedev lattice.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  18. George Georgescu (1991). F‐Multipliers and the Localization of Distributive Lattices II. Mathematical Logic Quarterly 37 (19‐22):293-300.score: 72.0
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  19. Joanna Grygiel (2011). Products of Skeletons of Finite Distributive Lattices. Bulletin of the Section of Logic 40 (1/2):55-61.score: 72.0
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  20. H. P. Sankappanavar (1985). Distributive Lattices with a Dual Endomorphism. Mathematical Logic Quarterly 31 (25‐28):385-392.score: 72.0
    No categories
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  21. Stefano Aguzzoli, Brunella Gerla & Vincenzo Marra (2008). Gödel Algebras Free Over Finite Distributive Lattices. Annals of Pure and Applied Logic 155 (3):183-193.score: 72.0
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  22. Bolesław Sobociński (1972). Certain Sets of Postulates for Distributive Lattices with the Constant Elements. Notre Dame Journal of Formal Logic 13 (1):119-123.score: 72.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  23. Joanna Grygiel (2004). Some Numerical Characterization of Finite Distributive Lattices. Bulletin of the Section of Logic 33 (3):127-133.score: 72.0
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  24. Saunders MacLane (1938). Review: M. H. Stone, Topological Representations of Distributive Lattices and Brouwerian Logics. [REVIEW] Journal of Symbolic Logic 3 (2):90-91.score: 72.0
    Direct download  
     
    My bibliography  
     
    Export citation  
  25. D. W. Miller (1979). Metric Postulates for Modular, Distributive, and Boolean Lattices. Bulletin of the Section of Logic 8 (4):191-195.score: 72.0
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  26. William Wernick (1965). Review: Boleslaw Sobocinski, Six New Sets of Independent Axioms for Distributive Lattices with O and I. [REVIEW] Journal of Symbolic Logic 30 (3):377-378.score: 72.0
    Direct download  
     
    My bibliography  
     
    Export citation  
  27. Bolesław Sobociński (1972). An Abbreviation of Croisot's Axiom-System for Distributive Lattices with $I$. Notre Dame Journal of Formal Logic 13 (1):139-141.score: 72.0
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  28. Bolesław Sobociński (1962). Six New Sets of Independent Axioms for Distributive Lattices with $O$ and $I$. Notre Dame Journal of Formal Logic 3 (3):187-192.score: 72.0
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  29. Sergio A. Celani & Ramón Jansana Ferrer (2005). Bounded Distributive Lattices with Strict Implication. Mathematical Logic Quarterly 51 (3):219.score: 72.0
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  30. S. T. Fedoryaev (1995). Decidable Algorithmic Problems on Relatively Complemented Distributive Lattices Which Cannot Be Simultaneously Decidable. Bulletin of Symbolic Logic 1:109.score: 72.0
     
    My bibliography  
     
    Export citation  
  31. Fred Galvin (1969). Review: U. L. Ersov, Decidability of the Elementary Theory of Relatively Complemented Distributive Lattices and of the Theory of Filters. [REVIEW] Journal of Symbolic Logic 34 (1):126-126.score: 72.0
    Direct download  
     
    My bibliography  
     
    Export citation  
  32. Mai Gehrke, Matt Insall & Klaus Kaiser (1990). Some Nonstandard Methods Applied to Distributive Lattices. Mathematical Logic Quarterly 36 (2):123-131.score: 72.0
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  33. Jacek Hawranek & Jan Zygmunt (1983). Some Elementary Properties of Conditionally Distributive Lattices. Bulletin of the Section of Logic 12 (3):117-120.score: 72.0
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  34. Reiner Hähnle (1998). Commodious Axiomatization of Quantifiers in Multiple-Valued Logic. Studia Logica 61 (1):101-121.score: 72.0
    We provide tools for a concise axiomatization of a broad class of quantifiers in many-valued logic, so-called distribution quantifiers. Although sound and complete axiomatizations for such quantifiers exist, their size renders them virtually useless for practical purposes. We show that for quantifiers based on finite distributive lattices compact axiomatizations can be obtained schematically. This is achieved by providing a link between skolemized signed formulas and filters/ideals in Boolean set lattices. Then lattice theoretic tools such as Birkhoff's representation theorem for (...)
    Direct download (9 more)  
     
    My bibliography  
     
    Export citation  
  35. M. Sambasiva Rao (2012). Normal Filters of Distributive Lattices. Bulletin of the Section of Logic 41 (3/4):131-143.score: 72.0
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  36. Nicholas Rescher (1952). Review: Yuki Wooyenaka, Remark on a Set of Postulates for Distributive Lattices. [REVIEW] Journal of Symbolic Logic 17 (1):67-68.score: 72.0
    Direct download  
     
    My bibliography  
     
    Export citation  
  37. Jürg Schmid (1979). Algebraically and Existentially Closed Distributive Lattices. Zeitschrift für Mathematische Logik Und Grundlagen der Mathematik 25 (33):525-530.score: 72.0
    No categories
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  38. Alasdair Urquhart (1977). Review: Raymond Balbes, Philip Dwinger, Distributive Lattices. [REVIEW] Journal of Symbolic Logic 42 (4):587-588.score: 72.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  39. H. E. Vaughan (1948). Review: Garrett Birkhoff, S. A. Kiss, A Ternary Operation in Distributive Lattices. [REVIEW] Journal of Symbolic Logic 13 (1):50-51.score: 72.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  40. H. E. Vaughan (1951). Review: Ladislav Rieger, A Note on Topological Representations of Distributive Lattices; Kiyoski Iseki, Une Condition Pour Qu'un Lattice Soit Distributif. [REVIEW] Journal of Symbolic Logic 16 (1):62-62.score: 72.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  41. Volker Weispfenning (1985). Quantifier Elimination for Distributive Lattices and Measure Algebras. Mathematical Logic Quarterly 31 (14‐18):249-261.score: 72.0
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  42. Michał Kozak (2009). Distributive Full Lambek Calculus has the Finite Model Property. Studia Logica 91 (2):201 - 216.score: 70.0
    We prove the Finite Model Property (FMP) for Distributive Full Lambek Calculus ( DFL ) whose algebraic semantics is the class of distributive residuated lattices ( DRL ). The problem was left open in [8, 5]. We use the method of nuclei and quasi–embedding in the style of [10, 1].
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  43. Angel J. Gil (2013). On Gentzen Relations Associated with Finite-Valued Logics Preserving Degrees of Truth. Studia Logica 101 (4):749-781.score: 60.0
    When considering m-sequents, it is always possible to obtain an m-sequent calculus VL for every m-valued logic (defined from an arbitrary finite algebra L of cardinality m) following for instance the works of the Vienna Group for Multiple-valued Logics. The Gentzen relations associated with the calculi VL are always finitely equivalential but might not be algebraizable. In this paper we associate an algebraizable 2-Gentzen relation with every sequent calculus VL in a uniform way, provided the original algebra L has a (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  44. Richard L. Epstein (1979). Degrees of Unsolvability: Structure and Theory. Springer-Verlag.score: 60.0
    The contributions in the book examine the historical and contemporary manifestations of organized crime, the symbiotic relationship between legitimate and ...
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  45. Josep M. Font & Ventura Verdú (1993). The Lattice of Distributive Closure Operators Over an Algebra. Studia Logica 52 (1):1 - 13.score: 60.0
    In our previous paper Algebraic Logic for Classical Conjunction and Disjunction we studied some relations between the fragmentL of classical logic having just conjunction and disjunction and the varietyD of distributive lattices, within the context of Algebraic Logic. The central tool in that study was a class of closure operators which we calleddistributive, and one of its main results was that for any algebraA of type (2,2) there is an isomorphism between the lattices of allD-congruences ofA and of all (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  46. Matthew Smedberg (2013). A Dense Family of Well-Behaved Finite Monogenerated Left-Distributive Groupoids. Archive for Mathematical Logic 52 (3-4):377-402.score: 54.0
    We construct a family $\fancyscript{F}$ , indexed by five integer parameters, of finite monogenerated left-distributive (LD) groupoids with the property that every finite monogenerated LD groupoid is a quotient of a member of $\fancyscript{F}$ . The combinatorial abundance of finite monogenerated LD groupoids is encoded in the congruence lattices of the groupoids $\fancyscript{F}$ , which we show to be extremely large.
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  47. Robert Goldblatt (2012). Topological Proofs of Some Rasiowa-Sikorski Lemmas. Studia Logica 100 (1-2):175-191.score: 52.0
    We give topological proofs of Görnemann’s adaptation to Heyting algebras of the Rasiowa-Sikorski Lemma for Boolean algebras; and of the Rauszer-Sabalski generalisation of it to distributive lattices. The arguments use the Priestley topology on the set of prime filters, and the Baire category theorem. This is preceded by a discussion of criteria for compactness of various spaces of subsets of a lattice, including spaces of filters, prime filters etc.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  48. M. Campercholi & D. Vaggione (2011). Algebraic Functions. Studia Logica 98 (1-2):285-306.score: 48.0
    Let A be an algebra. We say that the functions f 1 , . . . , f m : A n → A are algebraic on A provided there is a finite system of term-equalities $${{\bigwedge t_{k}(\overline{x}, \overline{z}) = s_{k}(\overline{x}, \overline{z})}}$$ satisfying that for each $${{\overline{a} \in A^{n}}}$$, the m -tuple $${{(f_{1}(\overline{a}), \ldots , f_{m}(\overline{a}))}}$$ is the unique solution in A m to the system $${{\bigwedge t_{k}(\overline{a}, \overline{z}) = s_{k}(\overline{a}, \overline{z})}}$$. In this work we present a collection of general (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  49. Ivo Düntsch & Ewa Orłowska (2011). Discrete Dualities for Double Stone Algebras. Studia Logica 99 (1-3):127-142.score: 48.0
    We present two discrete dualities for double Stone algebras. Each of these dualities involves a different class of frames and a different definition of a complex algebra. We discuss relationships between these classes of frames and show that one of them is a weakening of the other. We propose a logic based on double Stone algebras.
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  50. R. Gurevič (1988). On Ultracoproducts of Compact Hausdorff Spaces. Journal of Symbolic Logic 53 (1):294-300.score: 48.0
    I present solutions to several questions of Paul Bankston [2] by means of another version of the ultracoproduct construction, and explain the relation of ultracoproduct of compact Hausdorff spaces to other constructions combining topology, algebra and logic.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
1 — 50 / 141