Tabular Logics with no Finite Bases for Inference Rules

Logic Journal of the IGPL 12 (4):301-311 (2004)
  Copy   BIBTEX

Abstract

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

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,337

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2015-02-04

Downloads
12 (#1,369,278)

6 months
3 (#1,470,638)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

References found in this work

No references found.

Add more references