Related papers: Generalized Decidability via Brouwer Trees
We consider the problem of characterizing isomorphisms of types, or, equivalently, constructive cardinality of sets, in the simultaneous presence of disjoint unions, Cartesian products, and exponentials. Mostly relying on results about…
Standard methods of using categorical variables as predictors either endow them with an ordinal structure or assume they have no structure at all. However, categorical variables often possess structure that is more complicated than a linear…
We initiate the effective metric structure theory of Keisler randomizations. We show that a classical countable structure $\mathcal{M}$ has a decidable presentation if and only if its Borel randomization $\mathcal{M}^{[0,1)}$ has a…
Brouwer (1927) claimed that every function from the Baire space to natural numbers is induced by a neighbourhood function whose domain admits bar induction. We show that Brouwer's claim is provable in Heyting arithmetic in all finite types…
An algebraic structure is said to be congruence permutable if its arbitrary congruences $\alpha$ and $\beta$ satisfy the equation $\alpha \circ \beta =\beta \circ \alpha$, where $\circ$ denotes the usual composition of binary relations. For…
In this paper, a computably definable predicate is defined and characterized. Then, it is proved that every separable infinite-dimensional Hilbert structure in an effectively presented language is computable. Moreover, every definable…
Through careful analysis of types inspired by [AGTW21] we characterize a notion of definable compactness for definable topologies in general o-minimal structures, generalizing results from [PP07] about closed and bounded definable sets in…
A conjecture in algorithmic model theory predicts that the model-checking problem for first-order logic is fixed-parameter tractable on a hereditary graph class if and only if the class is monadically dependent. Originating in model theory,…
Consider the semialgebraic structure over the real field. More generally, let an ominimal structure be over a real closed field. We show that a definable metric space X with a definable metric d is embedded into a Euclidean space so that…
Let F = F_p for any fixed prime p >= 2. An affine-invariant property is a property of functions on F^n that is closed under taking affine transformations of the domain. We prove that all affine-invariant property having local…
Recently, symbolic structures were proposed as finite representations of potentially infinite first-order structures, where Linear Integer Arithmetic terms and formulas define the domain and interpretations of a structure. We generalize…
We prove some new properties of fidelity (transition probability) and concurrence, the latter defined by straightforward extension of Wootters notation. Choose a conjugation and consider the dependence of fidelity or of concurrence on…
We analyze the BGG Category $\mathcal{O}$ over a large class of generalized Weyl algebras (henceforth termed GWAs). Given such a "triangular" GWA for which Category $\mathcal{O}$ decomposes into a direct sum of subcategories, we study in…
Regular tree grammars and regular path expressions constitute core constructs widely used in programming languages and type systems. Nevertheless, there has been little research so far on reasoning frameworks for path expressions where node…
Given a simplicial pair $(X,A)$, a simplicial complex $Y$, and a map $f:A \to Y$, does $f$ have an extension to $X$? We show that for a fixed $Y$, this question is algorithmically decidable for all $X$, $A$, and $f$ if $Y$ has the rational…
Recently it was shown that it is undecidable whether a term rewrite system can be proved terminating by a polynomial interpretation in the natural numbers. In this paper we show that this is also the case when restricting the…
Let A be an associative algebra over a field, and let M be a finite family of right A-modules. Study of the noncommutative deformation functor of the family M leads to the construction of the algebra of observables and the Generalized…
Decision procedures can be either theory-specific, e.g., Presburger arithmetic, or theory-generic, applying to an infinite number of user-definable theories. Variant satisfiability is a theory-generic procedure for quantifier-free…
For ungraded quotients of an arbitrary $\mathbb{Z}$-graded ring, we define the general PBW property, that covers the classical PBW property and the $N$-type PBW property studied via the $N$-Koszulity by several authors ([BG1], BG2], [FV]).…
It is proved that epimorphisms are surjective in a range of varieties of residuated structures, including all varieties of Heyting or Brouwerian algebras of finite depth, and all varieties consisting of Goedel algebras, relative Stone…