Monthly Lecture

In collaboration with the Iranian Institute of Philosophy

This event has taken place

Local Tabularity in Relevance Logic

Amir Hossein Sharafi (Tafresh University)

Abstract

Let us look at the number of non-equivalent formulas of classical logic. There are infinitely many non-equivalent formulas in this logic, but with finitely many variables only finitely many non-equivalent formulas can be built; for example, 16 with two variables and 256 with three. In general, classical logic yields 2^(2^n) non-equivalent formulas in n variables. In non-classical logics this is usually not the case, and often even a single variable gives rise to infinitely many non-equivalent formulas; for example, in the modal logic K the variable p alone generates the infinitely many non-equivalent formulas p, □p, □□p, … Non-classical logics that resemble classical logic in this respect, generating finitely many non-equivalent formulas from finitely many variables, form a notable class of non-classical logics, called “locally tabular” or “locally finite”.

More precisely, a propositional logic is called tabular (or finite) if it is sound and complete with respect to a finite truth table, in other words, if it is characterized by a finite model. There are also logics that are not tabular but may satisfy a weaker property called local tabularity. A logic is locally tabular if its restriction to finitely many variables is tabular, in other words, if only finitely many non-equivalent formulas can be built from finitely many variables. Classical logic is tabular and hence locally tabular. Local tabularity is studied mainly in non-classical logics. The modal logic S5 and the intermediate logic LC are among the earliest and most prominent examples of locally tabular logics, while intuitionistic logic, the relevance logic R, and the modal logics K, D, T and S4 are not locally tabular. In view of these examples, determining whether various logics are locally tabular is of considerable importance.

Research on tabularity and local tabularity of logics began in the 1920s. Besides their intrinsic interest, locally tabular logics have many desirable properties, such as decidability, the finite model property (fmp) and Kripke completeness (for modal logics). Moreover, every extension of a locally tabular logic is locally tabular and inherits these properties, which is another attractive feature of locally tabular logics. As part of a systematic study, Krister Segerberg and Larisa Maksimova discovered a remarkable theorem characterizing the locally tabular extensions of K4 as the logics of finite height. Nevertheless, characterizing locally tabular intermediate logics remains an open problem. Ilya Shapirovsky and Valentin Shehtman have made significant progress in characterizing locally tabular modal logics extending K. In this talk, inspired by this research, we introduce some characterizations related to local tabularity for extensions of relevance logic.

Date: Wednesday, 28 August 2024

Time: 16:00–18:00 (Tehran time)

Format: Online

Join the online session

Audio and video files

Lecture announcement (PDF)