𝔖 Bobbio Scriptorium
✦   LIBER   ✦

New algorithms for minimizing weakly defined Boolean functions

✍ Scribed by A. D. Zakrevskii


Publisher
Springer US
Year
1969
Tongue
English
Weight
604 KB
Volume
5
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


On the Boolean algebras of definable set
✍ Stefano Leonesi; Carlo Toffalori πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 141 KB πŸ‘ 1 views

## Abstract We consider the sets definable in the countable models of a weakly o‐minimal theory __T__ of totally ordered structures. We investigate under which conditions their Boolean algebras are isomorphic (hence __T__ is p‐__Ο‰__‐categorical), in other words when each of these definable sets adm