LC and Its Pretabular Relatives

5Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In 1970, J.M. Dunn published a paper on a logic called RM extending the logic R of relevance. He proved that the logic RM is pretabular, i.e., it has no finite characteristic matrix, but every proper extension of it has such a matrix. In 1971, J.M. Dunn and R.K. Meyer obtained a similar result for Dummett’s logic LC. This is a brief survey of pretabular logics. We consider pretabularity and tabularity problems over the intuitionistic and minimal logics, and also in families of positive, modal and relevant logics.

Cite

CITATION STYLE

APA

Maksimova, L. (2016). LC and Its Pretabular Relatives. In Outstanding Contributions to Logic (Vol. 8, pp. 81–91). Springer. https://doi.org/10.1007/978-3-319-29300-4_5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free