Cheng Hao
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 of completeness theorem in propositional logic will be given using Stone's theorem from Boolean algebra.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
Axiomatization of Boolean Connexive Logics with syncategorematic negation and modalities
本文研究三类扩展布尔相干逻辑，引入否定与去模态化封闭性质及公理模式，构建希尔伯特演算并证明可靠性、完全性和可判定性。
Boolean-valued second-order logic revisited
本文继续研究布尔值二阶逻辑与完全二阶逻辑的差异，证明前者紧致性数在真类Woodin基数下为ω₁（与完全二阶逻辑的最小可扩张基数不同），并引入内模型C²ᵇ，证明其为ZFC的最小内模型且具有良好性质。
We introduce a new variant of dependence logic called Boolean dependence logic. In Boolean dependence logic dependence atoms are of the type =(x_1,...,x_n,α), where αis a Boolean variable. Intuitively, with Boolean dependence atoms one can express quantification of relations, while standard dependence atoms express quantification over functions. We compare the expressive power of Boolean dependence logic to dependence logic and first-order logic enriched by partially-ordered connectives. We show that the expressive power of Boolean dependence logic and dependence logic coincide. We define natu…
Moisil in 1941, while constructing the algebraic models of n-valued Ł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 Ł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 …
A structural theorem for Kleene algebras is proved, showing that an element of a Kleene algebra can be looked upon as an ordered pair of sets. Further, we show that negation with the Kleene property (called the `Kleene negation') always arises from the set theoretic complement. The corresponding propositional logic is then studied through a 3-valued and rough set semantics. It is also established that Kleene negation can be considered as a modal operator, and enables giving a perp semantics to the logic. One concludes with the observation that all the semantics for this logic are equivalent.
Boolean valued semantics for infinitary logics
本文利用力迫法改进Mansfield的布尔值完备性定理，针对无穷逻辑L∞ω建立更强完备性，并证明Craig插值性质与强省略类型定理，同时揭示L∞ω与力迫法的联系。
The article is a study of two algebraic structures, the `contrapositionally complemented pseudo-Boolean algebra' (ccpBa) and `contrapositionally $\vee$ complemented pseudo-Boolean algebra' (c$\vee$cpBa). The algebras have recently been obtained from a topos-theoretic study of categories of rough sets. The salient feature of these algebras is that there are two negations, one intuitionistic and another minimal in nature, along with a condition connecting the two operators. We study properties of these algebras, give examples, and compare them with relevant existing algebras. `Intuitionistic Log…
On the Logical and Algebraic Aspects of Reasoning with Formal Contexts
本文研究形式背景下不同概念的表示与推理的逻辑与代数层面，提出两类模态逻辑分别处理粗糙与形式概念，统一为双类布尔模态逻辑并证明双布尔代数的刻画，探讨了系统扩展方向。
Cartagena Logic
本文引入一种基于布尔扩张的新型无穷逻辑——卡塔赫纳逻辑，证明其模型论性质，并表明它是Shelah无穷逻辑的一个具有清晰生成语法的良好近似。
We investigate classes of Boolean algebras related to the notion of forcing that adds Cohen reals. A >>Cohen algebra<< is a Boolean algebra that is dense in the completion of a free Boolean algebra. We introduce and study generalizations of Cohen algebras: semi-Cohen algebras, pseudo-Cohen algebras and potentially Cohen algebras. These classes of Boolean algebras are closed under completion.
The completeness and congruences of quasi-Boolean algebras
本文研究拟布尔代数的完备性与同余关系，刻画了有限不可约拟布尔代数，证明了标准完备性及同余扩张性质，并完整描述了同余的扩张方式。
The Boolean logic of subsets, usually presented as `propositional logic,' is considered as being "classical" while intuitionistic logic and the many sublogics and off-shoots are "non-classical." But there is another mathematical logic, the logic of partitions, that is at the same mathmatical level as Boolean subset logic since subsets and quotient sets (partitions or equivalence relations) are dual to one another in the category-theoretic sense. Our purpose here is to explore the notions of negation and implication in that other mathematical logic of partitions.
Moisil logic, having as algebraic counterpart Ł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. However, using the original definition of Łukasiewicz-Moisil algebra, the principle does not apply for subalgebras. In this paper we identify an alternative and equivalent definition for the $n$-valued Łukasiewicz-Moisil algebras, in which the determination principle is also saved for arbitrary subalgebras, which are characterized by a Boolean algebra and a fa…
We present a necessary and sufficient condition for a Boolean algebra to carry a finitely additive measure.
We show in ZFC, that the depth of ultraproducts of Boolean Algebras may be bigger than the ultraproduct of the depth of those Boolean Algebras.
Extending recent investigations on the structure of Tukey types of ultrafilters on $\mathcal{P}(ω)$ to Boolean algebras in general, we classify the spectra of Tukey types of ultrafilters for several classes of Boolean algebras, including interval algebras, tree algebras, and pseudo-tree algebras.
For any first order theory T we construct a Boolean valued model M, in which precisely the T--provable formulas hold, and in which every (Boolean valued) subset which is invariant under all automorphisms of M is definable by a first order formula. Our presentation is entirely selfcontained, and only requires familiarity with the most elementary properties of model theory.
Algebraic Semantics for the Logic of Proofs
该研究基于布尔代数构建经典证明逻辑的代数语义，扩展证明逻辑语言以赋予证成项布尔结构与项相等谓词，最终得到相关代数的完备性定理与斯通表示定理的推广。
It is shown that all the countable superatomic boolean algebras of finite rank have the small index property.
This article is devoted to two different generalizations of projective Boolean algebras: openly generated Boolean algebras and tightly sigma-filtered Boolean algebras. We show that for every uncountable regular cardinal kappa there are 2^kappa pairwise non-isomorphic openly generated Boolean algebras of size kappa > aleph_1 provided there is an almost free non-free abelian group of size kappa. The openly generated Boolean algebras constructed here are almost free. Moreover, for every infinite regular cardinal kappa we construct 2^kappa pairwise non-isomorphic Boolean algebras of size kappa tha…
For every regular cardinal kappa there exists a simple complete Boolean algebra with kappa generators.
A Boolean algebra carries a strictly positive exhaustive submeasure if and only if it has a sequential topology that is uniformly Frechet.
How many endomorphisms does a Boolean algebra have? Can we find Boolean algebras with as few endomorphisms as possible? Of course from any ultrafilter of the Boolean algebra we can define an endomorphism, and we can combine finitely many such endomorphisms in some reasonable ways. We prove that in any cardinality lambda=lambda^ {aleph_0} there is a Boolean algebra with no other endomorphisms. For this we use the so called "black boxes", but in a self contained way. We comment on how necessary the restriction on the cardinal is.
It is unprovable that every complete subalgebra of a countably closed complete Boolean algebra is countably closed.
It is consistent that every weakly distributive complete ccc Boolean algebra carries a strictly positive Maharam submeasure.
There exists a complete atomless Boolean algebra that has no proper atomless complete subalgebra.
We study various forms of amalgamation for Boolean algebras with operations. We will also have the occasion to weaken the Boolean structure dealing with MV and BL algebras with operators.
We consider homogeneity properties of Boolean algebras that have nonprincipal ultrafilters which are countably generated.It is shown that a Boolean algebra B is homogeneous if it is the union of countably generated nonprincipal ultrafilters and has a dense subset D such that for every a in D the relative algebra B restriction a:= {b in B:b <= a} is isomorphic to B. In particular, the free product of countably many copies of an atomic Boolean algebra is homogeneous. Moreover, a Boolean algebra B is homogeneous if it satisfies the following conditions: (i) B has a countably generated ultrafilter…
For each regular cardinal k > w we show the consistent existence of a thin very tall superatomic Boolean algebra of width k.
Assuming GCH, we construct an atomic boolean algebra whose pi-weight is strictly less than the least size of a maximal irredundant family.
We give a simplified proof of a theorem of M. Rabus and S. Shelah claiming that for each cardinal mu there is a c.c.c Boolean algebra with topological density mu.
We give a definition of some classes of boolean algebras generalizing free boolean algebras; they satisfy a universal property that certain functions extend to homomorphisms. We give a combinatorial property of generating sets of these algebras, which we call n -independent. The properties of these classes (n-free and omega-free boolean algebras) are investigated. These include connections to hypergraph theory and cardinal invariants on these algebras. Related cardinal functions, n Ind, which is the supremum of the cardinalities of n-independent subsets; i_n, the minimum size of a maximal n -i…
In this paper we classify some special reducts of the countable atomless Boolean algebra which we call functional reducts. We prove that there are exactly $13$ such structures up to first order interdefinability.
The present status of the problems in my book "Cardinal Invariants on Boolean algebras" (Birkhauser 1996) is described, with a description of solutions or partial solutions, and references.
Simple and sub-directly irreducible double Boolean algebras
本文研究双布尔代数，证明纯且平凡等价于两个布尔代数的粘合和，刻画简单双布尔代数，并分类某些子类中的子直不可约代数。
Skew Boolean algebras (skew BA) and Boolean-like algebras (nBA) are one-pointed and n-pointed noncommutative generalisation of Boolean algebras, respectively. We show that any nBA is a cluster of n isomorphic right-handed skew BAs, axiomatised here as the variety of skew star algebras. The variety of skew star algebras is shown to be term equivalent to the variety of nBAs. We use skew BAs in order to develop a general theory of multideals for nBAs. We also provide a representation theorem for right-handed skew BAs in terms of nBAs of n-partitions.
We prove that for any superatomic Boolean Algebra of cardinality >beth_omega there is an automorphism moving uncountably many atoms. Similarly for larger cardinals. Any of those results are essentially best possible.
Minimal Axiomatization of Boolean Algebras
本文提出布尔代数的极小公理化新公理系统，揭示对称差与模差的代数相似性，并给出布尔代数中等价关系证明的新方法。
We propose a graph-based extension of Boolean logic called Boolean Graph Logic (BGL). Construing formula trees as the cotrees of cographs, we may state semantic notions such as evaluation and entailment in purely graph-theoretic terms, whence we recover the definition of BGL. Naturally, it is conservative over usual Boolean logic. Our contributions are the following: (1) We give a natural semantics of BGL based on Boolean relations, i.e. it is a multivalued semantics, and show adequacy of this semantics for the corresponding notions of entailment. (2) We show that the complexity of evaluation …
This paper presents an investigation on the structure of conditional events and on the probability measures which arise naturally in this context. In particular we introduce a construction which defines a (finite) {\em Boolean algebra of conditionals} from any (finite) Boolean algebra of events. By doing so we distinguish the properties of conditional events which depend on probability and those which are intrinsic to the logico-algebraic structure of conditionals. Our main result provides a way to regard standard two-place conditional probabilities as one-place probability functions on condit…
This work contributes to the domains of Boolean algebra and of Bayesian probability, by proposing an algebraic extension of Boolean algebras, which implements an operator for the Bayesian conditional inference and is closed under this operator. It is known since the work of Lewis (Lewis' triviality) that it is not possible to construct such conditional operator within the space of events. Nevertheless, this work proposes an answer which complements Lewis' triviality, by the construction of a conditional operator outside the space of events, thus resulting in an algebraic extension. In particul…
We consider a 2-valued non-deterministic connective $\wedge \hskip-5.5pt \vee$ defined by the table resulting from the entry-wise union of the tables of conjunction and disjunction. Being half conjunction and half disjunction we named it platypus. The value of $\wedge \hskip-5.5pt \vee$ is not completely determined by the input, contrasting with usual notion of Boolean connective. We call non-deterministic Boolean connective any connective based on multi-functions over the Boolean set. In this way, non-determinism allows for an extended notion of truth-functional connective. Unexpectedly, this…
Constructing a fuzzy subset logic L with Boolean properties is notoriously difficult because under a handful of "reasonable" conditions, we have the following three debilitating constraints: (1) Bellman and Giertz in 1973 showed that if L is distributive, then it must be idempotent. (2) Dubois and Padre in 1980 showed that if L has the excluded middle or the non-contradiction property or both, then it must be non-idempotent. (3) Bellman and Giertz also demonstrated in 1973 that even if L is idempotent, then the only choice available for the (meet,join) logic operator pair is the (min,max) oper…
We introduce quantum Boolean algebras which are the analogue of the Weyl algebras for Boolean affine spaces. We study quantum Boolean algebras from the logical and set theoretical viewpoints.
This paper illustrates the relationship between boolean propositional algebra and semirings, presenting some results of partial ordering on boolean propositional algebras, and the necessary conditions to represent a boolean propositional subalgebra as equivalent to a corresponding boolean propositional algebra. It is also shown that the images of a homomorphic function on a boolean propositional algebra have the relationship of boolean propositional algebra and its subalgebra. The necessary and sufficient conditions for that homomorphic function to be onto-order preserving, and also an extensi…
We characterise piecewise Boolean domains, that is, those domains that arise as Boolean subalgebras of a piecewise Boolean algebra. This leads to equivalent descriptions of the category of piecewise Boolean algebras: either as piecewise Boolean domains equipped with an orientation, or as full structure sheaves on piecewise Boolean domains.
We define Boolean algebras in the linear context and study its symmetric powers. We give explicit formulae for products in symmetric Boolean algebras of various dimensions. We formulate symmetric forms of the inclusion-exclusion principle.
Gaisi Takeuti introduced Boolean valued analysis around 1974 to provide systematic applications of Boolean valued models of set theory to analysis. Later, his methods were further developed by his followers, leading to solving several open problems in analysis and algebra. Using the methods of Boolean valued analysis, he further stepped forward to construct set theory based on quantum logic, as the first step to construct "quantum mathematics", a mathematics based on quantum logic. While it is known that the distributive law does not apply to quantum logic, and the equality axiom turns out not…
Boolean basis, formula size, and number of modal operators
该研究对比不同布尔基下模态逻辑公式的简洁性，证明模态逻辑T/K中消去双蕴含会导致◇算子数与公式规模指数增长，且完备布尔算子集简洁性分两类，而S5与命题逻辑一致无显著差异。
Rings and Boolean Algebras as Algebraic Theories
本文提出通过仿射和超仿射代数理论统一表示交换环和布尔环，并探讨了其与布尔集合及多维布尔代数的关系。
We answer three problems by J. D. Monk on cardinal invariants of Boolean algebras. Two of these are whether taking the algebraic density pi(A), resp. the topological density d(A), of a Boolean algebra A commutes with formation of ultraproducts; the third one compares the number of endomorphisms and of ideals of a Boolean algebra.
We prove that there is a lattice embedded from every countable distributive lattice into the Boolean algebra of computable subsets of $\mathbb{N}$. Along the way, we discuss all relevant results about lattices, Boolean algebras and embeddings between them.
We prove the consistency with ZFC of ``the length of an ultraproduct of Boolean algebras is smaller than the ultraproduct of the lengths''. Similarly for some other cardinal invariants of Boolean algebras.
For every uncountable cardinal mu there is a ccc Boolean algebra whose topological density is mu .
It is well-known that a Hilbert-style deduction system for first-order classical logic is sound and complete for a model theory built using all Boolean algebras as truth-value algebras if and only if it is sound and complete for a model theory utilizing only irreducible Boolean algebras (which are all isomorphic to the two-element Boolean algebra). In this paper, we prove an analogous result for any first-order logic with an algebraic semantics satisfying certain minimal assumptions, and we then apply our result to first-order quantum logic.
We investigate the possibility of extending the non-functionally complete logic of a collection of Boolean connectives by the addition of further Boolean connectives that make the resulting set of connectives functionally complete. More precisely, we will be interested in checking whether an axiomatization for Classical Propositional Logic may be produced by merging Hilbert-style calculi for two disjoint incomplete fragments of it. We will prove that the answer to that problem is a negative one, unless one of the components includes only top-like connectives.
We deal with some of problems posed by Monk and related to cardinal invariant of ultraproducts of Boolean algebras. We also introduce and investigate some new cardinal invariants.
Christine Tasson introduced an algebraic notion of totality for a denotational model of linear logic in the category of vector spaces. The notion of total boolean function is, in a way, quite intuitive. This note provides a positive answer to the question of completeness of the "boolean centroidal calculus" w.r.t. total boolean functions.
We present a correlated \textit{and} gate which may be used to propagate uncertainty and dependence through Boolean functions, since any Boolean function may be expressed as a combination of \textit{and} and \textit{not} operations. We argue that the \textit{and} gate is a bivariate copula family, which has the interpretation of constructing bivariate Bernoulli random variables following a given Pearson correlation coefficient and marginal probabilities. We show how this copula family may be used to propagate uncertainty in the form of probabilities of events, probability intervals, and probab…
We present a substructural epistemic logic, based on Boolean BI, in which the epistemic modalities are parametrized on agents' local resources. The new modalities can be seen as generalizations of the usual epistemic modalities. The logic combines Boolean BI's resource semantics --- we introduce BI and its resource semantics at some length --- with epistemic agency. We illustrate the use of the logic in systems modelling by discussing some examples about access control, including semaphores, using resource tokens. We also give a labelled tableaux calculus and establish soundness and completene…
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。