Embeddings into Free Heyting Algebras and Translations into Intuitionistic Propositional Logic

Authors:
Michael O'Connor
Affiliations:
Cornell University,
Venue:
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
Year:
2007

Citing 1
Cited 1

Proofs and types

Proofs and types

The complexity of model checking for intuitionistic logics and their modal companions

RP'10 Proceedings of the 4th international conference on Reachability problems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We find a translation with particularly nice properties from intuitionistic propositional logic in countably many variables to intuitionistic propositional logic in two variables. In addition, the existence of a possibly-not-as-nice translation from any countable logic into intuitionistic propositional logic in two variables is shown. The nonexistence of a translation from classical logic into intuitionistic propositional logic which preserves 驴 and 驴 but not necessarily 驴 is proven. These results about translations follow from additional results about embeddings into free Heyting algebras.