English
Related papers

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

200 papers

In this paper we demonstrate decidability for the intuitionistic modal logic S4 first formulated by Fischer Servi. This solves a problem that has been open for almost thirty years since it had been posed in Simpson's PhD thesis in 1994. We…

Logic in Computer Science · Computer Science 2023-08-01 Marianna Girlando , Roman Kuznets , Sonia Marin , Marianela Morales , Lutz Straßburger

Making use of Chebyshev polynomials, we obtain upper bound estimate for the second Hankel determinant of a subclass $\mathcal{N}_{\sigma }^{\mu}\left( \lambda ,t\right) $ of bi-univalent function class $\sigma.$

Complex Variables · Mathematics 2017-11-21 H. Orhan , N. Magesh , V. K. Balaji

In terms of the operator method, we prove two conjectural series for $\pi$ of Sun involving harmonic numbers of order two. Furthermore, we also give $q$-analogues of six $\pi$-formulas including the two ones just mentioned.

Number Theory · Mathematics 2023-10-09 Chuanan Wei

This paper revisits the well-established relationship between the modal mu calculus and parity games to show that it is even more robust than previously known. It addresses the question of whether the descriptive complexity of modal mu…

Logic in Computer Science · Computer Science 2017-09-08 Karoliina Lehtinen

A decomposition of any symmetric power of $\Bbb C^2\otimes\Bbb C^2\otimes\Bbb C^2$ into irreducible $sl_2(\Bbb C)\oplus sl_2(\Bbb C)\oplus sl_2(\Bbb C)$-submodules are presented. Namely, the multiplicities of irreducible summands in the…

Rings and Algebras · Mathematics 2012-02-23 Bin Li

Senizergues has proved that language equivalence is decidable for disjoint epsilon-deterministic PDA. Stirling has showed that strong bisimilarity is decidable for PDA. On the negative side Srba demonstrated that the weak bisimilarity is…

Logic in Computer Science · Computer Science 2014-04-29 Yuxi Fu , Qiang Yin

Adding modular predicates yields a generalization of first-order logic FO over words. The expressive power of FO[<,MOD] with order comparison $x<y$ and predicates for $x \equiv i \mod n$ has been investigated by Barrington, Compton,…

Formal Languages and Automata Theory · Computer Science 2014-07-02 Manfred Kufleitner , Tobias Walter

We prove a determinant formula for a parabolic Verma module of a Lie superalgebra, previously conjectured by the second author. Our determinant formula generalizes the previous results of Jantzen for a parabolic Verma module of a…

Representation Theory · Mathematics 2017-12-12 Yoshiki Oshima , Masahito Yamazaki

We consider decision problems for relations over finite and infinite words defined by finite automata. We prove that the equivalence problem for binary deterministic rational relations over infinite words is undecidable in contrast to the…

Formal Languages and Automata Theory · Computer Science 2023-06-22 Christof Löding , Christopher Spinrath

Consider a linear ordering equipped with a finite sequence of monadic predicates. If the ordering contains an interval of order type \omega or -\omega, and the monadic second-order theory of the combined structure is decidable, there exists…

Logic in Computer Science · Computer Science 2015-07-01 Alexis Bes , Alexander Rabinovich

A topological space $A$ is said to be compatible with a set $\Sigma$ of equations (involving operation symbols $F_t$) iff there are continuous operations $\overline F_t$ identically satisfying $\Sigma$ on $A$. The paper's main focus is on…

Rings and Algebras · Mathematics 2014-02-18 Walter Taylor

Let $R$ be a ring. $R$ is called a right countably $\Sigma$-C2 ring if every countable direct sum copies of $R_{R}$ is a C2 module. The following are equivalent for a ring $R$: (1) $R$ is a right countably $\Sigma$-C2 ring. (2) The column…

Rings and Algebras · Mathematics 2010-05-25 Liang Shen , Jianlong Chen

In this paper, the divisibility property of the type 2 $(p, q)$-analogue of the $r$-Whitney numbers of the second kind is established. More precisely, a congruence relation modulo $pq$ for this $(p,q)$-analogue is derived.

Combinatorics · Mathematics 2022-08-10 Roberto B. Corcino , Cristina B. Corcino

We prove that it is decidable if a finitely based permutation class contains infinitely many simple permutations, and establish an unavoidable substructure result for simple permutations: every sufficiently long simple permutation contains…

Combinatorics · Mathematics 2007-05-23 Robert Brignall , Nik Ruskuc , Vince Vatter

Classification is a central problem for dynamical systems, in particular for families that arise in a wide range of topics, like substitution subshifts. It is important to be able to distinguish whether two such subshifts are isomorphic,…

Dynamical Systems · Mathematics 2022-08-24 Fabien Durand , Julien Leroy

The divisor function $\sigma(n)$ denotes the sum of the divisors of the positive integer $n$. For a prime $p$ and $m \in \mathbb{N}$, the $p$-adic valuation of $m$ is the highest power of $p$ which divides $m$. Formulas for…

Number Theory · Mathematics 2020-07-08 Tewodros Amdeberhan , Victor H. Moll , Vaishavi Sharma , Diego Villamizar

It is easy to show that a pseudovariety which is reducible with respect to an implicit signature $\sigma$ for the equation $x=y$ can also be defined by $\sigma$-identities. We present several negative examples for the converse using…

Group Theory · Mathematics 2019-03-18 J. Almeida , O. Klíma

Electromagnetic field is considered in the framework of Clifford algebra $\C_2$ over a field of complex numbers. It is shown here that a modulo 2 periodicity of complex Clifford algebras may be connected with electromagnetic field.

High Energy Physics - Theory · Physics 2007-05-23 Vadim V. Varlamov

We prove a convergence theorem on the moduli space of constant $\sigma_{2}$ metrics for conic 4-spheres. We show that when a numerical condition is convergent to the boundary case, the geometry of conic 4-spheres converges to the boundary…

Differential Geometry · Mathematics 2021-03-24 Hao Fang , Wei Wei

In this paper, we introduce a hierarchy dividing the set $\{\sigma \in \Pi^1_2 : \Pi^1_1$-$\mathsf{CA}_0 \vdash \sigma\}$. Then, we give some characterizations of this set using weaker variants of some principles equivalent to…

Logic · Mathematics 2024-11-25 Yudai Suzuki , Keita Yokoyama