Work

Alternating Set Quantifiers in Modal Logic

Year: 2016

Type: preprint

Abstract: We establish the strictness of several set quantifier alternation hierarchies that are based on modal logic, evaluated on various classes of finite graphs. This extends to the modal setting a celebrated result of Matz, Schweikardt and Thomas (2002), which states that the analogous hierarchy of monadic second-order logic is strict. Thereby, the present paper settles a question raised by van Benthem (1983), revived by ten Cate (2006), and partially answered by Kuusisto (2008, 2015).

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.1602.08971

Author: Reiter, Fabian

Institutions: Institut de Recherche en Informatique Fondamentale, Université Paris Diderot

Language: English

Topic: Logic, Reasoning, and Knowledge

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2292883291

Cites: 8

Cited by:

Related to: 20