Premium
A Bounded Translation of Intuitionistic Propositional Logic into Basic Propositional Logic
Author(s) -
Aghaei Mojtaba,
Ardeshir Mohammad
Publication year - 2000
Publication title -
mathematical logic quarterly
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.473
H-Index - 28
eISSN - 1521-3870
pISSN - 0942-5616
DOI - 10.1002/(sici)1521-3870(200005)46:2<199::aid-malq199>3.0.co;2-b
Subject(s) - intuitionistic logic , zeroth order logic , propositional variable , intermediate logic , well formed formula , mathematics , autoepistemic logic , translation (biology) , propositional calculus , bounded function , discrete mathematics , many valued logic , propositional formula , classical logic , algebra over a field , pure mathematics , computer science , artificial intelligence , description logic , multimodal logic , mathematical analysis , biochemistry , chemistry , messenger rna , gene
In this paper we prove a bounded translation of intuitionistic propositional logic into basic propositional logic. Our new theorem, compared with the translation theorem in [1], has the advantage that it gives an effective bound on the translation, depending on the complexity of formulas.