English

Capturing k-ary Existential Second Order Logic with k-ary Inclusion-Exclusion Logic

Logic 2018-06-19 v4 Logic in Computer Science

Abstract

In this paper we analyze k-ary inclusion-exclusion logic, INEX[k], which is obtained by extending first order logic with k-ary inclusion and exclusion atoms. We show that every formula of INEX[k] can be expressed with a formula of k-ary existential second order logic, ESO[k]. Conversely, every formula of ESO[k] with at most k-ary free relation variables can be expressed with a formula of INEX[k]. From this it follows that, on the level of sentences, INEX[k] captures the expressive power of ESO[k]. We also introduce several useful operators that can be expressed in INEX[k]. In particular, we define inclusion and exclusion quantifiers and so-called term value preserving disjunction which is essential for the proofs of the main results in this paper. Furthermore, we present a novel method of relativization for team semantics and analyze the duality of inclusion and exclusion atoms.

Keywords

Cite

@article{arxiv.1502.05632,
  title  = {Capturing k-ary Existential Second Order Logic with k-ary Inclusion-Exclusion Logic},
  author = {Raine Rönnholm},
  journal= {arXiv preprint arXiv:1502.05632},
  year   = {2018}
}

Comments

Extended version of a paper published in Annals of Pure and Applied Logic 169 (3), 177-215

R2 v1 2026-06-22T08:33:21.823Z