2009/05/25 by Pierre Hyvernat, Hyvernat, Pierre
Computer Science · Mathematics · #Advanced Algebra and Logic #Algebra over a field #Boolean algebras canonically defined #Boolean domain #Boolean expression #Boolean function #Complete Boolean algebra #Completeness (order theory) #Discrete mathematics #FOS: Computer and information sciences #FOS: Mathematics #Free Boolean algebra #Gödel's completeness theorem #Logic (math.LO) #Logic in Computer Science (cs.LO) #Logic, Reasoning, and Knowledge #Logic, programming, and type systems #Mathematics #Parity function #Pure mathematics #Stone's representation theorem for Boolean algebras #Two-element Boolean algebra #cs.LO #math.LO
paper · pdf · doi:10.48550/arxiv.0905.4060
short note
openalex publication_date 2009/05/25 · arxiv created 2009/11/03 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
Christine Tasson introduced an algebraic notion of totality for a denotational model of linear logic in the category of vector spaces. The notion of total boolean function is, in a way, quite intuitive. This note provides a positive answer to the question of completeness of the "boolean centroidal calculus" w.r.t. total boolean functions.