Provability games for non-classical logics. Mezhirov game for MPC, KD!, and KD

DOI10.1007/978-3-030-88853-4_25OpenAlexW3208946267MaRDI QIDQ2148809FDOQ2148809

Authors: Aleksandra Mikhaĭlovna Pavlova 

Publication date: 24 June 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-88853-4_25

Recommendations

• From semantic games to provability: the case of Gödel logic
• Some remarks on relations between proofs and games
• Games for hybrid logic. From semantic games to analytic calculi
• A Game Semantics for Grz
• A game semantics for system P

zbMATH Keywords

modal logicminimal logicprovability game

Mathematics Subject Classification ID

Logic in computer science (03B70)

Cites Work

• Title not available (Why is that?)
• Unification and admissible rules for paraconsistent minimal Johanssons' logic J and positive intuitionistic logic \(\mathbf{IPC}^+\)
• Title not available (Why is that?)
• Logic in games
• Title not available (Why is that?)
• Constructive negations and paraconsistency
• Title not available (Why is that?)
• From games to dialogues and back. Towards a general frame for validity
• On Game Semantics of the Affine and Intuitionistic Logics
• Modal logics with functional alternative relations
• Proof theory for functional modal logic
• Subminimal negation
• Giles's game and the proof theory of Łukasiewicz logic
• A Game Semantics for Grz
• Dialogue games for minimal logic
• Logic games: from tools to models of interaction

This page was built for publication: Provability games for non-classical logics. Mezhirov game for MPC, KD!, and KD

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