Related papers: Godel Implication on Finite Chains: Truth Tables a…

Let $\mathcal{M}$ be a pure motive over $\mathbb{Q}$ of odd weight $w\geq 3$, even rank $d\geq 2$, and global conductor $N$ whose $L$-function $L(s,\mathcal{M})$ coincides with the $L$-function of a self-dual algebraic tempered cuspidal…

We give a complete classification of analytic equivalence of germs of parametric families of systems of complex linear differential equations unfolding a generic resonant singularity of Poincare rank 1 in dimension $n = 2$ whose leading…

Getting language models to reason correctly about code requires training on data where each reasoning step can be checked. Current synthetic Chain-of-Thought (CoT) training data often consists of plausible-sounding explanations generated by…

We study nested conditions, a generalization of first-order logic to a categorical setting, and provide a tableau-based (semi-decision) procedure for checking (un)satisfiability and finite model generation. This generalizes earlier results…

We continue our reformulation of free dendriform algebras, dealing this time with the free dendriform trialgebra generated be Y over planar rooted trees. We propose a 'deformation' of a vectorial coding used in Part I, giving a LL-lattice…

Let K be an algebraically closed field. For a finitely generated graded K algebra R, let cmdef R := dim R - depth R denote the Cohen-Macaulay-defect of R. Let G be a linear algebraic group over K that is reductive but not linearly…

We prove that the congruence on the tropical rational function semifield in $n$-variables associated with a subset $V$ of $\boldsymbol{R}^n$ is finitely generated if and only if the closure of $V$ is a finite union of…

We study a recursion that generates real sequences depending on a parameter $x$. Given a negative $x$ the growth of the sequence is very difficult to estimate due to canceling terms. We reduce the study of the recursion to a problem about a…

We study influence of ordinal transformations on results of queries in rank-aware databases which derive their operations with ranked relations from totally ordered structures of scores with infima acting as aggregation functions. We…

We study the asymptotic number of certain monotonically labeled increasing trees arising from a generalized evolution process. The main difference between the presented model and the classical model of binary increasing trees is that the…

For a finite group G, we study the higher commuting probabilities, namely the probabilities that r randomly chosen elements of G commute pairwise, together with the corresponding numbers of simultaneous conjugacy classes of commuting…

We study preservation theorems for modal logics over finite structures with respect to three fundamental semantic relations: embeddings, injective homomorphisms, and homomorphisms. We focus on classes of pointed Kripke models that are…

This paper obtains a completeness result for inequational reasoning with applicative terms without variables in a setting where the intended semantic models are the full structures, the full type hierarchies over preorders for the base…

We provide a detailed development of a function valued inner product known as the bracket product and used effectively by de Boor, Devore, Ron and Shen to study translation invariant systems. We develop a version of the bracket product…

We consider the problem of deciding the satisfiability of quantifier-free formulas in the theory of finite sets with cardinality constraints. Sets are a common high-level data structure used in programming; thus, such a theory is useful for…

Regarding non-unique factorization of integer-valued polynomials over a discrete valuation domain $(R,M)$ with finite residue field, it is known that there exist absolutely irreducible elements, that is, irreducible elements all of whose…

Given n polynomials in n variables with a finite number of complex roots, for any of their roots there is a local residue operator assigning a complex number to any polynomial. This is an algebraic, but generally not rational, function of…

The key to the proof-theoretic study of a logic is a proof calculus with a subformula property. Many different proof formalisms have been introduced (e.g. sequent, nested sequent, labelled sequent formalisms) in order to provide such…

We introduce a framework for constructing fractal trees via analytic generator fields, replacing discrete affine transformations and symbolic rewriting rules by the integration of smooth vector fields in an internal state space. In this…

We examine the behavior of the coefficients of powers of polynomials over a finite field of prime order. Extending the work of Allouche-Berthe, 1997, we study a(n), the number of occurring strings of length n among coefficients of any power…