𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Constructing Ramsey graphs from Boolean function representations

✍ Scribed by Gopalan, Parikshit

Book ID
121555522
Publisher
Springer-Verlag
Year
2014
Tongue
English
Weight
566 KB
Volume
34
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Boolean function representation and spec
Boolean function representation and spectral characterization using AND/OR graphs
✍ A. Ε½uΕΎek; R. Drechsler; M.A. Thornton πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 301 KB

Methods based on AND/OR graph representations of Boolean relations provide a promising new way of approaching VLSI CAD design automation problems. AND/OR graphs can represent any Boolean network and they allow for systematic reasoning through the application of the technique of recursive learning. A

Superatomic Boolean algebras constructed
Superatomic Boolean algebras constructed from strongly unbounded functions
✍ Juan Carlos MartΓ­nez; Lajos Soukup πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 186 KB

Using Koszmider's strongly unbounded functions, we show the following consistency result: Suppose that ΞΊ, Ξ» are infinite cardinals such that ΞΊ + + + ≀ Ξ», ΞΊ < ΞΊ = ΞΊ and 2 ΞΊ = ΞΊ + , and Ξ· is an ordinal with ΞΊ + ≀ Ξ· < ΞΊ + + and cf(Ξ·) = ΞΊ + . Then, in some cardinal-preserving generic extension there is