相关论文: The Undecidability of Pattern Matching in Calculi …
Rice's theorem states that no non-trivial semantic property of programs is decidable. Classical proofs proceed by reduction from the halting problem, invoking the law of excluded middle (LEM) twice: once through diagonalization, and once…
The investigations on higher-order type theories and on the related notion of parametric polymorphism constitute the technical counterpart of the old foundational problem of the circularity (or impredicativity) of second and higher order…
We show that all--instances termination of chase is undecidable. More precisely, there is no algorithm deciding, for a given set $\cal T$ consisting of Tuple Generating Dependencies (a.k.a. Datalog$^\exists$ program), whether the $\cal…
We show that the bar recursion operators of Spector and Kohlenbach, considered as third-order functionals acting on total arguments, are not computable in Goedel's System T plus minimization, which we show to be equivalent to a programming…
Let $G$ be a finite group, $H$ be a normal subgroup of prime index $p$. Let $F$ be a field of either characteristic $0$ or prime to $|G|$. Let $\eta$ be an irreducible $F$-representation of $H$. If $F$ is an algebraically closed field of…
To prove that Hilbert's tenth problem over a ring R has a negative answer, usually the integers or another ring for which Hilbert's tenth problem has a negative solution is modelled inside the ring of interest. In this paper, we formalize…
The study of computability has its origin in Hilbert's conference of 1900, where an adjacent question, to the ones he asked, is to give a precise description of the notion of algorithm. In the search for a good definition arose three…
In this paper we first review the history of Hilbert's Tenth Problem, and then study mixed quantifier prefixes over Diophantine equations with integer variables. For example, we prove that $\forall^2\exists^4$ over $\mathbb Z$ is…
This article studies two notions of generalized matroid representations motivated by algorithmic information theory and cryptographic secret sharing. The first (entropic representability) involves discrete random variables, while the second…
It is known that the variety parametrizing pairs of commuting nilpotent matrices is irreducible and that this provides a proof of the irreducibility of the punctual Hilbert scheme in the plane. We extend this link to the nilpotent commuting…
In this paper the approach to obtaining nonrecurrent formulas for some recursively defined sequences is illustrated. The most interesting result in the paper is the formula for the solution of quadratic map-like recurrence. Also, some…
We present a finite algorithm for computing the set of irreducible unitary representations of a real reductive group G. The Langlands classification, as formulated by Knapp and Zuckerman, exhibits any representation with an invariant…
We point out a major flaw in the conformable calculus. We demonstrate why it fails at defining a fractional derivative and where exactly these tempting conformability properties come from.
The inverse problem for representation functions takes as input a triple (X,f,L), where X is a countable semigroup, f : X --> N_0 \cup {\infty} a function, L : a_1 x_1 + ... + a_h x_h an X-linear form and asks for a subset A \subseteq X…
In this paper we aim to show continuous differentiability of weak solutions to a one-Laplace system perturbed by $p$-Laplacian with $1<p<\infty$. The main difficulty on this equation is that uniform ellipticity breaks near a facet, the…
Pattern matching is a powerful tool which is part of many functional programming languages as well as computer algebra systems such as Mathematica. Among the existing systems, Mathematica offers the most expressive pattern matching.…
Multidimensional contractions of irreducible representations of the Cayley-Klein unitary algebras in the Gel'fand-Zetlin basis are considered. Contracted over different parameters, algebras can turn out to be isomorphic. In this case method…
One of the main open problems regarding decidability of the existential theory of rings is the analogue of Hilbert's Tenth Problem (HTP) for the ring of entire holomorphic functions in one variable. In the direction of a negative solution,…
This paper presents a theory of systemic undecidability, reframing incomputability as a structural property of systems rather than a localized feature of specific functions or problems. We define a notion of causal embedding and prove a…
We observe that the classification problem for countable models of arithmetic is Borel complete. On the other hand, the classification problems for finitely generated models of arithmetic and for recursively saturated models of arithmetic…