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

In this article, we propose a new classification of $\Sigma^0_2$ formulas under the realizability interpretation of many-one reducibility (i.e., Levin reducibility). For example, ${\sf Fin}$, the decision of being eventually zero for…

Let $M$ be a finitely generated module over a ring $\Lambda$. With certain mild assumptions on $\Lambda$, it is proven that $M$ is a reflexive $\Lambda$-module, once $M \cong M^{**}$ as a $\Lambda$-module.

We give a computationally effective criterion for determining whether a finite-index subgroup of SL(2, Z) is a congruence subgroup, extending earlier work of Hsu for subgroups of PSL(2, Z).

This unpublished note is an alternate, shorter (and hopefully more readable) proof of the decidability of all minimal models. The decidability follows from a proof of the existence of a cellular term in each observational equivalence class…

We introduce system S^2_0E, a bounded arithmetic corresponding to Buss's S^2_0 with the predicate E which signifies the existence of the value. Then, we show that we can \Sigma^b_2-define truthness of S^2_0 E and therefore we can prove…

We study the notion of irreducibility of semigroup morphisms. Given an alphabet $\Sigma$, a morphism $\varphi:\Sigma^+\rightarrow\Sigma^+$ is irreducible if any factorisation $\varphi=\psi_2\circ\psi_1$ can only be satisfied if $\psi_1$ or…

Relation-changing modal logics are extensions of the basic modal logic that allow changes to the accessibility relation of a model during the evaluation of a formula. In particular, they are equipped with dynamic modalities that are able to…

A closed formula for the spectral determinant for the wave equation on a bounded interval, subject to Dirichlet boundary conditions and an $\alpha$-multiple of the Dirac $\delta$-type damping, is derived. Depending on the choice of the…

All isometries $\sigma$ in a quadratic space over a non-archimedean local field of characteristic not 2 satisfying that any isometry $\tau$ which is conjugate to $\sigma$ in the general linear group is conjugate to $\sigma$ in the…

We show that the question whether a term is typable is decidable for type systems combining inclusion polymorphism with parametric polymorphism provided the type constructors are at most unary. To prove this result we first reduce the…

I describe a verifiable criterion for the solvability of the 2 by 2 spectral Nevanlinna-Pick problem with two interpolation points, and likewise for three other special cases of the mu-synthesis problem. The problem is to construct an…

We design hypersequent calculus proof systems for the theories of Riesz spaces and modal Riesz spaces and prove the key theorems: soundness, completeness and cut elimination. These are then used to obtain completely syntactic proofs of some…

A typical kind of question in mathematical logic is that for the necessity of a certain axiom: Given a proof of some statement $\phi$ in some axiomatic system $T$, one looks for minimal subsystems of $T$ that allow deriving $\phi$. In…

Let $G$ be a locally graded group and suppose that every non-nilpotent subgroup of $G$ is permutable. We prove that $G$ is soluble. (In light of previous results of the authors, it suffices to prove that $G$ is soluble if it is periodic.

We determine the complex-valued solutions of the following functional equation \[f(xy)+\mu (y)f(\sigma (y)x) = 2f(x)g(y),\quad x,y\in S,\] where $S$ is a semigroup and $\sigma$ an automorphism, $\mu :S\rightarrow \mathbb{C}$ is a…

We prove decidability results on the existence of constant subsequences of uniformly recurrent morphic sequences along arithmetic progressions. We use spectral properties of the subshifts they generate to give a first algorithm deciding…

Let $A=(a_{ij})$ be an $n$-by-$n$ matrix. For any real number $\mu$, we define the polynomial $$P_\mu(A)=\sum_{\sigma\in S_n} a_{1\sigma(1)}\cdots a_{n\sigma(n)}\,\mu^{\ell(\sigma)}\; ,$$ as the $\mu$-permanent of $A$, where $\ell(\sigma)$…

We show that satisfiability for CTL* with equality-, order-, and modulo-constraints over Z is decidable. Previously, decidability was only known for certain fragments of CTL*, e.g., the existential and positive fragments and EF.

In this paper we consider propositional calculi, which are finitely axiomatizable extensions of intuitionistic implicational propositional calculus together with the rules of modus ponens and substitution. We give a proof of undecidability…

We consider the problem whether termination of affine integer loops is decidable. Since Tiwari conjectured decidability in 2004, only special cases have been solved. We complement this work by proving decidability for the case that the…