Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Structures of compactly generated lattices described by cut sets of L-valued sets

Structures of compactly generated lattices described by cut sets of L-valued sets This paper describes the distributivity, the modularity, the semimodularity and the lower semimodularity of compactly generated lattices from a view of cut sets of L-valued sets, respectively. Applying terms of cut sets of L-valued sets, it gives some sufficient and necessary conditions which can be used to determine whether a compactly generated lattice is distributive, modular, semimodular and lower semimodular, respectively. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Soft Computing Springer Journals

Structures of compactly generated lattices described by cut sets of L-valued sets

Zuo, Kai; Wang, Xue-ping; Zhang, Xiaohong
Soft Computing , Volume 23 (12) – Jun 2, 2018
Download PDF
8 pages

Loading next page...
 
/lp/springer_journal/structures-of-compactly-generated-lattices-described-by-cut-sets-of-l-tFwjiS96vu
Publisher
Springer Journals
Copyright
Copyright © 2018 by Springer-Verlag GmbH Germany, part of Springer Nature
Subject
Engineering; Computational Intelligence; Artificial Intelligence; Mathematical Logic and Foundations; Control, Robotics, Mechatronics
ISSN
1432-7643
eISSN
1433-7479
DOI
10.1007/s00500-018-3275-x
Publisher site
See Article on Publisher Site

Abstract

This paper describes the distributivity, the modularity, the semimodularity and the lower semimodularity of compactly generated lattices from a view of cut sets of L-valued sets, respectively. Applying terms of cut sets of L-valued sets, it gives some sufficient and necessary conditions which can be used to determine whether a compactly generated lattice is distributive, modular, semimodular and lower semimodular, respectively.

Journal

Soft Computing – Springer Journals

Published: Jun 2, 2018

References

  • Fuzzy relational systems: foundations and principles
    Bělohlávek, R
  • Fuzzy equational logic, studies in fuzziness and soft computing
    Bělohlávek, R; Vychodil, V
  • Cut sets as recognizable tree languages
    Borchardt, B; Maletti, A; Šešelja, B; Tepavčević, A; Vogler, H
  • Efficient multiple-valued model-checking using lattice representations
    Chechik, M; Devereux, B; Easterbrook, S; Lai, AYC; Petrovykh, V
  • Algebraic theory of lattices
    Crawley, P; Dilworth, RP
  • A cover-preserving embedding of semimodular lattices into geometric lattices
    Czédli, G; Schmidt, Tamás E
  • L-fuzzy sets
    Goguen, JA
  • Lattice representations of interval-valued fuzzy sets
    Gorjanac-Ranitović, M; Petojević, A
  • A lattice-theoretical characterization of the family of cut sets of interval-valued fuzzy sets
    Gorjanac-Ranitović, M; Tepavčević, A
  • Lattice theory: special topics and applications
    Grätzer, G; Wehrung, F
  • On lattice valued up-sets and down sets
    Jiménez, J; Montes, S; Šešelja, B; Tepavčević, A
  • Lattice-valued approach to closed sets under fuzzy relations: theory and applications
    Jiménez, J; Montes, S; Šešelja, B; Tepavčević, A
  • On generalizations of fuzzy algebras and congruence
    Šešelja, B; Tepavčević, A
  • Completion of ordered structures by cuts of fuzzy sets: an overview
    Šešelja, B; Tepavčević, A
  • Representing ordered structures by fuzzy sets: an overview
    Šešelja, B; Tepavčević, A
  • A note on a natural equivalence relation on fuzzy power set
    Šešelja, B; Tepavčević, A
  • A note on cut-worthiness of recognizable tree series
    Šešelja, B; Tepavčević, A; Vogler, H
  • Isometrical embeddings of lattices into geometric lattices
    Skublics, B