Constructive canonicity of inductive inequalities
From MaRDI portal
Recommendations
- Algorithmic correspondence and canonicity for non-distributive logics
- Slanted canonicity of analytic inductive inequalities
- Algorithmic correspondence and canonicity for distributive modal logic
- Canonicity results for mu-calculi: an algorithmic approach
- Constructive canonicity for lattice-based fixed point logics
Cites work
- _1-completions of a poset.
- A logic of agent organizations
- A Multi-type Calculus for Inquisitive Logic
- A new proof of Sahlqvist's theorem on modal definability and completeness
- A Sahlqvist theorem for substructural logic
- Algebraic modal correspondence: Sahlqvist and beyond
- Algorithmic correspondence and canonicity for distributive modal logic
- Algorithmic correspondence and canonicity for non-distributive logics
- Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA
- Algorithmic correspondence for intuitionistic modal mu-calculus
- Boolean Algebras with Operators
- Bounded lattice expansions
- Canonical extensions and relational completeness of some substructural logics
- Canonical extensions of posets.
- Canonicity results for mu-calculi: an algorithmic approach
- Canonicity results of substructural and lattice-based logics
- Categories: how I learned to stop worrying and love two sorts
- Constructive canonicity for lattice-based fixed point logics
- Constructive canonicity in non-classical logics
- Dual characterizations for finite lattices via correspondence theory for monotone modal logic
- Elementary canonical formulae: extending Sahlqvist's theorem
- From worlds to possibilities
- scientific article; zbMATH DE number 1748069 (Why is no real title available?)
- scientific article; zbMATH DE number 877297 (Why is no real title available?)
- scientific article; zbMATH DE number 3260754 (Why is no real title available?)
- Jónsson-style canonicity for ALBA-inequalities
- Lattice logic properly displayed
- Modelling informational entropy
- New foundations for Lewis modal systems
- On Sahlqvist theory for hybrid logics
- On the canonicity of Sahlqvist identities
- Sahlqvist theory for impossible worlds
- Sahlqvist via translation
- THE LOGIC OF RESOURCES AND CAPABILITIES
- Unified correspondence
- Unified correspondence and proof theory for strict implication
- Unified correspondence as a proof-theoretic tool
Cited in
(17)- Modelling socio-political competition
- Algorithmic correspondence and canonicity for non-distributive logics
- Residuation algebras with functional duals
- Algebraic modal correspondence: Sahlqvist and beyond
- Syntactic Completeness of Proper Display Calculi
- Linear Logic Properly Displayed
- Correspondence theory for modal Fairtlough-Mendler semantics of intuitionistic modal logic
- Rough concepts
- Subordination algebras as semantic environment of input/output logic
- Constructive Canonicity of Inductive Inequalities
- Algebraic proof theory for LE-logics
- Modal reduction principles: a parametric shift to graphs
- Monotone modal logic beyond distributivity
- Unified inverse correspondence for LE-logics
- Modal reduction principles across relational semantics
- Intuitionistic Sahlqvist theory for deductive systems
- Obligations and permissions on selfextensional logics
This page was built for publication: Constructive canonicity of inductive inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5119388)
