Related papers: Many-one reducibility with realizability

Quasi-exactly solvable Rabi model is investigated within the framework of the Bargmann Hilbert space of analytic functions ${\cal B}$. On applying the theory of orthogonal polynomials, the eigenvalue equation and eigenfunctions are shown to…

We provide new bounds for the divisibility function of the free group F_2 and construct short laws for the symmetric groups Sym(n). The construction is random and relies on the classification of the finite simple groups. We also give bounds…

Let $\lambda =[d_1,\dots,d_r]$ be a partition of $d$. Consider the variety $\mathbb{X}_{2,\lambda} \subset \mathbb{P}^N$, $N={d+2 \choose 2}-1$, parameterizing forms $F\in k[x_0,x_1,x_2]_d$ which are the product of $r\geq 2$ forms…

The decision problem of membership in the Representation Class of Relation Algebras (RRA) for finite structures is undecidable. However, this does not hold for many Relation Algebra reduct languages. Two well known properties that are…

In this paper, we show that a partitioned formula \phi is dependent if and only if \phi has uniform definability of types over finite partial order indiscernibles. This generalizes our result from a previous paper [1]. We show this by…

Separation Logic is a widely used formalism for describing dynamically allocated linked data structures, such as lists, trees, etc. The decidability status of various fragments of the logic constitutes a long standing open problem. Current…

For a polynomial $f$ in two complex variables, we prove that the multi-link at infinity of the 0-fiber $f^{-1}(0)$ is a fibred multi-link if and only if all the values different from 0 are regular at infinity.

We present a proof of a result, previously announced by the second author, that there is a closed (even $\Pi^0_1$) set generating an $F_\sigma$ (even $\Sigma^0_2$) maximal cofinitary group (short, mcg) which is isomorphic to a free group.…

The central result of this paper is the small-is-very-small principle for restricted sequential theories. The principle says roughly that whenever the given theory shows that a property has a small witness, i.e. a witness in every definable…

Model checking properties are often described by means of finite automata. Any particular such automaton divides the set of infinite trees into finitely many classes, according to which state has an infinite run. Building the full type…

For fragments L of first-order logic (FO) with counting quantifiers, we consider the definability problem, which asks whether a given L-formula can be equivalently expressed by a formula in some fragment of L without counting, and the more…

We show that including degrees of a particular kind of provability in the search target for any theorem-prover in sufficiently powerful formal systems over finite-sized statements preserves well-definition and a sufficient consistency while…

We build a new spectrum of recursive models (SRM(T)) of a strongly minimal theory. This theory is non-disintegrated, flat, model complete, and in a language with a finite signature.

We introduce the notion of finitary computable reducibility on equivalence relations on the natural numbers. This is a weakening of the usual notion of computable reducibility, and we show it to be distinct in several ways. In particular,…

Swan (Pacific J. Math. 12(3) (1962), 1099-1106) characterized the parity of the number of irreducible factors of trinomials over $F_2$. Many researchers have recently obtained Swan-like results on determining the reducibility of polynomials…

The problem of determining whether a probabilistic program terminates almost surely (i.e.~with probability one) is undecidable, and actually $\Pi^0_2$-complete. For this reason, a growing literature has explored classes of programs for…

We show that if there exists a countable Borel equivalence relation which is hyper-hyperfinite but not hyperfinite then the complexity of hyperfinite countable Borel equivalence relations is as high as possible, namely,…

We consider a dynamic extension of the description logic $\mathcal{SROIQ}$. This means that interpretations could evolve thanks to some actions such as addition and/or deletion of an element (respectively, a pair of elements) of a concept…

Let L be a finite-dimensional Lie algebra over a field of non-zero characteristic. By a theorem of Jacobson, L has a finite-dimensional faithful module which is completely reducible. We show that if the field is not algebraically closed,…

Let f(t,X) be an irreducible polynomial over the field of rational functions k(t), where k is a number field. Let O be the ring of integers of k. Hilbert's irreducibility theorem gives infinitely many integral specializations of t to values…