Results 11 to 20 of about 794 (137)
Generalising KAT to Verify Weighted Computations
Scientific Annals of Computer Science, 2019 Kleene algebra with tests (KAT) was introduced as an algebraic structure to model and reason about classic imperative programs, i.e. sequences of discrete transitions guarded by Boolean tests.
Leandro Gomes +2 more
doaj +1 more source
Free extensions of Boolean algebras [PDF]
Pacific Journal of Mathematics, 1963 Abstract not ...
openaire +2 more sources
Graph spaces and ⊥-free Boolean algebras [PDF]
Proceedings of the American Mathematical Society, 1994 Let X denote an arbitrary second-countable, compact, zero-dimensional space. Our main result says that X is a graph space, i.e., homeomorphic to the space of all complete subgraphs of a suitable graph.
openaire +2 more sources
A property of free Boolean algebras [PDF]
Proceedings of the American Mathematical Society, 1968 Consider the following properties of a Boolean algebra A : Pi: Every set of pairwise disjoint elements of A is countable. P2: Every chain in A is countable. For arbitrary Boolean algebras neither of these properties implies the other. The algebra of all sets of integers satisfies Pi but not P2, while the algebra of all finite or cofinite sets of real ...
openaire +2 more sources
The Mardešić Conjecture and free products of Boolean algebras
Proceedings of the American Mathematical Society, 2018 In [Glas. Mat., III. Ser. 5(25), 163--170 (1970; Zbl 0195.52301)], \textit{S. Mardešić} studied continuous images of products of linearly ordered compacta and stated the following conjecture: if a product of $d$ linearly ordered compact spaces can be continuously mapped onto a product of $d + s$ infinite compact spaces $K_1, K_2, \dots , K_{d+s}$, $s ...
Martínez-Cervantes, Gonzalo +1 more
openaire +2 more sources
Annals of Pure and Applied Logic, 1992 AbstractWe study L∞κ-freeness in the variety of Boolean algebras. It is shown that some of the theorems on L∞κ-free algebras which are known to hold in varieties such as groups, abelian groups etc. are also true for Boolean algebras. But we also investigate properties such as the ccc of L∞κ-free Boolean algebras which have no counterpart in the ...
Fuchino, Sakaé +2 more
openaire +2 more sources
Evaluation Trees and Normalisation for Proposition Algebra
MathematicsProposition algebra is based on Hoare’s conditional, a ternary connective comparable to if–then–else and used in the context of propositional logic. Conditional statements are composed from atomic propositions (propositional variables), constants for the
Jan A. Bergstra +2 more
doaj +1 more source
Multiple context-free path querying by matrix multiplication
Научно-технический вестник информационных технологий, механики и оптикиMany graph analysis problems can be formulated as formal language-constrained path querying problems where the formal languages are used as constraints for navigational path queries.
I. V. Epelbaum +2 more
doaj +1 more source
SiOx‐Based Probabilistic Bits Enabling Invertible Logic Gate for Cryptographic Applications
Advanced Intelligent Systems, EarlyView.To enable lightweight hardware encryption and decryption, a Ti/SiOx/Ti threshold switching device is engineered to generate controllable stochastic oscillations. By tuning the input voltage, the device produces a programmable spike probability governed by intrinsic switching dynamics, enabling probabilistic bits that construct an invertible ...
Jihyun Kim, Hyeonsik Choi, Jiyong Woo
wiley +1 more source
Corporate Social Responsibility and Environmental Management, EarlyView.ABSTRACT Sustainability‐oriented collaborations are inter‐organisational arrangements where the competencies of multiple companies are pooled together to tackle environmental challenges. These collaborations differ from traditional strategic alliances in that they tackle complex goals amidst greater uncertainties that extend beyond economic performance,
Vittorio Maria Garibbo +3 more
wiley +1 more source