Related papers: $\Sigma^{\mu}_2$ is decidable for $\Pi^{\mu}_2$

We show that the common theory of all modules over a tubular algebra (over a recursive algebraically closed field) is decidable. This result supports a long standing conjecture of Mike Prest which says that a finite-dimensional algebra…

We consider the classification, up to unitary equivalence, of commuting n-tuples of isometries. We pay special attention to the case when the product of the isometries is a shift of finite multiplicity, and we provide a complete…

We study the lambda-mu-calculus, extended with explicit substitution, and define a compositional output-based interpretation into a variant of the pi-calculus with pairing that preserves single-step explicit head reduction with respect to…

We develop a procedure for determining whether a square complex matrix is unitarily equivalent to a complex symmetric (i.e., self-transpose) matrix. Our approach has several advantages over existing methods. We discuss these differences and…

We treat two different equations involving powers of singular moduli. On the one hand, we show that, with two possible (explicitly specified) exceptions, two distinct singular moduli j(\tau),j(\tau') such that the numbers 1, j(\tau)^m and…

We give explicit formulas to compute most of the decomposition numbers of reductions modulo 2 of irreducible spin representations of symmetric groups indexed by partitions with at most 2 parts. In many of the still open cases small upper…

A binary relation on graphs is recursively enumerable if and only if it can be computed by a formula in monadic second-order logic. The latter means that the formula defines a set of graphs, in the usual way, such that each "computation…

We investigate the decidability of the monadic second-order (MSO) theory of the structure $\langle \mathbb{N};<,P_1, \ldots,P_d \rangle$, for various unary predicates $P_1,\ldots,P_d \subseteq \mathbb{N}$. We focus in particular on…

We consider bisimulation-invariant monadic second-order logic over various classes of finite transition systems. We present several combinatorial characterisations of when the expressive power of this fragment coincides with that of the…

For any positive integer $n$, let ${\rm C}_{n}$ be the cyclic group of order $n$. We determine all possible values of the integer group determinant of ${\rm C}_{2}^{2} \rtimes C_{4}$.

In this paper we develop a technique for proving determinacy of classes of the form $\omega^2-\Pi^1_1+\Gamma$ (a refinement of the difference hierarchy on the co-analytic sets lying between $\omega^2-\Pi^1_1$ and $(\omega^2+1)-\Pi^1_1$)…

A fundamental question in logic and verification is the following: for which unary predicates $P_1, \ldots, P_k$ is the monadic second-order theory of $\langle \mathbb{N}; <, P_1, \ldots, P_k \rangle$ decidable? Equivalently, for which…

We define game semantics for the constructive $\mu$-calculus and prove its equivalence to bi-relational semantics. As an application, we use the game semantics to prove that the $\mu$-calculus collapses to modal logic over the modal logic…

We discuss necessary as well as sufficient conditions for the second iterated local multiplier algebra of a separable C*-algebra to agree with the first.

Let $G$ be a finite group and $\sigma_1(G)=\frac{1}{|G|}\sum_{H\leq G}\,|H|$. In this note, we prove that if $\sigma_1(G)<\frac{117}{20}$, then $G$ is solvable. Moreover, we have $\sigma_1(G)=\frac{117}{20}$ if and only if $G\cong A_5$.…

A family of original formulae for computing number PI and its proof are presented. An algorithm is proposed to validate the results of this new algorithm.

Let $\mu$ be a strong limit singular cardinal. We prove that if $2^{\mu} > \mu^+$ then $\binom{\mu^+}{\mu}\to \binom{\tau}{\mu}_{<{\rm cf}(\mu)}$ for every ordinal $\tau<\mu^+$. We obtain an optimal positive relation under $2^\mu = \mu^+$,…

Isomorphism between formulae is defined with respect to categories formalizing equality of deductions in classical propositional logic and in the multiplicative fragment of classical linear propositional logic caught by proof nets. This…

Representable implication algebras are known to be axiomatised by a finite number of equations (making the representation and finite representation problems decidable here). We show that this also holds in the context of unary (and binary)…

We address the problem of determining the class of self-similar groups, and in particular its closure under restricted direct products. We show that the group $\mathbb Z^{(\omega)}$ is self-similar, that $G^{(\omega)}\rtimes C_2$ is…