نتایج جستجو برای: heyting algebra

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

Journal: :Reports on Mathematical Logic 2007
Katarzyna Slomczynska

. 1 Preliminaries Consider the variety Eω generated by the algebra ω := (N, ·), where i · j := max (i, j) for i 6= j, and i · j := 1 for i = j, i, j ∈ N1. These variety is a subvariety of the variety of equivalential algebras E . By an equivalential algebra we mean a grupoid A = (A,↔) that is a subreduct of a Brouwerian semilattice (or, equivalently, a Heyting algebra) with the operation ↔ give...

Journal: :J. Symb. Log. 2012
R. Elageili J. K. Truss

In this paper we describe the well-founded initial segment of the free Heyting algebra Aα on finitely many, α, generators. We give a complete classification of initial sublattices of A2 isomorphic to A1 (called ‘low ladders’), and prove that for 2 ≤ α < ω, the height of the wellfounded initial segment of Aα is ω.

2004
Silvio Valentini

Looking for a complete formalization of constructive topology we analyzed the structure of the subsets of a Heyting algebra which correspond to the concrete closed and open sets of a topological space over its formal points. After this has been done, the rules for a formalization of constructive topology, which is both predicative and complete, are unveiled.

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: :iranian journal of fuzzy systems 2012
wenchao wu jinming fang

based on a complete heyting algebra, we modify the definition oflattice-valued fuzzifying convergence space using fuzzy inclusionorder and construct in this way a cartesian-closed category, calledthe category of $l-$ordered fuzzifying convergence spaces, in whichthe category of $l-$fuzzifying topological spaces can be embedded.in addition, two new categories are introduced, which are called the...

Journal: :Studia Logica 2018
Juan Manuel Cornejo Ignacio Darío Viglizzo

There is a well known interplay between the study of algebraic varieties and propositional calculus of various logics. Prime examples of this are boolean algebras and classical logic, and Heyting algebras and intuitionistic logic. After the class of Heyting algebras was generalized to the semi-Heyting algebras by H. Sankappanavar in [San08], its logic counterpart was developed by one of us in [...

2017
HANAMANTAGOUDA P. SANKAPPANAVAR

The variety DQD of semi-Heyting algebras with a weak negation, called dually quasi-De Morgan operation, and several of its subvarieties were investigated in the series [31], [32], [33], and [34]. In this paper we define and investigate a new subvariety JID of DQD, called “JI-distributive, dually quasi-De Morgan semi-Heyting algebras”, defined by the identity: x ∨ (y → z) ≈ (x ∨ y) → (x ∨ z), as...

Journal: :Synthese 2012
Chris Heunen Nicolaas P. Landsman Bas Spitters

Following Birkhoff and von Neumann, quantum logic has traditionally been based on the lattice of closed linear subspaces of some Hilbert space, or, more generally, on the lattice of projections in a von Neumann algebra A. Unfortunately, the logical interpretation of these lattices is impaired by their nondistributivity and by various other problems. We show that a possible resolution of these d...

Journal: :Foundations of Physics 2021

The daseinisation is a mapping from an orthomodular lattice in ordinary quantum theory into Heyting algebra topos theory. While distributivity does not always hold lattices, it algebras. We investigate the conditions under which negations and meets are preserved by daseinisation, condition that any element transformed through corresponds to original lattice. show these equivalent, that, only ca...

Journal: :Information Sciences 2023

This paper aims to contribute the extension of classical Formal Concept Analysis (FCA), allowing management unknown information. In a preliminary paper, we define new kind attribute implications represent knowledge from information currently available. The whole FCA framework has be appropriately extended manage introduces logic for reasoning with this implications, which belongs family logics ...

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

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