Skip Navigation

Logic Journal of IGPL 2004 12(4):301-311; doi:10.1093/jigpal/12.4.301
© 2004 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 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 Rybakov, V.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Tabular Logics with no Finite Bases for Inference Rules

V. Rybakov

Department of Computing and Mathematics, Manchester Metropolitan University, John Dalton Building, Chester Street, Manchester, M1 5GD, U.K. V.Rybakov{at}mmu.ac.uk

We find an example of a rooted, finite, partially ordered set Q9 such that the superintuitionistic logic L(Q9) generated by Q9 has no finite bases for admissible inference rules. The modal logic based on Q9 also has the same property.

Received 21 October 2003. Revised 15 June 2004.


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.