Displaying similar documents to “Polyabelian loops and Boolean completeness”

Stability of the 4-2 Binary Addition Circuit Cells. Part I

Katsumi Wasaki (2008)

Formalized Mathematics

Similarity:

To evaluate our formal verification method on a real-size calculation circuit, in this article, we continue to formalize the concept of the 4-2 Binary Addition Cell primitives (FTAs) to define the structures of calculation units for a very fast multiplication algorithm for VLSI implementation [11]. We define the circuit structure of four-types FTAs, TYPE-0 to TYPE-3, using the series constructions of the Generalized Full Adder Circuits (GFAs) that generalized adder to have for each positive...

The sequential topology on complete Boolean algebras

Wiesław Główczyński, Bohuslav Balcar, Thomas Jech (1998)

Fundamenta Mathematicae

Similarity:

We investigate the sequential topology τ s on a complete Boolean algebra B determined by algebraically convergent sequences in B. We show the role of weak distributivity of B in separation axioms for the sequential topology. The main result is that a necessary and sufficient condition for B to carry a strictly positive Maharam submeasure is that B is ccc and that the space ( B , τ s ) is Hausdorff. We also characterize sequential cardinals.

On Haar null sets

Sławomir Solecki (1996)

Fundamenta Mathematicae

Similarity:

We prove that in Polish, abelian, non-locally-compact groups the family of Haar null sets of Christensen does not fulfil the countable chain condition, that is, there exists an uncountable family of pairwise disjoint universally measurable sets which are not Haar null. (Dougherty, answering an old question of Christensen, showed earlier that this was the case for some Polish, abelian, non-locally-compact groups.) Thus we obtain the following characterization of locally compact, abelian...

Connected covers and Neisendorfer's localization theorem

C. McGibbon, J. Møller (1997)

Fundamenta Mathematicae

Similarity:

Our point of departure is J. Neisendorfer's localization theorem which reveals a subtle connection between some simply connected finite complexes and their connected covers. We show that even though the connected covers do not forget that they came from a finite complex their homotopy-theoretic properties are drastically different from those of finite complexes. For instance, connected covers of finite complexes may have uncountable genus or nontrivial SNT sets, their Lusternik-Schnirelmann...

Reverse mathematics of some topics from algorithmic graph theory

Peter Clote, Jeffry Hirst (1998)

Fundamenta Mathematicae

Similarity:

This paper analyzes the proof-theoretic strength of an infinite version of several theorems from algorithmic graph theory. In particular, theorems on reachability matrices, shortest path matrices, topological sorting, and minimal spanning trees are considered.