Related papers: $\Sigma^{\mu}_2$ is decidable for $\Pi^{\mu}_2$
This paper presents a logical approach to the translation of functional calculi into concurrent process calculi. The starting point is a type system for the {\pi}-calculus closely related to linear logic. Decompositions of intuitionistic…
We record $$ \binom{42}2+\binom{23}2+\binom{13}2=1192 $$ functional identities that, apart from being amazingly amusing by themselves, find applications in derivation of Ramanujan-type formulas for $1/\pi$ and in computation of mathematical…
A very explicit analytic formula of the separability criterion of two-party Gaussian systems is given. This formula is compared to the past formulation of the separability criterion of continuous variables two-party Gaussian systems.
Given a composition of two commutative squares, one well-known pullback lemma says that if both squares are pullbacks, then their composition is also a pullback; another well-known pullback lemma says that if the composed square is a…
The fully enriched μ-calculus is the extension of the propositional μ-calculus with inverse programs, graded modalities, and nominals. While satisfiability in several expressive fragments of the fully enriched μ-calculus is known…
An integral of a group $G$ is a group $H$ whose commutator subgroup is isomorphic to $G$. In this paper, we prove that the integrability of a finite group is a decidable problem.
Building on our previous work on hybrid polyadic modal logic we identify modal logic equivalents for Matching Logic, a logic for program specification and verification. This provides a rigorous way to transfer results between the two…
Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…
We give elementary proofs for the Apagodu-Zeilberger-Stanton-Amdeberhan-Tauraso congruences $$\sum\limits_{n=0}^{p-1}\dbinom{2n}{n} \equiv\eta_{p}\mod p^{2},$$ $$\sum\limits_{n=0}^{rp-1}\dbinom{2n}{n}…
A compact expression for the DeWitt-Schwinger renormalization terms suitable for use in even-dimensional space-times is derived. This formula should be useful for calculations of $<\phi^2(x)>$ and $<T_{\mu\nu}(x)>$ in even dimensions.
The square-free word problem relative to a system of two defining relations is decidable.
We prove that if $G$ is finite 2-generated $p$-group of nilpotence class at most 2 then the group algebra of $G$ with coefficients in the field with $p$ elements determines $G$ up to isomorphisms.
Commensurable groups are bi-interpretable, under suitable definability conditions.
Propositional logics in general, considered as a set of sentences, can be undecidable even if they have "nice" representations, e.g., are given by a calculus. Even decidable propositional logics can be computationally complex (e.g., already…
Exact canonically conjugate momenta Pi_{2mu} in quadrupole nuclear collective motions are proposed. The basic idea lies in the introduction of a discrete integral equation for the strict definition of canonically conjugate momenta to…
Undecidability of various properties of first order term rewriting systems is well-known. An undecidable property can be classified by the complexity of the formula defining it. This gives rise to a hierarchy of distinct levels of…
We prove undecidability and pinpoint the place in the arithmetical hierarchy for commutative action logic, that is, the equational theory of commutative residuated Kleene lattices (action lattices), and infinitary commutative action logic,…
Morrill and Valentin in the paper "Computational coverage of TLG: Nonlinearity" considered an extension of the Lambek calculus enriched by a so-called "exponential" modality. This modality behaves in the "relevant" style, that is, it allows…
We study the strength of set-theoretic axioms needed to prove Rabin's theorem on the decidability of the MSO theory of the infinite binary tree. We first show that the complementation theorem for tree automata, which forms the technical…
Let exp(x) be the function determined by the classical power series of the exponentiation. Then E_p(x):=exp(px) is well-defined on Zp, the ring of p-adic integer (for p not equal to 2, we set E_2(x)=exp(4x)). Furthermore, E_p determines a…