相关论文: Stone and double Stone algebras: Boolean and Rough…
The first system of many-valued logic was introduced by J. Lukasiewicz, his motivation was of philosophical nature as he was looking for an interpretation of the concepts of possibility and necessity. Since then, plenty of research has been…
Moisil logic, having as algebraic counterpart \L ukasiewicz-Moisil algebras, provide an alternative way to reason about vague information based on the following principle: a many-valued event is characterized by a family of Boolean events.…
In this article we investigate the notion and basic properties of Boolean algebras and prove the Stone's representation theorem. The relations of Boolean algebras to logic and to set theory will be studied and, in particular, a neat proof…
Our main result is that any topological algebra based on a Boolean space is the extended Stone dual space of a certain associated Boolean algebra with additional operations. A particular case of this result is that the profinite completion…
From a logical point of view, Stone duality for Boolean algebras relates theories in classical propositional logic and their collections of models. The theories can be seen as presentations of Boolean algebras, and the collections of models…
Stone's representation theorem asserts a duality between Boolean algebras on the one hand and Stone space, which are compact, Hausdorff, and totally disconnected, on the other. This duality implies a natural isomorphism between the…
Double Boolean algebras (dBas), introduced by Wille, are based on twenty-three identities. We present a simplified axiom system, the D-core algebra, and prove it is equivalent to Wille's original definition. This reduction allows improved…
Stone-type duality theorems, which relate algebraic and relational/topological models, are important tools in logic because -- in addition to elegant abstraction -- they strengthen soundness and completeness to a categorical equivalence,…
We describe right-hand skew Boolean algebras in terms of a class of presheaves of sets over Boolean algebras called Boolean sets, and prove a duality theorem between Boolean sets and etale spaces over Boolean spaces.
We investigate computable metrizability of Polish spaces up to homeomorphism. In this paper we focus on Stone spaces. We use Stone duality to construct the first known example of a computable topological Polish space not homeomorphic to any…
We present algebraic semantics for the classical logic of proofs based on Boolean algebras. We also extend the language of the logic of proofs in order to have a Boolean structure on justification terms and equality predicate on terms. In…
A formal context consists of objects, properties, and the incidence relation between them. Various notions of concepts defined with respect to formal contexts and their associated algebraic structures have been studied extensively,…
Involutive Stone algebras (or {\bf S}--algebras) were introduced by R. Cignoli and M. Sagastume in connection to the theory of $n$-valued \L ukasiewicz--Moisil algebras. In this work we focus on the logic that preserves degrees of truth…
Rough Set Theory (RST), first introduced by Pawlak in 1982, is an approach for dealing with information systems where knowledge is uncertain or incomplete.\cite{Pawlak} It is of fundamental importance in many subfields of artificial…
We introduce the Boolean algebra of d-semialgebraic (more generally, d-definable) sets and prove that its Stone space is naturally isomorphic to the Ellis enveloping semigroup of the Stone space of the Boolean algebra of semialgebraic…
In this paper, we show that every quasiorder $R$ induces a Nelson algebra $\mathbb{RS}$ such that the underlying rough set lattice $RS$ is algebraic. We note that $\mathbb{RS}$ is a three-valued {\L}ukasiewicz algebra if and only if $R$ is…
A. Monteiro, in 1978, defined the algebras he named tetravalent modal algebras, will be called 4--valued modal algebras in this work. These algebras constitute a generalization of the 3--valued Lukasiewicz algebras defined by Moisil. The…
The classical Stone duality associates to each Boolean algebra a topological space consisting of ultrafilters. Lawson's generalisation constructs a dual equivalence of categories of Boolean inverse $\land$-semigroups and Hausdorff ample…
Stone-type dualities provide a powerful mathematical framework for studying properties of logical systems. They have recently been fruitfully explored in understanding minimisation of various types of automata. In Bezhanishvili et al.…
An involutive Stone algebra (IS-algebra) is a structure that is simultaneously a De Morgan algebra and a Stone algebra (i.e. a pseudo-complemented distributive lattice satisfying the well-known Stone identity ~xv~~x=1). IS-algebras have…