Results 11 to 20 of about 75 (54)
Characterization of metrizable Esakia spaces via some forbidden configurations [PDF]
, 2019 By Priestley duality, each bounded distributive lattice is represented as the lattice of clopen upsets of a Priestley space, and by Esakia duality, each Heyting algebra is represented as the lattice of clopen upsets of an Esakia space.
Bezhanishvili, G, Carai, L
core +1 more source
Uniqueness Theorem in Complete Residuated Almost Distributive Lattices
Discussiones Mathematicae - General Algebra and Applications, 2019 Important properties of primary elements in a complete residuated ADL L and the uniqueness theorem in a complete complemented residuated ADL L are proved.
Rao G.C., Raju S.S.
doaj +1 more source
, 2015 The article continues the formalization of the lattice theory (as structures with two binary operations, not in terms of ordering relations). In the paper, the notion of a pseudocomplement in a lattice is formally introduced in Mizar, and based on this ...
Grabowski, Adam
core +2 more sources
Properties of complements in the lattice of convergence structures [PDF]
, 1979 Relative complements and differences are investigated for several convergence structure lattices, especially the lattices of Kent convergence structures and the lattice of pretopologies.
C. V. Riecke
core +5 more sources
A fundamental non-classical logic
, 2022 We give a proof-theoretic as well as a semantic characterization of a logic in the signature with conjunction, disjunction, negation, and the universal and existential quantifiers that we suggest has a certain fundamental status. We present a Fitch-style
Holliday, Wesley H.
core +1 more source
Structural Properties of the Cambrian Semilattices -- Consequences of Semidistributivity [PDF]
, 2015 The $\gamma$-Cambrian semilattices $\mathcal{C}_{\gamma}$ defined by Reading and Speyer are a family of meet-semilattices associated with a Coxeter group $W$ and a Coxeter element $\gamma\in W$, and they are lattices if and only if $W$ is finite.
Mühle, Henri
core
Semi-Heyting Algebras and Identities of Associative Type [PDF]
, 2019 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.
Cornejo, Juan M. +1 more
core +2 more sources
On Graphs Like Hypercubes [PDF]
, 2008 By defining new concepts like pseudocomplements in graphs a new class of graphs is obtained. They have very many properties in common with hypercubes and therefore they are called pseudocubes.
Nieminen Juhani +2 more
core +1 more source
The intuitionistic-like logic based on a poset
, 2023 The aim of the present paper is to show that the concept of intuitionistic logic based on a Heyting algebra can be generalized in such a way that it is formalized by means of a bounded poset.
Chajda, Ivan, Länger, Helmut
core
Intuitionistic-like unsharp implication and negation defined on a poset [PDF]
summary:The aim of the present paper is to show that the concepts of the intuitionistic implication and negation formalized by means of a Heyting algebra can be generalized in such a way that these concepts are formalized by means of a bounded poset.
Chajda, Ivan, Länger, Helmut
core +1 more source