Logical Expressibility of Syntactic NL for Complementarity, Monotonicity, and Maximization

TL;DR

This work introduces $\mu$SNL, which is an extension of SNL by allowing the use of $\mu$-terms, and further study the computational complexity of monotone and optimization versions of SNL, respectively called MonoSNL and MAXSNL.

Abstract

Syntactic NL or succinctly SNL was first introduced in 2017, analogously to SNP, as a ``syntactically''-defined natural subclass of NL (nondeterministic logarithmic-space complexity class) using a restricted form of logical sentences, starting with second-order ``functional'' existential quantifiers followed by first-order universal quantifiers, in close connection to the so-called linear space hypothesis. We further explore various properties of this complexity class SNL to achieve the better understandings of logical expressibility in NL. For instance, SNL does not enjoy the dichotomy theorem unless L=NL. To express the ``complementary'' problems of SNL problems logically, we introduce $μ$SNL, which is an extension of SNL by allowing the use of $μ$-terms. As natural variants of SNL, we further study the computational complexity of monotone and optimization versions of SNL, respectively called MonoSNL and MAXSNL. We further consider maximization problems that are logarithmic-space approximable with only constant approximation ratios. We then introduce a natural subclass of MAXSNL, called MAX$τ$SNL, which enjoys such limited approximability.

Figures (1)

• Figure 1: Inclusion relationships among complexity classes discussed in this work.

Theorems & Definitions (37)

• Definition 2.2
• Definition 2.3
• Definition 2.4
• Definition 2.5
• Definition 2.6
• Definition 2.7
• Example 2.8
• Example 2.9
• Definition 2.10
• Theorem 3.3