Results 111 to 120 of about 5,885 (231)
Degrees of Autostability Relative to Strong Constructivizations for Boolean Algebras
, 2020 © 2016 Springer Science+Business Media New YorkIt is proved that for every computable ordinal α, the Turing degree 0(α) is a degree of autostability of some computable Boolean algebra and is also a degree of autostability relative to strong ...
Bazhenov N.
core
ICT Adoption Policy of Australian and Croatian SMEs [PDF]
Many SMEs are currently adopting information and communication technology (ICT) and services based on it. However, there is little systematic research into how they are doing this and what are the organisational and environmental factors associated with ...
Arnela Ceric +3 more
core
The Lattice of Subalgebras of a Boolean Algebra
, 1962 It is well known (1, p. 162) that the lattice of subalgebras of a finite Boolean algebra is dually isomorphic to a finite partition lattice. In this paper we study the lattice of subalgebras of an arbitrary Boolean algebra.
David Sachs
core +1 more source
Complexity of Boolean algebras
Theoretical Computer Science, 1980 AbstractWe show that the elementary theory of Boolean algebras is ⩽log-complete for the Berman complexity class ...
openaire +1 more source
, 2012 REA's Essentials provide quick and easy access to critical information in a variety of different fields, ranging from the most basic to the most advanced.
Solomon, Alan D
core
Some results on pseudo MV-algebras with n-roots
Ratio MathematicaThe paper provides a study of pseudo MV-algebras with $n$-roots. We outline their main properties and establish that the class of MV-algebras with $n$-roots forms a variety.
Chen Xinrong, Hongxing Liu
doaj +1 more source
Boolean Algebra example 1 (MathsCasts)
, 2011 An example of using the laws of Boolean Algebra to simplify a Boolean expression, including use of De Morgan's ...
Vida Weiss
core
Semigroups with if-then-else and halting programs
, 2009 The "if–then–else" construction is one of the most elementary programming commands, and its abstract laws have been widely studied, starting with McCarthy.
Stokes, Tim E., Jackson, Marcel
core +1 more source
Judgment aggregators and Boolean algebra homomorphisms
, 2009 Herzberg F. Judgment aggregators and Boolean algebra homomorphisms. Working Papers. Institute of Mathematical Economics. Vol 414. Bielefeld: Universität Bielefeld; 2009.The theory of Boolean algebras can be fruitfully applied to judgment aggregation ...
Herzberg, Frederik
core
The Extension of an Arbitrary Boolean Algebra to an Implicative Boolean Algebra [PDF]
Proceedings of the American Mathematical Society, 1953 Copeland, Arthur H. sen., Harary, Frank
openaire +2 more sources