In mathematics, S2S is the monadic second order theory with two successors. It is one of the most expressive natural decidable theories known, with many...

In mathematics, S2S is the monadic second order theory of the infinite complete binary tree. S2S may also refer to: Server-to-server, protocol exchange...

Reverse mathematics is a program in mathematical logic that seeks to determine which axioms are required to prove theorems of mathematics. Its defining...

first-order statements hold for all total orders. Using interpretability in S2S, the monadic second-order theory of countable total orders is also decidable...

precisely of regular languages. For a binary alphabet, the theory is called S2S. In computational complexity theory, the complexity class of all regular...

automata and proved that the monadic second-order theory of n successors (S2S when n = 2) is decidable. A key component of the proof implicitly showed...

monadic second-order theory of the infinite complete binary tree, called S2S, is decidable. As a consequence of this result, the following theories are...

meta-theorem in graph theory. The MSO theory of the complete infinite binary tree (S2S) is decidable. By contrast, full second order logic over any infinite set...

proof of decidability of the monadic second-order theory of n successors (S2S for n = 2), where determinacy of such games was proven. The Knaster–Tarski...

today.(Cantone et al., 2001) The monadic second-order theory of trees (see S2S). Methods used to establish decidability include quantifier elimination,...