Related papers: Transfinite Recursion in Higher Reverse Mathematic…
We introduce an operational rewriting-based semantics for strictly positive nested higher-order (co)inductive types. The semantics takes into account the "limits" of infinite reduction sequences. This may be seen as a refinement and…
In this work we propose a formal system for fuzzy algebraic reasoning. The sequent calculus we define is based on two kinds of propositions, capturing equality and existence of terms as members of a fuzzy set. We provide a sound semantics…
We significantly strengthen and generalize the theorem lifting Nullstellensatz degree to monotone span program size by Pitassi and Robere (2018) so that it works for any gadget with high enough rank, in particular, for useful gadgets such…
We prove that the reflection equation (RE) algebra $\La_R$ associated with a finite dimensional representation of a quasitriangular Hopf algebra $\Ha$ is twist-equivalent to the corresponding Faddeev-Reshetikhin-Takhtajan (FRT) algebra. We…
We propose a novel approach to interactive theorem-proving (ITP) using deep reinforcement learning. The proposed framework is able to learn proof search strategies as well as tactic and arguments prediction in an end-to-end manner. We…
The principle $ADS$ asserts that every linear order on $\omega$ has an infinite ascending or descending sequence. This has been studied extensively in the reverse mathematics literature, beginning with the work of Hirschfeldt and Shore. We…
A systematic method is presented for the construction and classification of algebras of gauge transformations for arbitrary high rank tensor gauge fields. For every tensor gauge field of a given rank, the gauge transformation will be…
We generalize the notion of saturated order to infinite partial orders and give both a set-theoretic and an algebraic characterization of such orders. We then study the proof theoretic strength of the equivalence of these characterizations…
Motivated by obtaining a consistent mathematical description for the radiation reaction of point charged particles in linear classical electrodynamics, a theory of generalized higher order tensors and differential forms is introduced. The…
Recurrence equations have played a central role in static cost analysis, where they can be viewed as abstractions of programs and used to infer resource usage information without actually running the programs with concrete data. Such…
We describe various computational models based initially, but not exclusively, on that of the Turing machine, that are generalized to allow for transfinitely many computational steps. Variants of such machines are considered that have…
This paper provides a new, decidable definition of the higher- order recursive path ordering in which type comparisons are made only when needed, therefore eliminating the need for the computability clo- sure, and bound variables are…
We use the Fr\"olicher-Nijenhuis formalism to reformulate the inverse problem of the calculus of variations for a system of differential equations of order 2k in terms of a semi-basic 1-form of order k. Within this general context, we use…
We describe in this note a torsor structure arising on the affine scheme defined by a system of rationnal algebraic relations between polyzetas at roots of unity (values of hyperlogarithmic functions on a fixed finite group of complex roots…
Let $T^*$ be an almost Suslin tree, that is, an Aronszajn tree with no stationary antichains. Krueger introduced a forcing axiom, $\mathrm{PFA}(T^*)$, for the class of proper forcings that preserve that $T^*$ is almost Suslin. He showed…
Exploiting higher-order derivatives in convex optimization is known at least since 1970's. In each iteration higher-order (also called tensor) methods minimize a regularized Taylor expansion of the objective function, which leads to faster…
When improving results about generalized inverses, the aim often is to do this in the most general setting possible by eliminating superfluous assumptions and by simplifying some of the conditions in statements. In this paper, we use…
As is known, every finite-dimensional algebra over a field is isomorphic to the centralizer algebra of \textbf{two} matrices. So it is fundamental to study first the centralizer algebra of a single matrix, called a centralizer matrix…
We establish a polynomial recursion formula for linear Hodge integrals. It is obtained as the Laplace transform of the cut-and-join equation for the simple Hurwitz numbers. We show that the recursion recovers the Witten-Kontsevich theorem…
Iterative abstraction refinement techniques are one of the most prominent paradigms for the analysis and verification of systems with large or infinite state spaces. This paper investigates the changes of truth values of system properties…