Computational properties of finite PNmatrices

Abstract

Recent compositionality results in logic have highlighted the advantages of enlarging the traditional notion of logical matrix semantics, namely by incorporating non-determinism and partiality. Still, several important properties which are known to be computable for finite logical matrices have not been studied in the wider context of partial non-deterministic matrices (PNmatrices). In this paper, we study how incorporating non-determinism and/or partiality in logical matrices impacts on the computational properties of some natural problems regarding their induced logics and concretely their sets of theorems. We show that, while for some of these problems there is no relevant computational impact, there are problems whose computational complexity increases and still other problems that simply become undecidable. In particular, we show that the problem of checking whether the logics characterized by two finite PNmatrices have the same set of theorems is not decidable. This undecidability result explores the connection between PNmatrices and term-DAG-automata, where the universality problem is known to be undecidable. This link also motivates a final contribution, in the form of a pumping-like lemma, which can be used, in some cases, to show that a given logic cannot be characterized by a finite PNmatrix.

Meet-Combination of Consequence Systems

“…We intend to define product of nondeterministic matrices. The concept was introduced in (Rescher, 1962) under the name quasi-truth functional constructors and later on developed in (Avron and Lev, 2005;Avron and Zohar, 2019;Filipe et al, 2022). It seems worthwhile to investigate preservation of other meta properties by meet-combination, namely decidability, algebraizability, protoalgebraicity and amalgamation (see Blok and Pigozzi, 1989;Czelakowski, 1982Czelakowski, , 2001.…”