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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,349

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

Unification and Passive Inference Rules for Modal Logics.V. V. Rybakov, M. Terziler & C. Gencer - 2000 - Journal of Applied Non-Classical Logics 10 (3-4):369-377.
Canonical Rules.Emil Jeřábek - 2009 - Journal of Symbolic Logic 74 (4):1171 - 1205.
A(nother) characterization of intuitionistic propositional logic.Rosalie Iemhoff - 2001 - Annals of Pure and Applied Logic 113 (1-3):161-173.
Characteristic Inference Rules.Alex Citkin - 2015 - Logica Universalis 9 (1):27-46.

Analytics

Added to PP
2015-02-04

Downloads
6 (#1,430,516)

6 months
2 (#1,232,442)

Historical graph of downloads
How can I increase my downloads?

References found in this work

No references found.

Add more references