Complexity and Limiting Ratio of Boolean Functions over Implication

Abstract

We consider the logical system of boolean expressions built on the single connector of implication and on positive literals. Assuming all expressions of a given size to be equally likely, we prove that we can define a probability distribution on the set of boolean functions expressible in this system. We then show how to approximate the probability of a… (More)
DOI: 10.1007/978-3-540-85238-4_28

Topics

6 Figures and Tables

Slides referencing similar topics