Hybrid Duality

A monadic (Boolean) algebra is a Boolean algebra A together with an operator 3 on A (called an existential quantifier, or, simply, a quantifier) such that 30=0, pfk 3p, and 3(^A 3q) = 3p* 3g whenever p and q are in A. Most of this note uses nothing more profound about monadic algebras than the definition. The reader interested in the motivation for and the basic facts in the theory of monadic algebras may, however, wish to consult [2]. Every Boolean algebra can be converted into a monadic algebra, usually in several ways. (One way is to write 3p = p for all p; another is to write Bp =0 or 1 according p =0 or py^O. These special operators are known the discrete and the simple quantifier, respectively.) It follows, a fortiori, that every Boolean algebra can be embedded into a monadic algebra, and it is clear, on grounds of universal algebra, that among the monadic extensions of a Boolean algebra there is one that is as free possible. To be more precise, let us say that a monadic algebra A is a free monadic extension of a Boolean algebra B if (i) B is a Boolean subalgebra of A, (ii) A is (monadically) generated by B, (iii) every Boolean homomorphism g that maps B into an arbitrary monadic algebra C has a (necessarily unique) extension to a monadic homomorphism f that maps A into C. The statement that a monadic extension as free possible always exists means that every Boolean algebra B has a free monadic extension A; the algebra A is uniquely determined to within a monadic isomorphism that is equal to the identity on B. The purpose of what follows is to give a constructive proof of this fact, i.e., a proof that exhibits A by means of certain set-theoretic constructions based on B (instead of a structurally not very informative proof via equivalence classes of strings of symbols). A by-product of the proof is a rather satisfying insight into the structure of the (Stone) dual space of the free monadic extension. The theorem can (and will) be formulated in such a way to subsume the results of Hyman Bass [l ] on the cardinal number of finitely generated free monadic algebras. The idea of the construction is this. Step 1: form a free Boolean algebra generated by a copy of B. Step 2: adjoin the elements of that

It is well known that the laws of logic governing the sentence connectives—“and”, “or”, “not”, etc.—can be expressed by means of equations in the theory of Boolean algebras. The task of providing a similar algebraic setting for the full first-order predicate logic is the primary concern of algebraic logicians. The best-known efforts in this direction are the polyadic algebras of Halmos (cf. [2]) and the cylindric algebras of Tarski (cf. [3]), both of which may be described as Boolean algebras with infinitely many additional operations. In particular, there is a primitive operator, cκ, corresponding to each quantification, ∃υκ. In this paper we explore a version of algebraic logic conceived by A. H. Copeland, Sr., and described in [1], which has this advantage: All operators are generated from a finite set of primitive operations.Following the theory of cylindric algebras, we introduce, in the natural way, the classes of Copeland set algebras (SCpA), representable Copeland algebras (RCpA), and Copeland algebras of formulas. Playing a central role in the discussion is the set, Γ, of all equations holding in every set algebra. The reason for this is that the operations in a set algebra reflect the notion of satisfaction of a formula in a model, and hence an equation expresses the fact that two formulas are satisfied by the same sequences of objects in the model. Thus to say that an equation holds in every set algebra is to assert that a certain pair of formulas are logically equivalent.

The notion of a Boolean algebra with operators (BAO) was first defined by Jonsson and Tarski in 1951. Since that time, many varieties of BAOs, including modal algebras, closure algebras, monadic algebras, and of course relation algebras, have been studied. With the exception of relation algebras, these varieties each have one unary operator. This paper investigates a variety of BAOs with one binary operator. Begin with a semigroup S = $(S,\cdot).$ The complex algebra of S, denoted S$\sp+,$ is a Boolean algebra whose underlying set is the power set of S with set union, intersection and complementation as the Boolean algebra operations. The multiplication operation defined on the semigroup induces a normal, associative binary operation, '*', on the complex algebra as follows: for all subsets A and B contained in S, $A\* B=\{a\cdot b:a\in A, b\in B\}.$ Hence, the complex algebra of a semigroup is a BAO with one normal binary associative operator. Let S$\sp+$ be the class of all complex algebras of semigroups and consider the variety generated by the class S$\sp+,$ denoted ${\cal V}$(S$\sp+).$ The tools required to study this variety are developed, including the duality between BAOs and relational structures as it applies to ${\cal V}$(S$\sp+).$ A closure operator is defined which is used to determine homomorphic images of members of ${\cal V}$(S$\sp+).$ Theorems on the subdirectly irreducible and simples algebras in ${\cal V}$(S$\sp+)$ are proved. Next, the structure of ${\cal V}$(S$\sp+)$ is analyzed. The general problem of representing a BAO with one binary, normal, associative operator as a member of ${\cal V}$(S$\sp+)$ is discussed. Several examples and theorems concerning representation are presented. It is shown that the quasivariety generated by S$\sp+$ is strictly contained in ${\cal V}$(S$\sp+).$ Lastly, the structure of the lattice of subvarieties of ${\cal V}$(S$\sp+)$ is investigated. There are precisely two atoms in this lattice; each atom is generated by a two element algebra. Two infinite chains of varieties exist, with the smallest element in each chain a cover of exactly one atom. This leads to a discussion of certain splitting algebras and conjugate varieties. Finally, equations characterizing some important subvarieties are developed.

We deal with problems associated with Scott ranks of Boolean algebras. The Scott rank can be treated as some measure of complexity of an algebraic system. Our aim is to propound and justify the procedure which, given any countable Boolean algebra, will allow us to construct a Boolean algebra of a small Scott rank that has the same natural algebraic complexity as has the initial algebra. In particular, we show that the Scott rank does not always serve as a good measure of complexity for the class of Boolean algebras. We also study into the question as to whether or not a Boolean algebra of a big Scott rank can be decomposed into direct summands with intermediate ranks. Examples are furnished in which Boolean algebras have an arbitrarily big Scott rank such that direct summands in them either have a same rank or a fixed small one, and summands of intermediate ranks are altogether missing. This series of examples indicates, in particular, that there may be no nontrivial mutual evaluations for the Scott and Frechet ranks on a class of countable Boolean algebras.

Introduction.Boolean equalities occur naturally in Logic and especially in the theory of polyadic algebras.For instance, they have been used in [2] under the name of Champ Logique.The purpose of this paper is to develop a duality theory for Boolean equalities and by doing so establish a representation theory for them.0. Notation.The basic notation for Boolean algebras is the standard one (for instance, see [l]).Throughout this paper, the letter O will denote the two-element Boolean algebra; whenever a topology is assumed to be defined on 0, then this topology is the discrete one.If 73 is a Boolean algebra, then a valuation of B is a homomorphism from 73 onto 0. We make precise the terminology we shall be using in connection with the Stone duality theory for Boolean algebras.A Boolean space is a compact Hausdorff space whose topology is generated by the clopen sets.If X is a Boolean space, then the dual algebra of X is the Boolean algebra of clopen sets of X.If 73 is a Boolean algebra, then the dual space of 73 is the Boolean space X of all valuations of 73 (the topology on X is the topology generated by all sets of the form {v: vp = 1} where p belongs to B).

Boolean contact algebras constitute a suitable algebraic theory for qualitative spatial reasoning. They are Boolean algebras with an additional contact relation grasping the topological aspect of spatial entities. In this paper we present a logic that combines propositional logic, relevance logic, and modal logic to reason about Boolean contact algebras. This is done in two steps. First, we use the relevance logic operators to obtain a logic suitable for Boolean algebras. Then we add modal operators that are based on the contact relation. In both cases we present axioms that are equivalent to requirement that every frame for the logic is indeed a Boolean algebra resp. Boolean contact algebra. We also provide a natural deduction system for this logic by defining introduction and eliminations rules for each logical operator. The system is shown to be sound. Furthermore, we sketch an implementation of the natural deduction system in the functional programming language and interactive theorem prover Coq.

Complexity of Boolean algebras

ON THE CONNECTION OF CYLINDRICAL HOMOMORPHISMS AND POINT FUNCTIONS FOR Crsα 's.

The following is a classical result:Theorem 1.1. A complete atomic Boolean algebra is isomorphic to a power set algebra [2, p. 70].One of the consequences of [3] is: If M is a countable standard model of ZF and is a countable (in M) model of a complete ℵ0-categorical theory T, then there is a countable standard model N of ZF and a Λ ∈ N such that the Boolean algebra of definable (in T with parameters from ) subsets of is isomorphic to the power set algebra of Λ in N. In particular if and T the theory of equality with additional axioms asserting the existence of at least n distinct elements for each n < ω, then there is an N and Λ ∈ N with 〈PN(Λ), ⊆〉 isomorphic to the countable, atomic, incomplete Boolean algebra of the finite and cofinite subsets of ω.From the above we see that some incomplete Boolean algebras can be realized as power sets in standard models of ZF.Definition 1.1. A countable Boolean algebra 〈B, ≤〉 is a pseudo-power set if there is a countable standard model of ZF, N and a set Λ ∈ N such thatIt is clear that a pseudo-power set is atomic.

We extend the theory of profinite algebras, as it is used in the algebraic theory of regular languages, to the more general setting of Stone topological algebras with the ultimate goal of going beyond classes of regular languages. We introduce Stone pseudovarieties, that is, classes of Stone topological algebras of a fixed topological signature that are closed under taking Stone quotients, closed subalgebras and finite direct products. Looking at the dual Stone spaces of Boolean algebras of subsets of a given topological algebra, we find a simple characterization of when the dual space admits a natural structure of topological algebra; the characterization is given in terms of how the Boolean algebra behaves under the inverses of the operation evaluation mappings of each arity. This provides an alternative, which is presented in the form of an equivalence of categories, to the duality theory of M. Gehrke. As an application, a Stone quotient of a Stone topological algebra that is residually in a given Stone pseudovariety is shown to be also residually in it, thereby extending the corresponding result of M. Gehrke for the Stone pseudovariety of all finite algebras over discrete signatures, which was recently extended to topological signatures jointly by the authors and H. Goulet-Ouellet. The residual closure of a Stone pseudovariety is thus a Stone pseudovariety, and these are precisely the Stone analogues of varieties. A Birkhoff type theorem for Stone varieties is also established and it is shown how Reiterman’s theorem can be derived from it.

The theory of Boolean contact algebras has been used to represent a region based theory of space. Some of the primitives of Boolean algebras are not well motivated in that context. One possible generalization is to drop the notion of complement, thereby weakening the algebraic structure from Boolean algebra to distributive lattice. The main goal of this paper is to investigate the representation theory of that weaker notion, i.e., whether it is still possible to represent each abstract algebra by a substructure of the regular closed sets of a suitable topological space with the standard Whiteheadean contact relation.

For any Boolean space X and a discrete almost distributive lattice D, it is proved that the set C(X, D) of all continuous mappings of X into D, when D is equipped with the discrete topology, is an almost Boolean algebra under pointwise operations. Conversely, it is proved that any almost Boolean algebra is a homomorphic image of C(X,D) for a suitable Boolean space X and a discrete almost distributive lattice D.

The research aims to analyze geodetic methods for determining the location of natural reserve areas and standardizing the obtained data. The object of the research is the standardization of geodetic data for determining the boundaries of natural reserve areas. Normative and legal documents related to the classification and determination of territories of natural reserve areas and the main geodetic methods used to determine the boundaries of such areas were analyzed in the article. The structure and description of the main geodetic methods for the practical implementation of work to determine the location of natural reserve areas, including geodetic measurements, global navigation, and remote sensing methods, were also discussed. In addition, a number of discrepancies were identified in the process of obtaining, storing, and reproducing geodetic data. Overall, the article contains important information about methods for determining the boundaries of natural reserve areas and how mathematical methods can be used to standardize geodetic data by formalizing it. The research showed that formalization of geodetic data can be done using mathematical methods such as mathematical logic, Boolean algebra, and category theory. The article proposes the use of mathematical methods of data formalization, such as mathematical logic, Boolean algebra, and category theory, to structure and standardize geodetic data. Analytical and graphical models for standardizing geodetic data for determining the boundaries of natural reserve areas were developed using mathematical methods of formalization such as mathematical logic, Boolean algebra, and category theory.

Let π : Y → X \pi : Y\rightarrow X be a continuous surjection between compact Hausdorff spaces Y Y and X X which is irreducible in the sense that if F ⊊ Y F\subsetneq Y is closed, then π ( F ) ≠ X \pi (F)\neq X . We exhibit isomorphisms between various Boolean algebras associated to this data: the regular open sets of X X , the regular open sets of Y Y , the regular ideals of C ( X ) C(X) and the regular ideals of C ( Y ) C(Y) . We call X X and Y Y Boolean equivalent if the regular open sets of X X and the regular open sets of Y Y are isomorphic Boolean algebras. We give a characterization of when two compact metrizable spaces are Boolean equivalent; this characterization may be viewed as a topological version of the characterization of standard Borel spaces.

The theory of discriminator algebras and varieties has been investigated extensively, and provides us with a wealth of information and techniques applicable to specific examples of such algebras and varieties. Here we give several such examples for Boolea