نتایج جستجو برای: complete residuated lattice

تعداد نتایج: 450308  

Journal: :Int. J. Approx. Reasoning 2009
Hongliang Lai Dexue Zhang

This paper presents a comparative study of concept lattices of fuzzy contexts based on formal concept analysis and rough set theory. It is known that every complete fuzzy lattice can be represented as the concept lattice of a fuzzy context based on formal concept analysis [R. Bělohlávek, Concept lattices and order in fuzzy logic, Ann. Pure Appl. Logic 128 (2004) 277–298]. This paper shows that ...

Journal: :Ann. Pure Appl. Logic 2009
Roberto Cignoli Francesc Esteva

By a symmetric residuated lattice we understand an algebra A = (A,∨,∧, ∗,→,∼, 1, 0) such that (A,∨,∧, ∗,→, 1, 0) is a commutative integral bounded residuated lattice and the equations ∼∼ x = x and ∼ (x ∨ y) =∼ x∧ ∼ y are satisfied. The aim of the paper is to investigate properties of the unary operation ε defined by the prescription εx :=∼ x → 0. We give necessary and sufficient conditions for ...

Journal: :Int. J. Approx. Reasoning 2015
Vilém Vychodil

We present a logic for reasoning about graded inequalities which generalizes the ordinary inequational logic used in universal algebra. The logic deals with atomic predicate formulas of the form of inequalities between terms and formalizes their semantic entailment and provability in graded setting which allows to draw partially true conclusions from partially true assumptions. We follow the Pa...

Journal: :Reports on Mathematical Logic 2005
James G. Raftery Clint J. van Alten

The assertional logic S(BCIA) of the quasivariety of BCI-algebras (in Iseki's sense) is axiomatized, relative to pure implicational logic BCI, by the rule x, y, x → y (G) (see [1]). Alternatively, the role of (G) can be played by x x → (y → y) (1) (see [2]). The formula (x → x) → (y → y) (2) is a theorem of S(BCIA). In [2, Proposition 22] we claimed erroneously that, relative to BCI, the axiom ...

Journal: :J. Log. Comput. 2011
Félix Bou Francesc Esteva Lluis Godo Ricardo Oscar Rodríguez

This article deals with many-valued modal logics, based only on the necessity operator, over a residuated lattice. We focus on three basic classes, according to the accessibility relation, of Kripke frames: the full class of frames evaluated in the residuated lattice (and so defining the minimum modal logic), the ones evaluated in the idempotent elements and the ones only evaluated in 0 and 1. ...

2009
Nikolaos Galatos Peter Jipsen

Petr Hájek identified the logic BL, that was later shown to be the logic of continuous t-norms on the unit interval, and defined the corresponding algebraic models, BL-algebras, in the context of residuated lattices. The defining characteristics of BL-algebras are representability and divisibility. In this short note we survey recent developments in the study of divisible residuated lattices an...

2010
Radim Belohlávek Jan Konecny

The paper is a continuation of our previous paper on operators and spaces associated to matrices whose degrees are elements from a residuated lattice. The motivation for this study is to develop a calculus for such matrices which can be used in situations such as matrix decompositions. In this paper, we focus on row and column spaces, left and right ideals of matrices, and Green’s relations. We...

Journal: :Ann. Pure Appl. Logic 2014
Leonardo Manuel Cabrer José Gil-Férez

In the same paper they present algebraic characterizations for all these notions and investigate their relation with the usual interpolation properties. The authors also remark: “only a few properties specific to FL-algebras or residuated lattices are used in our discussion,” and they propose the study of these interpolation properties in a more general setting. The objective of the present pap...

2008
Chi–Keung Chow

Discretizations of the Laplacian operator on non-hypercubical lattices are discussed in a systematic approach. It is shown that order a2 errors always exist for discretizations involving only nearest neighbors. Among all lattices with the same density of lattice sites, the hypercubical lattices always have errors smaller than other lattices with the same number of spacetime dimensions. On the o...

Journal: :Synthese 2015
Szabolcs Mikulás

We show that the equational theory of representable lower semilattice-ordered residuated semigroups is finitely based. We survey related results.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید