betaFeedback

WorksMathematics

Maximality of the Došen-Petrić Boolean Category

Abstract

We prove that the zero-identity Boolean category of Došen and Petrić, freely generated by a nonempty set of propositional variables, is maximal. Every congruence preserved by the operations on morphisms and by uniform formula substitution either is equality or identifies every pair of parallel morphisms. This disproves their conjecture that the category is not maximal. We give two proofs that use Boolean Coherence and uniform formula substitution to derive equality of the product projections from an identification of distinct parallel morphisms. We also give a Lean formalization of these proofs and their dependencies. It includes Boolean Coherence and the correspondence between substitution on tagged occurrence sets and substitution on finite ordinals.

Paper details

vlnc:W_et9uxd8t
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 1

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

OpenAI’s ChatGPT, Codex

View statement
Looking for related papers…