Local tabularity without transitivity
نویسندگان
چکیده
According to the classical result by Segerberg and Maksimova, a modal logic containing K4 is locally tabular i↵ it is of finite height. The notion of finite height can also be defined for logics, in which the master modality is expressible (‘pretransitive’ logics). We observe that every locally tabular logic is a pretransitive logic of finite height. Then we prove some semantic criteria of local tabularly. By applying them we extend the Segerberg – Maksimova theorem to a certain larger family of pretransitive logics.
منابع مشابه
Canonical Filtrations and Local Tabularity
The paper deals with a special type of filtration in modal logic called “canonical”. This filtration has been known since the 1970s, but was used only occasionally. Applying it in a systematic way allows us to prove new results on finite model property (and in some cases — local tabularity) for different polymodal logics. In particular, we consider products of logics of finite depth with S5 and...
متن کاملDecidable properties of logical calculi and of varieties of algebras
We give an overview of decidable and strongly decidable properties over the propositional modal logics K, GL, S4, S5 and Grz, and also over the intuitionistic logic Int and the positive logic Int+. We consider a number of important properties of logical calculi: consistency, tabularity, pretabularity, local tabularity, various forms of interpolation and of the Beth property. For instance, consi...
متن کاملTransitivity of Commutativity for Linear Time-Varying Analog Systems
In this contribution, the transitivity property of commutative first-order linear timevarying systems is investigated with and without initial conditions. It is proven that transitivity property of first-order systems holds with and without initial conditions. On the base of impulse response function, transitivity of commutation property is formulated for any triplet of commutative linear time-...
متن کاملInformation diffusion on the iterated local transitivity model of online social networks
We study a recently introduced deterministic model of competitive information diffusion on the Iterated Local Transitivity (ILT) model of Online Social Networks (OSNs). In particular, we show that, for 2 competing agents, an independent Nash Equilibrium (N.E.) on the initial graph remains a N.E. for all subsequent times. We also describe an example showing that this conclusion does not hold for...
متن کاملRationalizability of choice functions on general domains without full transitivity
The rationalizability of a choice function by means of a transitive relation has been analyzed thoroughly in the literature. However, not much seems to be known when transitivity is weakened to quasi-transitivity or acyclicity. We describe the logical relationships between the different notions of rationalizability involving, for example, the transitivity, quasi-transitivity, or acyclicity of t...
متن کامل