PL
 |
EN
Nowa wersja platformy, zawierająca wyłącznie zasoby pełnotekstowe, jest już dostępna.
Przejdź na https://bibliotekanauki.pl
Preferencje help
Polish version English version Język
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 9

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  Heyting algebra
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available On k-cyclic SHn-algebra
100%
Fernandez A.
Bulletin of the Polish Academy of Sciences. Technical Sciences
|
2011
|
tom Vol. 59, nr 3
303-304
EN
In this work we consider a new class of algebra called k-cyclic SHn-algebra (A, T) where A is an SHn-algebra and T is a lattice endomorphism such that Tk(x) = x, for all x, k is a positive integer. The main goal of this paper is to show a Priestley duality theorem for k-cyclic SHn-algebra.
2
Content available Semi-Heyting Algebras and Identities of Associative Type
100%
Cornejo J. M. , Sankappanavar H. P.
Bulletin of the Section of Logic
|
2019
|
tom 48
|
nr 2
EN
An algebra A = ⟨A, ∨, ∧, →, 0, 1⟩ is a semi-Heyting algebra if ⟨A, ∨, ∧, 0, 1⟩ is a bounded lattice, and it satisfies the identities: x ∧ (x → y) ≈ x ∧ y, x ∧ (y → z) ≈ x ∧ [(x ∧ y) → (x ∧ z)], and x → x ≈ 1. 𝒮ℋ denotes the variety of semi-Heyting algebras. Semi-Heyting algebras were introduced by the second author as an abstraction from Heyting algebras.  They share several important properties with Heyting algebras.  An identity of associative type of length 3 is a groupoid identity, both sides of which contain the same three (distinct) variables that occur in any order and that are grouped in one of the two (obvious) ways. A subvariety of 𝒮ℋ is of associative type of length 3 if it is defined by a single identity of associative type of length 3. In this paper we describe all the distinct subvarieties of the variety 𝒮ℋ of asociative type of length 3.  Our main result shows that there are 3 such subvarities of 𝒮ℋ.
3
Content available remote A Discrete Representation for Dicomplemented Lattices
100%
Düntsch I. , Kwuida L. , Orłowska E.
Fundamenta Informaticae
|
2017
|
tom Vol. 156, nr 3/4
281--295
EN
Dicomplemented lattices were introduced as an abstraction of Wille’s concept algebras which provided negations to a concept lattice. We prove a discrete representation theorem for the class of dicomplemented lattices. The theorem is based on a topology free version of Urquhart’s representation of general lattices.
4
Content available Preserving Filtering Unification by Adding Compatible Operations to Some Heyting Algebras
88%
Dzik W. , Radeleczki S.
Bulletin of the Section of Logic
|
2016
|
tom 45
|
nr 3/4
EN
We show that adding compatible operations to Heyting algebras and to commutative residuated lattices, both satisfying the Stone law ¬x ⋁ ¬¬x = 1, preserves filtering (or directed) unification, that is, the property that for every two unifiers there is a unifier more general then both of them. Contrary to that, often adding new operations to algebras results in changing the unification type. To prove the results we apply the theorems of [9] on direct products of l-algebras and filtering unification. We consider examples of frontal Heyting algebras, in particular Heyting algebras with the successor, γ and G operations as well as expansions of some commutative integral residuated lattices with successor operations.
5
Content available remote Quantitative Analysis of Lattice-valued Kripke Structures
88%
Pan H. , Zhang M. , Wu H. , Chen Y.
Fundamenta Informaticae
|
2014
|
tom Vol. 135, nr 3
269--293
EN
To model and analyze systems with multi-valued information, in this paper, we present an extension of Kripke structures in the framework of complete residuted lattices, which we will refer to as lattice-valued Kripke structures (LKSs). We then show how the traditional trace containment and equivalence relations, can be lifted to the lattice-valued setting, and we introduce two families of lattice-valued versions of the relations. Further, we explore some interesting properties of these relations. Finally, we provide logical characterizations of our relations by a natural extension of linear temporal logic.
6
Content available remote Discrete Dualities for Heyting Algebras with Operators
75%
Orłowska E. , Rewitzky I.
Fundamenta Informaticae
|
2007
|
tom Vol. 81, nr 1-3
275-295
EN
Discrete dualities are presented for Heyting algebras with various modal operators, for Heyting algebras with an external negation, for symmetric Heyting algebras, and for Heyting-Brouwer algebras.
7
Content available remote Algebraic axiomatization of tense intuitionistic logic
75%
Chajda I.
Open Mathematics
|
2011
|
tom 9
|
nr 5
1185-1191
EN
We introduce two unary operators G and H on a relatively pseudocomplemented lattice which form an algebraic axiomatization of the tense quantifiers “it is always going to be the case that” and “it has always been the case that”. Their axiomatization is an extended version for the classical logic and it is in accordance with these operators on many-valued Łukasiewicz logic. Finally, we get a general construction of these tense operators on complete relatively pseudocomplemented lattice which is a power lattice via the so-called frame.
8
Content available remote Algebras of Definable and Rough Sets in Quasi Order-based Approximation Spaces
75%
Kumar A. , Banerjee M.
Fundamenta Informaticae
|
2015
|
tom Vol. 141, nr 1
37--55
EN
A pair of approximation operators, based on the notion of granules in generalized approximation spaces, was studied in an earlier work by the authors. In this article, we investigate algebraic structures formed by the definable sets and also by the rough sets determined by this pair of approximation operators. The definable sets are open sets of an Alexandrov topological space, and form a completely distributive lattice in which the set of completely join irreducible elements is join dense. The collection of rough sets also forms a similar structure. Representation results for such classes of completely distributive lattices as well as Heyting algebras in terms of definable and rough sets are obtained. Further, two unary operators on rough sets are considered, making the latter constitute a structure that is named a ‘rough lattice’. Representation results for rough lattices are proved.
9
Content available Quantum geometry, logic and probability
75%
Majid S.
Zagadnienia Filozoficzne w Nauce
|
2020
|
nr 69
191-236
EN
Quantum geometry on a discrete set means a directed graph with a weight associated to each arrow defining the quantum metric. However, these ‘lattice spacing’ weights do not have to be independent of the direction of the arrow. We use this greater freedom to give a quantum geometric interpretation of discrete Markov processes with transition probabilities as arrow weights, namely taking the diffusion form ∂+f = (−Δθ + q − p)f for the graph Laplacian Δθ, potential functions q, p built from the probabilities, and finite difference ∂+ in the time direction. Motivated by this new point of view, we introduce a ‘discrete Schrödinger process’ as ∂+ψ = ı(−Δ + V )ψ for the Laplacian associated to a bimodule connection such that the discrete evolution is unitary. We solve this explicitly for the 2-state graph, finding a 1-parameter family of such connections and an induced ‘generalised Markov process’ for f = |ψ|2 in which there is an additional source current built from ψ. We also mention our recent work on the quantum geometry of logic in ‘digital’ form over the field F2 = {0, 1}, including de Morgan duality and its possible generalisations.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.