Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 90 for “"Boolean Algebra"”.

  1. Elements of Boolean Algebra Theory

    … this paper is to state a set of postulates for Boolean algebra and show the characteristic theorems derivable from them, and to unify in one paper the more important methods of representing Boolean algebra and show their equivalence.

    unt Repository record for Elements of Boolean Algebra Theory (opens in a new tab)

  2. Subposets of the boolean algebra

    Thesis (Ph. D.)--Michigan State University. Department of Mathematics, 1994

    msu Repository record for Subposets of the boolean algebra (opens in a new tab)

  3. The Structure of a Boolean Algebra

    … of this chapter is to develop a form of a "free" Boolean algebra with Σ as a base, by imposing the usual Boolean operations on the set Σ and thus generating new elements freely within explicitly prescribed restrictions.

    unt Repository record for The Structure of a Boolean Algebra (opens in a new tab)

  4. Boolean algebra: from digital circuits to deep learning applications

    … e leis, incluindo a simplificação de expressões booleanas. São discutidos conceitos como a soma de produtos, o produto de somas e a construção de mapas de Karnaugh, fundamentais na otimização de circuitos digitais. Em seguida, aborda-se a aplicação da álgebra de Boole no design de circuitos …

    aberta Repository record for Boolean algebra: from digital circuits to deep learning applications (opens in a new tab)

  5. Boolean-Valued Models of Set Theory When the Boolean Algebra Is a Proper Class in the Ground Model

    Made available in DSpace on 2014-12-11T18:23:48Z (GMT). No. of bitstreams: 1 7212333.pdf: 1635163 bytes, checksum: 788a4cd116ac0b9256dcde5f7153f601 (MD5) Previous issue date: 1971

    uiuc Repository record for Boolean-Valued Models of Set Theory When the Boolean Algebra Is a Proper Class in the Ground Model (opens in a new tab)

  6. On partitioning an arbitrarily given set of elements of a finite Boolean algebra into the minimum number of sets of compatible elements

    … being an explanation of the problem in terms of Boolean algebra. The second part restates the problem in terms of graph theory, showing that this problem is the same as the problem of finding the chromatic number of a given graph. The third part is an attempt to gain insight into a solution of …

    nps Repository record for On partitioning an arbitrarily given set of elements of a finite Boolean algebra into the minimum number of sets of compatible elements (opens in a new tab)

  7. A Modernized Version of the Stone Representation Theory

    In conclusion we can state that every abstract Boolean algebra may be represented as a Boolean algebra of subsets of a basic space, viz., the Boolean algebra of all cloven subsets of a zero-dimensional compact Hausdorff space.

    marquette Repository record for A Modernized Version of the Stone Representation Theory (opens in a new tab)

  8. Some Boolean representations of the propositional calculus

    Boolean algebra had long played a well known role in the development of mathematical logic, but even in the propositional calculus there are many problems still to be investigated. Among these is the question of the feasibility of identifying the statement calculus with a Boolean algebra other than …

    nps Repository record for Some Boolean representations of the propositional calculus (opens in a new tab)

  9. Some observations and results concerning submeasures on Boolean algebras

    We investigate submeasures on Boolean algebras in the context of Maharam's problem and its solution. We generalise results that were originally proved for measures, to cases where additivity is not present. We investigate Talagrand's construction of a pathological exhaustive submeasure, attempting …

    east-anglia Download PDF for Some observations and results concerning submeasures on Boolean algebras (opens in a new tab)

  10. Boolean Algebras of Projections on Banach Spaces

    The object of this thesis is the study of the Boolean algebras of projections on Banach spaces and their properties. Chapter one is devoted to the study of the integration theory needed in the other chapters. The main characteristic features of the theory of normed KOthe spaces are introduced …

    glasgow Download PDF for Boolean Algebras of Projections on Banach Spaces (opens in a new tab)

  11. Isomorphic Finite Boolean Algebras

    … and mathematician, was the first to develop the algebraic system which is known by his name, Boolean Algebra. It was introduced in his book The Laws of Thought as a systematic treatment of logic . Besides its applications in logic, Boolean Algebra has applications in the theory of probability and …

    marquette Repository record for Isomorphic Finite Boolean Algebras (opens in a new tab)

  12. Reducibility, Degree Spectra, and Lowness in Algebraic Structures

    … of familiar mathematical structures. We focus on algebraic structures, which are standard topics of discussion among model theorists. The structures examined here are fields, graphs, trees under a predecessor function, and Boolean algebras. For a computable field F, the splitting set SF of F is …

    cuny-grad Repository record for Reducibility, Degree Spectra, and Lowness in Algebraic Structures (opens in a new tab)

  13. Weakly Dense Subsets of Homogeneous Complete Boolean Algebras

    … in ZFC, where B is a homogeneous complete Boolean algebra, d(B) is the density, wd(B) is the weak density, and c(B) is the cellularity of B. Chapter II of this dissertation is a general overview of homogeneous complete Boolean algebras. Assuming the existence of a weakly inaccessible …

    unt Repository record for Weakly Dense Subsets of Homogeneous Complete Boolean Algebras (opens in a new tab)

  14. A computer tutorial and simulation system for teaching digital function minimization

    … resulting from learning minimization of Boolean algebra by computer tutorial/simulation program versus traditional lecture/practice instruction (manipulating actual components). Two groups of undergraduate students participated in this study and were randomly assigned to either the …

    iastate Repository record for A computer tutorial and simulation system for teaching digital function minimization (opens in a new tab)

  15. B(2): P(M) DUAL RADIX SYSTEMS - THEORY, DESIGN, AND I(SQUARE)L IMPLEMENTATION.

    The upward compatibility of binary Boolean algebra with Post algebra was examined. There exists in a Post algebra, P(m), a single two-element Boolean algebra, B(2) {4}. If the complement operation in P(m) is the pseudo-complement or strong negation, then more than one B(2) to P(m) mapping is …

    oklahoma-thes Repository record for B(2): P(M) DUAL RADIX SYSTEMS - THEORY, DESIGN, AND I(SQUARE)L IMPLEMENTATION. (opens in a new tab)

  16. A General Semantic Model of Negation in Natural Language: Representation and Inference

    … are two knowledge representation formalisms with Boolean semantics: a computable Boolean algebra for representing concepts and a computable Boolean algebra for representing the semantics of scalar predicate expressions of natural language that denote quantitative values. The UNO computer …

    uiuc Repository record for A General Semantic Model of Negation in Natural Language: Representation and Inference (opens in a new tab)

  17. Boolean minimization of large relay interlock and control systems

    … attention on the methods and mathematics of Boolean algebra. The result of this attention has been the development of powerful methods of synthesis and minimization of logic circuits. This area continues to be the subject of extensive research. The purpose of this paper is to explore the …

    nps Repository record for Boolean minimization of large relay interlock and control systems (opens in a new tab)

  18. Subalgebras of small Souslin Algebras and maximal chains in Souslin Algebras

    … combinatorics and the theory of complete Boolean algebras. As background theory we assume ZFC. A subset K of a Boolean algebra B will be called a chain of B if it is totally ordered by the canonical partial ordering on B. The set of chains of B is inductively ordered by the …

    fu-berlin Repository record for Subalgebras of small Souslin Algebras and maximal chains in Souslin Algebras (opens in a new tab)

  19. AN INTRODUCTION TO BOOLEAN ALGEBRAS

    This thesis discusses the topic of Boolean algebras. In order to build intuitive understanding of the topic, research began with the investigation of Boolean algebras in the area of Abstract Algebra. The content of this initial research used a particular notation. The ideas of partially ordered …

    csusb Repository record for AN INTRODUCTION TO BOOLEAN ALGEBRAS (opens in a new tab)

Page 1 of 5