2021/10/08 by Ariel J. Roffe, Roffe, Ariel J., Joaquin S. Toranzo Calderon +1
Computer Science · Mathematics · #Advanced Algebra and Logic #Algorithms and Data Compression #FOS: Computer and information sciences #FOS: Mathematics #Logic (math.LO) #Logic in Computer Science (cs.LO) #cs.LO #math.LO #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.2110.09228
arxiv created 2021/10/08 · openalex publication_date 2021/10/08 · arxiv updated 2021/10/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this article, we provide three generators of propositional formulae for arbitrary languages, which uniformly sample three different formulae spaces. They take the same three parameters as input, namely, a desired depth, a set of atomics and a set of logical constants (with specified arities). The first generator returns formulae of exactly the given depth, using all or some of the propositional letters. The second does the same but samples up-to the given depth. The third generator outputs formulae with exactly the desired depth and all the atomics in the set. To make the generators uniform (i.e. to make them return every formula in their space with the same probability), we will prove various cardinality results about those spaces.