Skip Navigation



Journal of Logic and Computation Advance Access published online on April 14, 2008
Journal of Logic and Computation, doi:10.1093/logcom/exn004
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Baaz, M.
Right arrow Articles by Preining, N.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author, 2008. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

Original Papers

Quantifier Elimination for Quantified Propositional Logics on Kripke Frames of Type {omega}

Matthias Baaz and Norbert Preining

Institute for Algebra and Computational Mathematics, University of Technology, Vienna, Austria. E-email: { baaz{at}logic.at; preining{at}logic.at}


  Abstract

The minimal extension of intuitionistic propositional language is characterized, where propositional quantifiers are eliminable w.r.t. Kripke frames of type {omega}.

Keywords: quantified propositional logics; Gödel logics; quantifier elimination


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.