Bibliographic Details
| Title: |
Quantifier Elimination for Quantified Propositional Logics on Kripke Frames of Type ω. |
| Authors: |
BAAZ, MATTHIAS1 baaz@logic.at, PREINING, NORBERT1 preining@logic.at |
| Source: |
Journal of Logic & Computation. Aug2008, Vol. 18 Issue 4, p649-668. 20p. |
| Subjects: |
Mathematical logic, Combinatory logic, Mathematics, Computer software correctness, Logic machines, Model theory, Metamathematics, Set theory |
| Abstract: |
The minimal extension of intuitionistic propositional language is characterized, where propositional quantifiers are eliminable w.r.t. Kripke frames of type ω. [ABSTRACT FROM AUTHOR] |
|
Copyright of Journal of Logic & Computation is the property of Oxford University Press / USA and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
