✦ LIBER ✦

Minimization algorithms for weakly defined boolean functions

✍ Scribed by A. D. Zakrevskii

Publisher: Springer US
Year: 1965
Tongue: English
Weight: 584 KB
Volume: 1
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01073534

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

New algorithms for minimizing weakly def

New algorithms for minimizing weakly defined Boolean functions

✍ A. D. Zakrevskii 📂 Article 📅 1969 🏛 Springer US 🌐 English ⚖ 604 KB

An algorithm for minimizing Boolean func

An algorithm for minimizing Boolean functions

✍ J. C. Wilson 📂 Article 📅 1975 🏛 Springer 🌐 English ⚖ 581 KB

Minimization of boolean functions and ef

Minimization of boolean functions and effective recognition algorithms

✍ I. B. Gurevich; Yu. I. Zhuravlev 📂 Article 📅 1975 🏛 Springer US 🌐 English ⚖ 347 KB

A minimization method for boolean functi

A minimization method for boolean functions

✍ V. G. Skobelev 📂 Article 📅 1990 🏛 Springer US 🌐 English ⚖ 538 KB

Realization of weakly defined Boolean fu

Realization of weakly defined Boolean functions by linearized disjunctive normal forms

✍ A.A. Aleksanyan 📂 Article 📅 1989 🏛 Elsevier Science ⚖ 343 KB

On the Boolean algebras of definable set

On the Boolean algebras of definable sets in weakly o-minimal theories

✍ 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