2000 character limit reached
Choice-free Topological Duality for Implicative Lattices and Heyting Algebras
Published 7 Feb 2023 in math.LO and cs.LO | (2302.03674v1)
Abstract: We develop a common semantic framework for the interpretation both of $\mathbf{IPC}$, the intuitionistic propositional calculus, and of logics weaker than $\mathbf{IPC}$ (substructural and subintuitionistic logics). This is done by proving a choice-free representation and duality theorem for implicative lattices, which may or may not be distributive. The duality specializes to a choice-free duality for the category of Heyting algebras and a category of topological sorted frames with a ternary sorted relation.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.