A correct polynomial translation of S4 into intuitionistic logic
From MaRDI portal
Publication:5222518
DOI10.1017/JSL.2017.66zbMATH Open1457.03041OpenAlexW2951297772WikidataQ127732555 ScholiaQ127732555MaRDI QIDQ5222518FDOQ5222518
Authors: Rajeev Goré, Jimmy Thomson
Publication date: 6 April 2020
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/8c0c5df8bf82e67a77c5851921f0f017e0a520dd
Recommendations
Modal logic (including the logic of norms) (03B45) Subsystems of classical logic (including intuitionistic logic) (03B20)
Cites Work
Cited In (8)
- On different intuitionistic calculi and embeddings from Int to S4
- Title not available (Why is that?)
- A polynomial translation of S4 into intuitionistic logic
- Synthesis of modality definitions and a theorem prover for epistemic intuitionistic logic
- The Gödel-Tarski translations of intuitionistic propositional formulas
- Modal logic S5 satisfiability in answer set programming
- A translation from the modal logic of provability into K4
- Undefinability of propositional quantifiers in the modal system S4
This page was built for publication: A correct polynomial translation of S4 into intuitionistic logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5222518)