Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
133 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Stone and double Stone algebras: Boolean and Rough Set Representations, 3-valued and 4-valued Logics (1710.02393v1)

Published 5 Oct 2017 in math.LO

Abstract: Moisil in 1941, while constructing the algebraic models of n-valued {\L}ukasiewicz logic defined the set $B{[n]}$,where $B$ is a Boolean algebra and `n' being a natural number. Further it was proved by Moisil himself the representations of n-valued {\L}ukasiewicz Moisil algebra in terms of $B{[n]}$. In this article, structural representation results for Stone, dual Stone and double Stone algebras are proved similar to Moisil's work by showing that elements of these algebras can be looked upon as monotone ordered tuple of sets. 3-valued semantics of logic for Stone algebra, dual Stone algebras and 4-valued semantics of logic for double Stone algebras are proposed and established soundness and completeness results.

Summary

We haven't generated a summary for this paper yet.