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 Abstract Freely available
Right arrow Full Text (PDF)
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}

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



References

  1. Baaz M. Infinite-valued Gödel logics with 0-1-projections and relativizations. In. In: Proceedings of Gödel'96, Logic Foundations of Mathematics, Computer Science and Physics – Kurt Gödel's Legacy—Hájek P, ed. (1996) Berlin: Springer. Vol. 6 of Lecture Notes in Logic.
  2. Baaz M, Zach R. Compact propositional Gödel logics. In. In: 28th International Symposium on Multiple-valued Logic. May 1998, Fukuoka, Japan. Proceedings (1998) Los Alamitos: IEEE Press. 108–113.
  3. Gabbay DM. Semantical Investigations in Heyting's Intuitionistic Logic (1981) Dortrecht, Holland: D. Reidel Publishing Company. Vol. 148 of Synthese Library.
  4. Kremer P. On the complexity of propositional quantification in intuitionistic logic. Journal of Symbolic Logic (1997) 62:529–544.[CrossRef][ISI]
  5. Takeuti G. Proof Theory (1987) North Holland, Amsterdam.
  6. Zach R. Decidability of quantified propositional intuitionistic logic and S4 on trees of height and arity ≤ {omega}. Journal of Philosophical Logic (2004) 33:155–164.[CrossRef][ISI]

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



This Article
Right arrow Abstract Freely available
Right arrow Full Text (PDF)
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?