Hostname: page-component-8448b6f56d-qsmjn Total loading time: 0 Render date: 2024-04-25T06:33:14.382Z Has data issue: false hasContentIssue false

A CORRECT POLYNOMIAL TRANSLATION OF S4 INTO INTUITIONISTIC LOGIC

Published online by Cambridge University Press:  11 June 2019

RAJEEV GORÉ
Affiliation:
RESEARCH SCHOOL OF COMPUTER SCIENCE THE AUSTRALIAN NATIONAL UNIVERSITY CANBERRA, ACT0200, AUSTRALIA E-mail: rajeev.gore@anu.edu.au
JIMMY THOMSON
Affiliation:
RESEARCH SCHOOL OF COMPUTER SCIENCE THE AUSTRALIAN NATIONAL UNIVERSITY CANBERRA, ACT0200, AUSTRALIA E-mail: jimmy.thomson@anu.edu.au

Abstract

We show that the polynomial translation of the classical propositional normal modal logic S4 into the intuitionistic propositional logic Int from Fernández is incorrect. We give a modified translation and prove its correctness, and provide implementations of both translations to allow others to test our results.

Type
Articles
Copyright
Copyright © The Association for Symbolic Logic 2019 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

Fernández, D., A polynomial translation of s4 into intuitionistic logic, this Journal, vol. 71 (2006), no. 3, pp. 9891001.Google Scholar
Gödel, K., Kurt Gödel: Collected Works: Volume I: Publications 1929–1936, vol. 1, Oxford University Press, New York, 1986.Google Scholar