Related papers: Existentially Definable Factor Congruences

We prove that for a finite first order structure $\mathbf{A}$ and a set of first order formulas $\Phi$ in its language with certain closure properties, the finitary relations on $A$ that are definable via formulas in $\Phi$ are uniquely…

Recently, in Axioms 10(2): 119 (2021), a nonclassical first-order theory T of sets and functions has been introduced as the collection of axioms we have to accept if we want a foundational theory for (all of) mathematics that is not weaker…

We show that cluster algebras do not contain non-trivial units and that all cluster variables are irreducible elements. Both statements follow from Fomin and Zelevinsky's Laurent phenomenon. As an application we give a criterion for a…

We systematically investigate the complexity of model checking the existential positive fragment of first-order logic. In particular, for a set of existential positive sentences, we consider model checking where the sentence is restricted…

A.V.Arkhangel'skii asked in 1981 if the variety $\mathfrak V$ of topological groups generated by free topological groups on metrizable spaces coincides with the class of all topological groups. We show that if there exists a real-valued…

We study the question of whether a given regular language of finite trees can be defined in first-order logic. We develop an algebraic approach to address this question and we use it to derive several necessary and sufficient conditions for…

A qualitative representation $\phi$ is like an ordinary representation of a relation algebra, but instead of requiring $(a; b)^\phi = a^\phi | b^\phi$, as we do for ordinary representations, we only require that $c^\phi\supseteq a^\phi |…

Diekert, Matiyasevich and Muscholl proved that the existential first-order theory of a trace monoid over a finite alphabet is decidable. We extend this result to a natural class of trace monoids with infinitely many generators. As an…

We introduce the notions of definable amenability and extreme definable amenability for groups in continuous structures and conduct an extensive analysis of them, drawing parallels with the classical first-order case. We characterize both…

For a pair $(f, g)$ of morphisms $f:X \to Z$ and $g:Y \to Z$ of (possibly singular) complex algebraic varieties $X,Y,Z$, we present congruence formulae for the difference $f_*T_{y*}(X) -g_*T_{y*}(Y)$ of pushforwards of the corresponding…

The assertion that every definable set has a definable element is equivalent over ZF to the principle $V=\text{HOD}$, and indeed, we prove, so is the assertion merely that every $\Pi_2$-definable set has an ordinal-definable element.…

For any subgroup H of Out(F_n), either H has a finite index subgroup that fixes the conjugacy class of some proper, nontrivial free factor of F_n, or H contains a fully irreducible element phi, meaning that no positive power of phi fixes…

If the $n-th$ order differential equation is not exact, under certain conditions, an integrating factor exists which transforms the differential equation into an exact one. Hence, its order can be reduced to the lower order. In this paper,…

These notes form part of a joint research project on the logic of fields with many valuations, connected by a product formula. We define such structures and name them {\em globally valued fields} (GVFs). This text aims primarily at a proof…

Uniqueness quantification ($\exists !$) is a quantifier in first-order logic where one requires that exactly one element exists satisfying a given property. In this paper we investigate the strength of uniqueness quantification when it is…

We carry out a detailed investigation of congruence half-factorial Krull monoids with finite cyclic class group and related problems. Specifically, we determine precisely all relatively large values that can occur as a minimal distance of a…

The partition function is known to exhibit beautiful congruences that are often proved using the theory of modular forms. In this paper, we study the extent to which these congruence results apply to the generalized Frobenius partitions…

Let $G$ be a graph with order $n$ and let $g, f : V (G)\rightarrow N$ such that $g(v)\leq f(v)$ for all $v\in V(G)$. We say that $G$ has all fractional $(g, f)$-factors if $G$ has a fractional $p$-factor for every $p: V (G)\rightarrow N$…

In this article we study congruences of lines in $\mathbb{P}^n$, and in particular of order one. After giving general results, we obtain a complete classification in the case of $\mathbb{P}^4$ in which the fundamental surface $F$ is in fact…

Validation is a major challenge in differentiable programming. The state of the art is based on algorithmic differentiation. Consistency of first-order tangent and adjoint programs is defined by a well-known first-order differential…