Abstract
The Gödel-Tarski operation that prefixes the necessity symbol to every subformula is a sound and faithful translation of intuitionistic propositional logic into modal logic S4. We characterize modal formulas equivalent in S4 to Gödel-Tarski translations of intuitionistic propositional formulas. It would be interesting to obtain a similar characterization for intuitionistic predicate formulas. © 2012 Springer-Verlag Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
Mints, G. (2012). The Gödel-tarski translations of intuitionistic propositional formulas. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7265, 487–491. https://doi.org/10.1007/978-3-642-30743-0_33
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
