scientific article; zbMATH DE number 7243670
From MaRDI portal
Publication:5119388
Willem Conradie, Alessandra Palmigiano
Publication date: 4 September 2020
Full work available at URL: https://arxiv.org/abs/1603.08341
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (9)
Linear Logic Properly Displayed ⋮ Syntactic Completeness of Proper Display Calculi ⋮ Algebraic modal correspondence: Sahlqvist and beyond ⋮ Correspondence theory for modal Fairtlough-Mendler semantics of intuitionistic modal logic ⋮ Rough concepts ⋮ Subordination algebras as semantic environment of input/output logic ⋮ Algorithmic correspondence and canonicity for non-distributive logics ⋮ Modelling socio-political competition ⋮ Residuation algebras with functional duals
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithmic correspondence and canonicity for distributive modal logic
- Canonical extensions of posets.
- Algorithmic correspondence for intuitionistic modal mu-calculus
- From worlds to possibilities
- On the canonicity of Sahlqvist identities
- Constructive canonicity in non-classical logics
- Constructive canonicity for lattice-based fixed point logics
- Lattice logic properly displayed
- \(\Delta_1\)-completions of a poset.
- Algorithmic correspondence and canonicity for non-distributive logics
- Modelling informational entropy
- Algebraic modal correspondence: Sahlqvist and beyond
- Elementary canonical formulae: extending Sahlqvist's theorem
- Categories: How I Learned to Stop Worrying and Love Two Sorts
- A Multi-type Calculus for Inquisitive Logic
- A logic of agent organizations
- Dual characterizations for finite lattices via correspondence theory for monotone modal logic
- Canonicity results for mu-calculi: an algorithmic approach
- Sahlqvist theory for impossible worlds
- Jónsson-style canonicity for ALBA-inequalities
- On Sahlqvist theory for hybrid logics
- Unified correspondence and proof theory for strict implication
- CANONICITY RESULTS OF SUBSTRUCTURAL AND LATTICE-BASED LOGICS
- New foundations for Lewis modal systems
- THE LOGIC OF RESOURCES AND CAPABILITIES
- Unified correspondence as a proof-theoretic tool
- A new proof of Sahlqvist's theorem on modal definability and completeness
- A SAHLQVIST THEOREM FOR SUBSTRUCTURAL LOGIC
- Unified Correspondence
- Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA
- Canonical extensions and relational completeness of some substructural logics
- Boolean Algebras with Operators
- Bounded lattice expansions
This page was built for publication:
