Algorithmic correspondence and canonicity for possibility semantics

DOI10.1093/LOGCOM/EXAB004MaRDI QIDQ5858133zbMATH OpenOpenAlexFDO

Authors Zhiguang Zhao

Publication date 9 April 2021

Published in Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1612.04957

zbMATH Keywords

algorithmic correspondencecanonicitycorrespondence theoryduality theorypossibility semantics

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Computer science (68-XX)

Recommendations

• Algorithmic correspondence and canonicity for distributive modal logic
• Algorithmic correspondence and canonicity for non-distributive logics
• Semantics of non-deterministic possibility computation
• Results in modal correspondence theory for possibility semantics
• Possibilistic logic: Complexity and algorithms
• Domain semantics of possibility computations
• scientific article; zbMATH DE number 1989651
• scientific article; zbMATH DE number 2121570
• A systematic approach to canonicity in the classical sequent calculus
• Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA

Cited in

(5)

• Algorithmic correspondence and canonicity for non-distributive logics
• Canonicity results for mu-calculi: an algorithmic approach
• Correspondence theory for modal Fairtlough-Mendler semantics of intuitionistic modal logic
• Algorithmic Correspondence and Canonicity for Possibility Semantics
• A partial-state space model of unawareness

This page was built for publication: Algorithmic correspondence and canonicity for possibility semantics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5858133)