✦ LIBER ✦

On the Theory of Boolean Formulas: Construction of the Set of the Formulas of Minimal Cost

✍ Scribed by Calabi, L.

Book ID: 118193869
Publisher: Society for Industrial and Applied Mathematics
Year: 1963
Weight: 542 KB
Volume: 11
Category: Article
ISSN: 0368-4245
DOI: 10.1137/0111037

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Theory of Boolean Formulas: Minim

On the Theory of Boolean Formulas: Minimal Including Sums, II

✍ Samson, E. W.; Calabi, L. 📂 Article 📅 1963 🏛 Society for Industrial and Applied Mathematics ⚖ 1004 KB

The complexity of Boolean formula minimi

The complexity of Boolean formula minimization

✍ David Buchfuhrer; Christopher Umans 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 206 KB

On Approximability of Boolean Formula Mi

On Approximability of Boolean Formula Minimization

✍ Oleg A. Prokopyev; Panos M. Pardalos 📂 Article 📅 2004 🏛 Springer US 🌐 English ⚖ 68 KB

On the readability of monotone Boolean f

On the readability of monotone Boolean formulae

✍ Khaled Elbassioni; Kazuhisa Makino; Imran Rauf 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 505 KB

The complexity of variable minimal formu

The complexity of variable minimal formulas

✍ ZhenYu Chen; BaoWen Xu; DeCheng Ding 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 564 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