Skip Navigation

Journal of Logic and Computation 2002 12(6):955-992; doi:10.1093/logcom/12.6.955
© 2002 by Oxford University Press
This Article
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 Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (2)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Fiorino, G.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Original Article

Space-efficient Decision Procedures for Three Interpolable Propositional Intermediate Logics

Guido Fiorino1

1 Dipartimento di Scienze dell'Informazione, Universita' degli Studi di Milano, Italy.E-mail: fiorino{at}dsi.unimi.it

In this paper we present duplication-free tableau calculi for three propositional intermediate interpolable logics, namely the logic characterized by rooted Kripke models with depth two at most, the logic characterized by rooted Kripke models with two final elements at most and depth two at most and the logic characterized by rooted Kripke models with a final element at most (also known as Jankov Logic). Using such calculi we define a O(n)-SPACE decision procedure for the second logic and a O(n log n)-SPACE decision procedure for each of the other two logics.

Keywords: Tableau systems; intermediate logics; decision procedures

Received 21 June 2000.


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.