نتایج جستجو برای: heyting algebras regularity

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

D. Busneag D. Piciu

At present, the filter theory of $BL$textit{-}algebras has been widelystudied, and some important results have been published (see for examplecite{4}, cite{5}, cite{xi}, cite{6}, cite{7}). In other works such ascite{BP}, cite{vii}, cite{xiii}, cite{xvi} a study of a filter theory inthe more general setting of residuated lattices is done, generalizing thatfor $BL$textit{-}algebras. Note that fil...

A Banach lattice algebra is a Banach lattice, an associative algebra with a sub-multiplicative norm and the product of positive elements should be positive. In this note we study the Arens regularity and cohomological properties of Banach lattice algebras.

Assume that $A$‎, ‎$B$ are Banach algebras and that $m:Atimes Brightarrow B$‎, ‎$m^prime:Atimes Arightarrow B$ are bounded bilinear mappings‎. ‎We study the relationships between Arens regularity of $m$‎, ‎$m^prime$ and the Banach algebras $A$‎, ‎$B$‎. ‎For a Banach $A‎$‎-bimodule $B$‎, ‎we show that $B$ factors with respect to $A$ if and only if $B^{**}$ is unital as an $A^{**}‎$‎-module‎. ‎Le...

Journal: :Logical Methods in Computer Science 2017
Francesco Ranzato

We give a new order-theoretic characterization of a complete Heyting and co-Heyting algebra C. This result provides an unexpected relationship with the field of Nash equilibria, being based on the so-called Veinott ordering relation on subcomplete sublattices of C, which is crucially used in Topkis’ theorem for studying the order-theoretic stucture of Nash equilibria of supermodular games. Intr...

Journal: :Advances in Mathematics 2021

We prove that there exist profinite Heyting algebras are not isomorphic to the completion of any algebra. This resolves an open problem from 2009. More generally, we characterize those varieties in which completions. It turns out exists largest such. give different characterizations this variety and show it is finitely axiomatizable locally finite. From follows decidable whether a all members I...

2017
Peter Jipsen

This paper investigates connections between algebraic structures that are common in theoretical computer science and algebraic logic. Idempotent semirings are the basis of Kleene algebras, relation algebras, residuated lattices and bunched implication algebras. Extending a result of Chajda and Länger, we show that involutive residuated lattices are determined by a pair of dually isomorphic idem...

2008
Ingrid Rewitzky Larisa Maksimova

Duality theory emerged from the work by Marshall Stone [18] on Boolean algebras and distributive lattices in the 1930s. Later in the early 1970s Larisa Maksimova [10, 11] and Hilary Priestley [15, 16] developed analogous results for Heyting algebras, topological Boolean algebras, and distributive lattices. Duality for bounded, not necessarily distributive lattices, was developed by Alstir Urquh...

2011
Robert Goldblatt Leo Esakia R. Goldblatt

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 ...

Journal: :J. Symb. Log. 2001
Xavier Caicedo Roberto Cignoli

It is show11 that axiomatic extensions of intuitionistic propositional calculus defining univocally new connectives. including those proposed by Gabbay. are strongly complete with respect to valuations in Heyting algebras with additional operations. In all cases. the double negatio~l of such a connective is equivalent to a formula of intnitionistic calculus. Thus, under the excluded third law i...

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

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