Choice-free Topological Duality for Implicative Lattices and Heyting Algebras

02/07/2023
by   Chrysafis Hartonas, et al.
0

We develop a common semantic framework for the interpretation both of 𝐈𝐏𝐂, the intuitionistic propositional calculus, and of logics weaker than 𝐈𝐏𝐂 (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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/17/2018

Ruitenburg's Theorem via Duality and Bounded Bisimulations

For a given intuitionistic propositional formula A and a propositional v...
research
01/13/2023

Choice-free Dualities for Lattice Expansions: Application to Logics with a Negation Operator

Constructive dualities have been recently proposed for some lattice base...
research
01/29/2021

A Symmetric Lambda-Calculus Corresponding to the Negation-Free Bilateral Natural Deduction

Filinski constructed a symmetric lambda-calculus consisting of expressio...
research
07/15/2019

Topological rewriting systems applied to standard bases and syntactic algebras

We propose a functional description of rewriting systems on topological ...
research
10/13/2021

Duality for Normal Lattice Expansions and Sorted, Residuated Frames with Relations

We revisit the problem of Stone duality for lattices with various quasio...
research
12/20/2018

Iterated Belief Revision Under Resource Constraints: Logic as Geometry

We propose a variant of iterated belief revision designed for settings w...
research
03/23/2018

Equivariant ZFA with Choice: a position paper

We propose Equivariant ZFA with Choice as a foundation for nominal techn...

Please sign up or login with your details

Forgot password? Click here to reset