Related papers: Weak mu-equality is decidable
The paper studies a cluster of systems for fully disquotational truth based on the restriction of initial sequents. Unlike well-known alternative approaches, such systems display both a simple and intuitive model theory and remarkable…
A weakly admissible mesh (WAM) on a continuum real-valued domain is a sequence of discrete grids such that the discrete maximum norm of polynomials on the grid is comparable to the supremum norm of polynomials on the domain. The asymptotic…
Machine learning researchers and practitioners steadily enlarge the multitude of successful learning models. They achieve this through in-depth theoretical analyses and experiential heuristics. However, there is no known general-purpose…
We prove that the equality problem is decidable for rational subsets of the monogenic free inverse monoid $F$. It is also decidable whether or not a rational subset of $F$ is recognizable. We prove that a submonoid of $F$ is rational if and…
Let A be a finite dimensional unital associative algebra over a field K, which is also equipped with a coassociative counital coalgebra structure (\Delta,\eps). A is called a Weak Bialgebra if the coproduct \Delta is multiplicative. We do…
The monadic theory of $(\mathbb R,\le)$ with quantification restricted to Borel sets is decidable. The Boolean combinations of $F_\sigma$ sets form an elementary substructure of the Borel sets. Under determinacy hypotheses, the proof…
Let $\mathbf{A}$ be a finite algebra generating a finitely decidable variety and having nontrivial strongly solvable radical $\tau$. We provide an improved bound on the number of variables in which a term can be sensitive to changes within…
If V is a finitely generated variety such that the first-order theory of the finite members of V is decidable, we show that V is residually finite, and in fact has a finite bound on the sizes of subdirectly irreducible algebras. This result…
The aim of this paper is to gain a better understanding of weak and strong positivity for exterior forms on complex vector spaces. We prove a dimensionality reduction argument for positive forms, which allows us to restrict to the case of…
The classical decision problem, as it is understood today, is the quest for a delineation between the decidable and the undecidable parts of first-order logic based on elegant syntactic criteria. In this paper, we treat the concept of…
One may formulate the dependent product types of Martin-L\"of type theory either in terms of abstraction and application operators like those for the lambda-calculus; or in terms of introduction and elimination rules like those for the…
We study a weakly coupled supercritical elliptic system of the form \begin{equation*} \begin{cases} -\Delta u = |x_2|^\gamma \left(\mu_{1}|u|^{p-2}u+\lambda\alpha |u|^{\alpha-2}|v|^{\beta}u \right) & \text{in }\Omega,\\ -\Delta v =…
Using full images of accessible functors, we prove some results about combinatorial and accessible model categories. In particular, we give an example of a weak factorization system on a locally presentable category which is not accessible.
The simplicial extension of any functor from Sets to Sets which commutes with directed colimits takes weak equivalences to weak equivalences. The goal of the present paper is construct a framework which can be used to proof results of this…
We develop a notion of cell decomposition suitable for studying weak p- adic structures (reducts of p-adic fields where addition and multiplication are not (everywhere) definable). As an example, we apply this to a language with restricted…
The subcube partition model of computation is at least as powerful as decision trees but no separation between these models was known. We show that there exists a function whose deterministic subcube partition complexity is asymptotically…
Dependently typed proof assistant rely crucially on definitional equality, which relates types and terms that are automatically identified in the underlying type theory. This paper extends type theory with definitional functor laws,…
As a unification of increasing trees and plane trees, the weakly increasing trees labeled by a multiset was introduced by Lin-Ma-Ma-Zhou in 2021. Motived by some symmetries in plane trees proved recently by Dong, Du, Ji and Zhang, we…
Analysis of cryptographic protocols in a symbolic model is relative to a deduction system that models the possible actions of an attacker regarding an execution of this protocol. We present in this paper a transformation algorithm for such…
Ranking theories according to their strength is a recurring motif in mathematical logic. We introduce a new ranking of arbitrary (not necessarily recursively axiomatized) theories in terms of the encoding power of their $\beta$-models:…