Finite Boolean Algebra Research Articles

Axiomatization of modal logic with counting

Abstract Modal logic with counting is obtained from basic modal logic by adding cardinality comparison formulas of the form $ \#\varphi \succsim \#\psi $, stating that the cardinality of successors satisfying $ \varphi $ is larger than or equal to the cardinality of successors satisfying $ \psi $. It is different from graded modal logic where basic modal logic is extended with formulas of the form $ \Diamond _{k}\varphi $ stating that there are at least $ k$-many different successors satisfying $ \varphi $. In this paper, we investigate the axiomatization of ML(#) with respect to different frame classes, such as image-finite frames and arbitrary frames. Drawing inspiration from existing works, we employ a similar proof strategy that uses the characterization of binary relations on finite Boolean algebras capable of representing generalized probability measures or finite (respectively arbitrary) cardinality measures. Our main result shows that any formula not provable in the Hilbert system can be refuted within a finite (respectively arbitrary) cardinality measure Kripke frame with a finite domain. We then transform this finite (respectively arbitrary) cardinality measure Kripke frame into a Kripke frame in the corresponding class, refuting the unprovable formula.

Logics of upsets of De Morgan lattices

AbstractWe study logics determined by matrices consisting of a De Morgan lattice with an upward closed set of designated values, such as the logic of non‐falsity preservation in a given finite Boolean algebra and Shramko's logic of non‐falsity preservation in the four‐element subdirectly irreducible De Morgan lattice. The key tool in the study of these logics is the lattice‐theoretic notion of an n‐filter. We study the logics of all (complete, consistent, and classical) n‐filters on De Morgan lattices, which are non‐adjunctive generalizations of the four‐valued logic of Belnap and Dunn (of the three‐valued logics of Priest and Kleene, and of classical logic). We then show how to find a finite Hilbert‐style axiomatization of any logic determined by a finite family of prime upsets of finite De Morgan lattices and a finite Gentzen‐style axiomatization of any logic determined by a finite family of filters on finite De Morgan lattices. As an application, we axiomatize Shramko's logic of anything but falsehood.

Finite Algebras for Solid Modeling using Julia’s Sparse Arrays

An early research in solid modeling led by Herbert Voelcker at the University of Rochester and later at Cornell suggested that every solid representation scheme corresponds to an algebra, where the elements of the algebra are solid representations constructed and edited using operations in the algebra. For example, every CSG representation describes an element in a finite Boolean algebra of closed regular sets, whereas every boundary representation describes an element of a vector space of 2-chains in an algebraic topological chain complex. In this paper, we elucidate the precise relationships (functors) between all algebras used for CSG and boundary representations of solids. Based on these properties, we show that many solid modeling operations, including boundary evaluation, reduce to straightforward algebraic operations or application of identified functors that are efficiently implemented using point membership tests and sparse matrix operations. To fully exploit the efficacy of the new algebraic approach to solid modeling, all algorithms are fully implemented in Julia, the modern language of choice for numerical and scientific computing. • New research direction in solid modeling. • Algebraic relationships between CSG and boundary representations of PL solids. • Arrangements are isomorphic to the finite Boolean algebra of regularized sets. • This algebra is isomorphic to a linear vector space of 3-chains. • Operations on CSG and b-reps reduce to composition of algebraic operations. operations.

The Structure of d.r.e. Degrees

AbstractThis dissertation is highly motivated by d.r.e. Nondensity Theorem, which is interesting in two perspectives. One is that it contrasts Sacks Density Theorem, and hence shows that the structures of r.e. degrees and d.r.e. degrees are different. The other is to investigate what other properties a maximal degree can have.In Chapter 1, we briefly review the backgrounds of Recursion Theory which motivate the topics of this dissertation.In Chapter 2, we introduce the notion of $(m,n)$ -cupping degree. It is closely related to the notion of maximal d.r.e. degree. In fact, a $(2,2)$ -cupping degree is maximal d.r.e. degree. We then prove that there exists an isolated $(2,\omega )$ -cupping degree by combining strategies for maximality and isolation with some efforts.Chapter 3 is part of a joint project with Steffen Lempp, Yiqun Liu, Keng Meng Ng, Cheng Peng, and Guohua Wu. In this chapter, we prove that any finite boolean algebra can be embedded into d.r.e. degrees as a final segment. We examine the proof of d.r.e. Nondensity Theorem and make developments to the technique to make it work for our theorem. The goal of the project is to see what lattice can be embedded into d.r.e. degrees as a final segment, as we observe that the technique has potential be developed further to produce other interesting results.Abstract prepared by Yong Liu.E-mail: liuyong0112@nju.edu.cn

Deciding Koopman's qualitative probability

In their recent paper in this journal, Delgrande, Renne and Sack study qualitative probability and discuss its role in Artificial Intelligence. Building on related work by de Finetti, Scott, Segerberg and others, the authors provide general axioms for qualitative probability. In this paper we investigate Koopman's conditional qualitative probability from the computational viewpoint. An important part of his work, published in the Annals of Mathematics in 1940-1941, deals with finite conjunctions K of statements of the form “the probability of a given h does not exceed the probability of b given k”, with a,b,h,k elements of a boolean algebra. Upon coding these elements by boolean formulas, we provide a decision procedure to check the consistency of any such K. As an immediate consequence, also inferences in Koopman's probability theory are shown to be computable. These problems of qualitative probability theory significantly generalize Boole's (typically quantitative) problem of estimating the possible probabilities of a new event given the probabilities of other events. Boole's classical problem today is known as the optimization version of the probabilistic satisfiability problem PSAT. In 1986 Nilsson published an influential paper on this subject in this journal. The scope of our results is much larger than that of PSAT, because Koopman's conjunctions K also formalize the key notion of independence. Some familiarity with boolean logic and finite boolean algebras is the only prerequisite for this paper.

CELLULAR AUTOMATA OVER ALGEBRAIC STRUCTURES

AbstractLet G be a group and A a set equipped with a collection of finitary operations. We study cellular automata $$\tau :{A^G} \to {A^G}$$ that preserve the operations AG of induced componentwise from the operations of A. We show τ that is an endomorphism of AG if and only if its local function is a homomorphism. When A is entropic (i.e. all finitary operations are homomorphisms), we establish that the set EndCA(G;A), consisting of all such endomorphic cellular automata, is isomorphic to the direct limit of Hom(AS, A), where S runs among all finite subsets of G. In particular, when A is an R-module, we show that EndCA(G;A) is isomorphic to the group algebra $${\rm{End}}(A)[G]$$ . Moreover, when A is a finite Boolean algebra, we establish that the number of endomorphic cellular automata over AG admitting a memory set S is precisely $${(k|S|)^k}$$ , where k is the number of atoms of A.

Solution of Boolean equations via atomic decomposition into independent switching equations

ABSTRACTThis paper considers the problem of solving a system of Boolean equations over a finite (atomic) Boolean algebra other than the two-valued one, referred to herein as a ‘big’ Boolean algebra. The paper suggests the replacement of this system of equations by a single Boolean equation, and then proposes a novel method for solving this equation by using its atomic decomposition into several independent switching equations. This method has many advantages including the efficient derivation of a complete compact listing of all particular solutions in a form similar to the recently developed permutative additive form, but obtained in a more direct fashion without using parameters. Many detailed examples are used to illustrate the proposed new method. The examples demonstrate how the consistency condition might force a collapse of the underlying Boolean algebra into a subalgebra, and also how to list a huge number of particular solutions in a very small space.

Digital Circuit Design Utilizing Equation Solving over ‘Big’ Boolean Algebras

A task frequently encountered in digital circuit design is the solution of a two-valued Boolean equation of the form h(X,Y,Z)=1, where h: B_2^(k+m+n)→ B_2 and X,Y, and Z are binary vectors of lengths k, m, and n, representing inputs, intermediary values, and outputs, respectively. The resultant of the suppression of the variables Y from this equation could be written in the form g(X,Z)=1 where g: B_2^(k+n)→ B_2. Typically, one needs to solve for Z in terms of X, and hence it is unavoidable to resort to ‘big’ Boolean algebras which are finite (atomic) Boolean algebras larger than the two-valued Boolean algebra. This is done by reinterpreting the aforementioned g(X,Z) as g(Z): B_(2^K)^n→ B_(2^K ), where B_(2^K ) is the free Boolean algebra FB(X_1,X_2…….X_k ), which has K= 2^k atoms, and 2^K elemnets. This paper describes how to unify many digital specifications into a single Boolean equation, suppress unwanted intermediary variables Y, and solve the equation g(Z)=1 for outputs Z (in terms of inputs X) in the absence of any information about Y. The paper uses a novel method for obtaining the parametric general solutions of the ‘big’ Boolean equation g(Z)=1. The parameters used do not belong to B_(2^K ) but they belong to the two-valued Boolean algebra B_2, also known as the switching algebra or propositional algebra. To achieve this, we have to use distinct independent parameters for each asserted atom in the Boole-Shannon expansion of g(Z). The concepts and methods introduced herein are demonsrated via several detailed examples, which cover the most prominent type among basic problems of digital circuit design.

Automated process planning for hybrid manufacturing

Hybrid manufacturing (HM) technologies combine additive and subtractive manufacturing (AM/SM) capabilities, leveraging AM’s strengths in fabricating complex geometries and SM’s precision and quality to produce finished parts. We present a systematic approach to automated computer-aided process planning (CAPP) for HM that can identify non-trivial, qualitatively distinct, and cost-optimal combinations of AM/SM modalities. A multimodal HM process plan is represented by a finite Boolean expression of AM and SM manufacturing primitives, such that the expression evaluates to an ‘as-manufactured’ artifact. We show that primitives that respect spatial constraints such as accessibility and collision avoidance may be constructed by solving inverse configuration space problems on the ‘as-designed’ artifact and manufacturing instruments. The primitives generate a finite Boolean algebra (FBA) that enumerates the entire search space for planning. The FBA’s canonical intersection terms (i.e., ‘atoms’) provide the complete domain decomposition to reframe manufacturability analysis and process planning into purely symbolic reasoning, once a subcollection of atoms is found to be interchangeable with the design target. We therefore show that geometric and spatial reasoning can be decoupled from logic and combinatorial search required to find process plans. The approach subsumes unimodal (all-AM or all-SM) process planning as special cases. We demonstrate the practical potency of our framework and its computational efficiency when applied to process planning of complex 3D parts with dramatically different AM and SM instruments.

Effect Algebras as Presheaves on Finite Boolean Algebras

For an effect algebra $A$, we examine the category of all morphisms from finite Boolean algebras into $A$. This category can be described as a category of elements of a presheaf $R(A)$ on the category of finite Boolean algebras. We prove that some properties (being an orthoalgebra, the Riesz decomposition property, being a Boolean algebra) of an effect algebra $A$ can be characterized by properties of the category of elements of the presheaf $R(A)$. We prove that the tensor product of of effect algebras arises as a left Kan extension of the free product of finite Boolean algebras along the inclusion functor. As a consequence, the tensor product of effect algebras can be expressed by means of the Day convolution of presheaves on finite Boolean algebras.

Tableau Systems for Deontic Action Logics Based on Finite Boolean Algebras, and Their Complexity

We introduce a family of tableau calculi for deontic action logics based on finite boolean algebras (or DAL for short), these logics provide deontic operators (e.g., obligation, permission, prohibition) which are applied to a finite number of actions (the vocabulary of the logic); furthermore, in these formalisms, actions can be combined by means of boolean operators, this provides an expressive algebra of actions. We define a tableau calculus for the basic logic and then we extend this calculus to cope with extant variations of this formalism; we prove the soundness and completeness of these proof systems. In addition, we investigate the computational complexity of the satisfiability problem for DAL and its extensions; we show this problem is NP-complete when the number of actions considered is fixed, and it is $${\Sigma^p_2}$$Σ2p-Hard (in Stockmeyer's polynomial hierarchy) when the number of actions is taken as an extra parameter. The tableau systems introduced here can be implemented in PSPACE, this seems reasonable taking into consideration the computational complexity of the logics.

The free product of M-fuzzifying matroids1

In this paper, motivated by the free product of crisp matroids, the free product of M-fuzzifying matroids is defined when M is a finite Boolean algebra and a number of fundamental properties of the operation are derived. Parallel to crisp matroids, the minors of M-fuzzifying matroids are described in terms of the M-fuzzifying truncation operator and its dual, the M-fuzzifying Higgs lift operator.

Conditional belief functions as lower envelopes of conditional probabilities in a finite setting

The aim is to provide a characterization of full conditional measures on a finite Boolean algebra, obtained as lower envelope of the extensions of a full conditional probability defined on another finite Boolean algebra. Such conditional measures are conditional belief functions defined by means of a generalized Bayesian conditioning rule relying on a linearly ordered class of belief functions. This notion of Bayesian conditioning for belief functions is compared with other well-known conditioning rules by looking for those conditional measures that can be seen as lower conditional probabilities.

Minors of M-fuzzifying matroids

In this paper, a new kind of subtraction of M-fuzzy natural numbers is introduced. Based on the subtraction, the notions of dual and minor for M-fuzzifying matroids are given when M is the unit interval [0, 1] or a finite Boolean algebra. Following the analogy with crisp matroids a number of relations among these notions are derived.

Dualizing clones into categories of topological spaces

In this paper, we study clones of dual operations in the category of topological spaces. Our investigation is motivated by the possibility to apply duality theory in order to obtain some information about clones in the classical sense. In this way, we deduce results about the centralizer clones of (not necessarily finite) Boolean algebras, C*-algebras and bounded distributive lattices. We examine their arity sequences, discuss the structure of the lattices given by their subclones, and take a closer look at their idempotent operations.

Boolean Automorphisms of a Hypercube Coincide with the Linear Isometries

Boolean homomorphisms of a hypercube, which correspond to the morphisms in the category of finite Boolean algebras, coincide with the linear isometries of the category of finite binary metric vector spaces.

Epimorphisms between Finite 4-Valued Modal Algebras

In this paper, we determine conditions for the existence of an epimorphism between two finite 4-valued modal algebras and state a method to obtain it. Furthermore, we obtain formulas which generalize those indicated by R. Sikorski for finite Boolean algebras [1] 08D0C9EA79F9BACE118C8200AA004BA90B02000000080000000E0000005F005200650066003300380037003200340036003100310038000000 , and by M. Abad and A. V. Figallo for finite 3-valued ukasiewicz algebras [2] 08D0C9EA79F9BACE118C8200AA004BA90B02000000080000000E0000005F005200650066003300380037003200340036003100320031000000 .

A Constructive Study About the Set of Intermediate Rings

Let R ⊂ S be an extension of integral domains, and let be the integral closure of R in S. This work's research is devoted to a deeper study of [R, S], the set of intermediate rings between R and S, especially when [R, S] satisfies the finite chain condition. We introduce the normal closure of R in S, the greatest element of the subset , as a main tool to establish three order isomorphism theorems concerning subsets of and . This study effectively enables us to derive several satisfactory results concerning the cardinality of [R, S]. We also investigate conditions under which [R, S] has catenarian behavior in the sense that all finite maximal chains of rings from R to S have the same length. Then, we characterize when ([R, S],., ∩) is a finite boolean algebra.

Characterization of binary polynomials of idempotent algebras

In this paper, we characterize the set of all binary algebraic (or polynomial) operations of an idempotent algebra that has at least one r-ary algebraic operation, (r ≥ 2), depending on every variable such that there is no an (r+2)-ary algebraic operation depending on at least (r+1) variables. We prove that this set forms a finite Boolean algebra, and then we characterize this Boolean algebra.

A strong log-concavity property for measures on Boolean algebras

We introduce the antipodal pairs property for probability measures on finite Boolean algebras and prove that conditional versions imply strong forms of log-concavity. We give several applications of this fact, including improvements of some results of Wagner, a new proof of a theorem of Liggett stating that ultra-log-concavity of sequences is preserved by convolutions, and some progress on a well-known log-concavity conjecture of J. Mason.