Formal Concepts and Residuation on Multilattices}

Let $\mathcal{A}_i: =(A_i,\le_i,\top_i,\odot_i,\to_i,\bot_i)$, $i=1,2$ be two complete residuated multilattices, $G$ (set of objects) and $M$ (set of attributes) be two nonempty sets and $(\varphi, \psi)$ a Galois connection between $A_1^G$ and $A_2^M$. In this work we prove that $$\mathcal{C}: =\{(h,f)\in A_1^G\times A_2^M \mid \varphi(h)=f \text{ and } \psi(f)=h \}$$ is a complete residuated multilattice. This is a generalization of a result by Ruiz-Calvi{\~n}o and Medina \cite{RM12} saying that if the (reduct of the) algebras $\mathcal{A}_i$, $i=1,2$ are complete multilattices, then $\mathcal{C}$ is a complete multilattice.Comment: 14 pages, 3 figure

Conceptual Factors and Fuzzy Data

With the growing number of large data sets, the necessity of complexity reduction applies today more than ever before. Moreover, some data may also be vague or uncertain. Thus, whenever we have an instrument for data analysis, the questions of how to apply complexity reduction methods and how to treat fuzzy data arise rather naturally. In this thesis, we discuss these issues for the very successful data analysis tool Formal Concept Analysis. In fact, we propose different methods for complexity reduction based on qualitative analyses, and we elaborate on various methods for handling fuzzy data. These two topics split the thesis into two parts. Data reduction is mainly dealt with in the first part of the thesis, whereas we focus on fuzzy data in the second part. Although each chapter may be read almost on its own, each one builds on and uses results from its predecessors. The main crosslink between the chapters is given by the reduction methods and fuzzy data. In particular, we will also discuss complexity reduction methods for fuzzy data, combining the two issues that motivate this thesis.Komplexitätsreduktion ist eines der wichtigsten Verfahren in der Datenanalyse. Mit ständig wachsenden Datensätzen gilt dies heute mehr denn je. In vielen Gebieten stößt man zudem auf vage und ungewisse Daten. Wann immer man ein Instrument zur Datenanalyse hat, stellen sich daher die folgenden zwei Fragen auf eine natürliche Weise: Wie kann man im Rahmen der Analyse die Variablenanzahl verkleinern, und wie kann man Fuzzy-Daten bearbeiten? In dieser Arbeit versuchen wir die eben genannten Fragen für die Formale Begriffsanalyse zu beantworten. Genauer gesagt, erarbeiten wir verschiedene Methoden zur Komplexitätsreduktion qualitativer Daten und entwickeln diverse Verfahren für die Bearbeitung von Fuzzy-Datensätzen. Basierend auf diesen beiden Themen gliedert sich die Arbeit in zwei Teile. Im ersten Teil liegt der Schwerpunkt auf der Komplexitätsreduktion, während sich der zweite Teil der Verarbeitung von Fuzzy-Daten widmet. Die verschiedenen Kapitel sind dabei durch die beiden Themen verbunden. So werden insbesondere auch Methoden für die Komplexitätsreduktion von Fuzzy-Datensätzen entwickelt

Fuzzy Sets, Fuzzy Logic and Their Applications

The present book contains 20 articles collected from amongst the 53 total submitted manuscripts for the Special Issue “Fuzzy Sets, Fuzzy Loigic and Their Applications” of the MDPI journal Mathematics. The articles, which appear in the book in the series in which they were accepted, published in Volumes 7 (2019) and 8 (2020) of the journal, cover a wide range of topics connected to the theory and applications of fuzzy systems and their extensions and generalizations. This range includes, among others, management of the uncertainty in a fuzzy environment; fuzzy assessment methods of human-machine performance; fuzzy graphs; fuzzy topological and convergence spaces; bipolar fuzzy relations; type-2 fuzzy; and intuitionistic, interval-valued, complex, picture, and Pythagorean fuzzy sets, soft sets and algebras, etc. The applications presented are oriented to finance, fuzzy analytic hierarchy, green supply chain industries, smart health practice, and hotel selection. This wide range of topics makes the book interesting for all those working in the wider area of Fuzzy sets and systems and of fuzzy logic and for those who have the proper mathematical background who wish to become familiar with recent advances in fuzzy mathematics, which has entered to almost all sectors of human life and activity

On the expressive power of Łukasiewicz square operator

The aim of the paper is to analyze the expressive power of the square operator of Łukasiewicz logic: ∗x=x⊙x⁠, where ⊙ is the strong Łukasiewicz conjunction. In particular, we aim at understanding and characterizing those cases in which the square operator is enough to construct a finite MV-chain from a finite totally ordered set endowed with an involutive negation. The first of our main results shows that, indeed, the whole structure of MV-chain can be reconstructed from the involution and the Łukasiewicz square operator if and only if the obtained structure has only trivial subalgebras and, equivalently, if and only if the cardinality of the starting chain is of the form n+1 where n belongs to a class of prime numbers that we fully characterize. Secondly, we axiomatize the algebraizable matrix logic whose semantics is given by the variety generated by a finite totally ordered set endowed with an involutive negation and Łukasiewicz square operator. Finally, we propose an alternative way to account for Łukasiewicz square operator on involutive Gödel chains. In this setting, we show that such an operator can be captured by a rather intuitive set of equation

Abstraktní studium úplnosti pro infinitární logiky

V této dizertační práci se zabýváme studiem vlastností úplnosti infinitárních výrokových logik z pohledu abstraktní algebraické logiky. Cílem práce je pochopit, jak lze základní nástroj v důkazech uplnosti, tzv. Lindenbaumovo lemma, zobecnit za hranici finitárních logik. Za tímto účelem studujeme vlastnosti úzce související s Lindenbaumovým lemmatem (a v důsledku také s vlastnostmi úplnosti). Uvidíme, že na základě těchto vlastností lze vystavět novou hierarchii infinitárních výrokových logik. Také se zabýváme studiem těchto vlastností v případě, kdy naše logika má nějaké (případně hodně obecně definované) spojky implikace, disjunkce a negace. Mimo jiné uvidíme, že přítomnost daných spojek může zajist platnost Lindenbaumova lemmatu. Keywords: abstraktní algebraická logika, infinitární logiky, Lindenbau- movo lemma, disjunkce, implikace, negaceIn this thesis we study completeness properties of infinitary propositional logics from the perspective of abstract algebraic logic. The goal is to under- stand how the basic tool in proofs of completeness, the so called Linden- baum lemma, generalizes beyond finitary logics. To this end, we study few properties closely related to the Lindenbaum lemma (and hence to com- pleteness properties). We will see that these properties give rise to a new hierarchy of infinitary propositional logic. We also study these properties in scenarios when a given logic has some (possibly very generally defined) connectives of implication, disjunction, and negation. Among others, we will see that presence of these connectives can ensure provability of the Lin- denbaum lemma. Keywords: abstract algebraic logic, infinitary logics, Lindenbaum lemma, disjunction, implication, negationKatedra logikyDepartment of LogicFaculty of ArtsFilozofická fakult

Lattice-valued Identities and an Classes of Lattice-valued Subalgebras

Neka je A neprazan skup i L = (L;·) proizvoljna mreža sa nulom i jedinicom. Svako preslikavanje A¯ : A ¡! L zovemo rasplinuti podskup od A. Uobičajeno je da se rasplinute podgrupe definišu na grupi. U radu su fazi podgrupe definisane na polugrupi kao i na rasplinutoj podpolugrupi. Jedan od glavnih rezultata je teorema o particiji rasplinutih kompletno regularnih polugrupa. Takođe su definisane rasplinute kongruencije i rasplinute jednakosti na rasplinutim podalgebrama neke algebre i ispitane njihove osobine. Uvedeni su pojmovi: podalgebre rasplinute podalgebre, rasplinutog homomorfizma rasplinute podalgebre na rasplinutu podalgebru i direktnog proizvoda rasplinutih podalgebri. Jedan od važnijih rezultata je teorema koja je uopštenje teoreme Birkhoff-a na rasplinutim strukturama.Let A be nonemptu set, and let L = (L; 6) be a lattice with 0 and 1. The mapping A¯ : A ! L is called fuzzy subset of A. It is usual to define fuzzy subgroup on the group. In this work fuzzy semigroups are defined on the semigroup and on the fuzzy subsemigroup, too. As a main result is theorem about partition fuzzy completlu regular semigroup. Also, fuzzy congruences are defined, and fuzzy equolites on fuzzy subalgebras of an algebra and their propertes are investigated. We introduced some new notions: subalgebras of fuzzy subalgebras, fuzzy homomorphism of fuzzy subalgebra, and direct product of fuzzy subalgebras. One of the most important result is extension of Birkhoff’s theorem on fuzzy structures

Foundations of Fuzzy Logic and Semantic Web Languages

This book is the first to combine coverage of fuzzy logic and Semantic Web languages. It provides in-depth insight into fuzzy Semantic Web languages for non-fuzzy set theory and fuzzy logic experts. It also helps researchers of non-Semantic Web languages get a better understanding of the theoretical fundamentals of Semantic Web languages. The first part of the book covers all the theoretical and logical aspects of classical (two-valued) Semantic Web languages. The second part explains how to generalize these languages to cope with fuzzy set theory and fuzzy logic