Related papers: The Undecidability of Unification Modulo $\sigma$ …
We describe $\sigma$-matching, interchangeable and, as a consequence, totally compatible structures on the strictly upper triangular matrix algebra $UT_n(K)$ for all $n\ge 3$.
We generalize the classical definition of effectively closed subshift to finitely generated groups. We study classical stability properties of this class and then extend this notion by allowing the usage of an oracle to the word problem of…
Proof schemata are infinite sequences of proofs which are defined inductively. In this paper we present a general framework for schemata of terms, formulas and unifiers and define a resolution calculus for schemata of quantifier-free…
In our article in MCU'2013 we state the the Domino problem is undecidable for all Baumslag-Solitar groups $BS(m,n)$, and claim that the proof is a direct adaptation of the construction of a weakly aperiodic subshift of finite type for…
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,…
Consider a finite-dimensional algebra $A$ and any of its moduli spaces $\mathcal{M}(A,\mathbf{d})^{ss}_{\theta}$ of representations. We prove a decomposition theorem which relates any irreducible component of…
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…
We give a precise, computable formula for comparing $\lambda$-invariants between modular forms in the anticyclotomic indefinite setting where the Selmer groups have positive rank. This is an improvement of Hatley-Lei \cite{HL19, HL21} where…
We prove undecidability for every positive relevant logic extending the system axiomatized by hypothetical syllogism, prefixing, and suffixing and contained in the logic of the semilattice frame $(P_{\mathrm{fin}}(\mathbb{N}), \cup,…
A formal series in noncommuting variables $\Sigma$ over the rationals is a mapping $\Sigma^* \to \mathbb Q$. We say that a series is commutative if the value in the output does not depend on the order of the symbols in the input. The…
We give an arithmetical proof of the strong normalization of the $\lambda$-calculus (and also of the $\lambda\mu$-calculus) where the type system is the one of simple types with recursive equations on types. The proof using candidates of…
Basic modules of McLain groups $M=M(\Lambda,\leq, R)$ are defined and investigated. These are (possibly infinite dimensional) analogues of Andr\'e's supercharacters of $U_n(q)$. The ring $R$ need not be finite or commutative and the field…
Nominal unification calculates substitutions that make terms involving binders equal modulo alpha-equivalence. Although nominal unification can be seen as equivalent to Miller's higher-order pattern unification, it has properties, such as…
Given any collection F of computable functions over the reals, we show that there exists an algorithm that, given any L_F-sentence \varphi containing only bounded quantifiers, and any positive rational number \delta, decides either "\varphi…
This paper presents a new refutation procedure for multimodular systems of integer constraints that commonly arise when verifying cryptographic protocols. These systems, involving polynomial equalities and disequalities modulo different…
Let M be an arbitrary Riemannian homogeneous space, and let Omega be a space of tilings of M, with finite local complexity (relative to some symmetry group Gamma) and closed in the natural topology. Then Omega is the inverse limit of a…
In reactive synthesis, the goal is to automatically generate an implementation from a specification of the reactive and non-terminating input/output behaviours of a system. Specifications are usually modelled as logical formulae or automata…
A rewriting system is a set of equations over a given set of terms called rules that characterize a system of computation and is a powerful general method for providing decision procedures of equational theories, based upon the principle of…
Let $G= SL_{n+1}$ be defined over an algebraically closed field of characteristic $p > 2$. For each $n \geq 1$ there exists a singular block in the category of $G_1$-modules which contains precisely $n+1$ irreducible modules. We are…
The lambda calculus is a widely accepted computational model of higher-order functional pro- grams, yet there is not any direct and universally accepted cost model for it. As a consequence, the computational difficulty of reducing lambda…