The structure of interlaced bilattices
From MaRDI portal
Publication:4715676
DOI10.1017/S0960129500001018zbMath0856.06005OpenAlexW2084592088MaRDI QIDQ4715676
Publication date: 18 November 1996
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0960129500001018
varietyequational basisbounded latticesfinite set of equationsinterlaced bilatticesGinsberg-Fitting product
Related Items
A family of strict/tolerant logics ⋮ A BILATTICE-BASED FRAMEWORK FOR HANDLING GRADED TRUTH AND IMPRECISION ⋮ Constraint tableaux for two-dimensional fuzzy logics ⋮ Bilattices with implications ⋮ Residuated bilattices ⋮ Unnamed Item ⋮ Weakly idempotent lattices and bilattices, non-idempotent Plonka functions. ⋮ L-concept lattices with positive and negative attributes: modeling uncertainty and reduction of size ⋮ \(q\)-bilattices ⋮ Completeness and cut-elimination theorems for trilattice logics ⋮ Varieties of interlaced bilattices ⋮ Priestley duality for bilattices ⋮ The product representation theorem for interlaced pre-bilattices: some historical remarks. ⋮ Representation of interlaced trilattices ⋮ Bilattice Logics and Demi-Negation ⋮ A set-theoretical representation for weakly idempotent lattices and interlaced weakly idempotent bilattices ⋮ Bitopology and four-valued logic ⋮ Valuations: bi, tri, and tetra ⋮ Bilattices and hyperidentities ⋮ Preference Modeling by Rectangular Bilattices ⋮ The value of the four values ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A few more useful 8-valued logics for reasoning with tetralattice \(EIGHT_{4}\) ⋮ Distributive bilattices from the perspective of natural duality theory. ⋮ Introduction: Non-classical Logics—Between Semantics and Proof Theory (In Relation to Arnon Avron’s Work) ⋮ The Strict/Tolerant Idea and Bilattices ⋮ Fixpoint semantics for logic programming a survey ⋮ Some useful 16-valued logics: How a computer network should think
Cites Work
