arXiv:2208.14715 [math.LO]AbstractReferencesReviewsResources
Intuitionistic Logic is a Connexive Logic
Davide Fazio, Antonio Ledda, Francesco Paoli
Published 2022-08-31Version 1
We show that intuitionistic logic is deductively equivalent to Connexive Heyting Logic (CHL), hereby introduced as an example of a strong connexive logic with intuitive semantics. We use the reverse algebraisation paradigm: CHL is presented as the assertional logic of a point regular variety (whose structure theory is examined in detail) that turns out to be term equivalent to the variety of Heyting algebras. We provide Hilbert-style and Gentzen-style proof systems for CHL; moreover, we suggest a possible computational interpretation of its connexive conditional, and we revisit Kapsner's idea of superconnexivity.
Comments: 36 pages, submitted
Categories: math.LO
Related articles: Most relevant | Search more
arXiv:1903.04625 [math.LO] (Published 2019-03-11)
Finite semantics for fragments of intuitionistic logic
arXiv:1211.1850 [math.LO] (Published 2012-11-08)
Copies of classical logic in intuitionistic logic
Failure of interpolation in the intuitionistic logic of constant domains