Computational Enumeration of Basis-Cardinality Invariance in Finite Heyting Algebras: Source Code and Datasets

BCI in Finite Heyting Algebras Overview This repository contains the computational implementation and datasets for the finite Heyting-algebra investigation of basis-cardinality invariance in fuzzy closure systems. Experimental scope Six finite Heyting algebras are examined, constructed from the following poset configurations: Three-element chain Three-element fork Inverted three-element fork Four-element diamond N-poset V-poset with an additional point The enumeration produces 72 closure systems, including 23 systems with unequal-sized inclusion-minimal bases. Repository contents heyting_summary.csv — aggregate experimental results. heyting_closure_systems.csv — enumerated closure systems. heyting_counterexamples.csv — identified unequal-base systems. heyting_base_distribution.csv — minimal-base cardinality distribution. Source code — implementation of the enumeration procedure. Reproducibility The source code provides the computational procedure used to generate the reported results. The CSV files preserve the corresponding enumerated outputs for independent inspection and verification. Scope and limitations The results are restricted to the six finite Heyting algebras examined in the experiment. They should not be interpreted as a universal classification of finite Heyting algebras or as a proof of a general equivalence between chain structure and basis-cardinality invariance. Citation Please cite the associated research article when using these computational results. If the article is not yet published, cite this Zenodo record using its DOI once assigned. Author Som Subhro Nath