Related papers: Undecidability of $\mathbb Q^{(2)}$
In this paper, we give a complete classification of extensions of finite irreducible conformal modules over rank two Lie conformal algebras.
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…
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…
It is proved that the first-order theory of the structure (N,mod) is undecidable. Here mod denotes the operation of computing the remainder for any division between positive integers; i.e. x mod y is the remainder obtained by the division x…
An infinite binary sequence A is absolutely undecidable if it is impossible to compute A on a set of positions of positive upper density. Absolute undecidability is a weakening of bi-immunity. Downey, Jockusch and Schupp asked whether,…
We prove two (strong) undefinability results for logics based on inquisitive semantics (or its variant, team semantics). Namely: 1) we show the undefinability of intuitionistic implication in extended propositional inquisitive logic with…
We consider the quantum algebra $U_q(\mathfrak{sl}_2)$ with $q$ not a root of unity. We describe the finite-dimensional irreducible $U_q(\mathfrak{sl}_2)$-modules from the point of view of the equitable presentation.
This article deals with the second order linear differential equations with entire coefficients. We prove some results involving conditions on coefficients so that the order of growth of every non-trivial solution is infinite.
We give an upper bound for the norm of the determinant of additively indecomposable, totally positive definite quadratic forms defined over the ring of integers of totally real number fields. We apply these results to find lower and upper…
It is shown that the universal theory of the free pseudocomplemented distributive lattice is decidable and a recursive axiomatization is presented. This contrasts with the case of the full elementary theory of the finitely generated free…
We outline a proof of the categorical geometric Langlands conjecture for GL(2), as formulated in reference [AG], modulo a number of more tractable statements that we call Quasi-Theorems.
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 point out that some questions in quantum field theory are undecidable in a precise mathematical sense. More concretely, it will be demonstrated that there is no algorithm answering whether a given 2d supersymmetric Lagrangian theory…
Every irreducible finite-dimensional representation of the quantized enveloping algebra U_q(gl_n) can be extended to the corresponding quantum affine algebra via the evaluation homomorphism. We give in explicit form the necessary and…
We construct an existentially undecidable complete discretely valued field of mixed characteristic with existentially decidable residue field and decidable algebraic part, answering a question by Anscombe-Fehm in a strong way. Along the…
We show that the domino problem is undecidable on orbit graphs of non-deterministic substitutions which satisfy a technical property. As an application, we prove that the domino problem is undecidable for the fundamental group of any closed…
The rational invariants of the SL_2(q)-invariant quadratic forms on the real irreducible representations are determined. There is still one open question (see Remark 6.5) if q is an even square.
We prove a conjecture of the first author for $GL_2(F)$, where $F$ is a finite extension of $Q_p$.
We present a theorem about irreducibility of a polynomial that is the resultant of two others polynomials. The proof of this fact is based on the field theory. We also consider the converse theorem and some examples.
For any sufficiently strong theory of arithmetic, the set of Diophantine equations provably unsolvable in the theory is algorithmically undecidable, as a consequence of the MRDP theorem. In contrast, we show decidability of Diophantine…