Related papers: A simplified ordinal analysis of first-order refle…
We have looked at the evaluation of the Riemann Zeta function at odd arguments and have provided a simple formula to approximate the value with exponential convergence. We have compared it with various other formulae present in literature.…
From a theoretical view, this paper addresses the general problem of designing ordinal classification methods based on comparing actions with subset of actions, which are representative of their classes (categories). The basic demand of the…
This paper is concerned with spectral estimates for the first Dirichlet eigenvalue of the degenerate $p$-Laplace operator in bounded simply connected domains $\Omega \subset \mathbb C$. The proposed approach relies on the conformal analysis…
This paper describes the notion of \sigma -symmetry, which extends the one of \lambda-symmetry, and its application to reduction procedures of systems of ordinary differential equations and of dynamical systems as well. We also consider…
We present a framework for synthesising formulas in first-order logic (FOL) from examples, which unifies and advances state-of-the-art approaches for inference of transition system invariants. To do so, we study and categorise the existing…
Resolution and superposition are common techniques which have seen widespread use with propositional and first-order logic in modern theorem provers. In these cases, resolution proof production is a key feature of such tools; however, the…
An optical flow variational model is proposed for a sequence of images defined on a domain in $\mathbb{R}^2$. We introduce a regularization term given by the $L^1$ norm of a fractional differential operator. To solve the minimization…
In this paper we give an ordinal analysis of the theory of second order arithmetic. We do this by working with proof trees -- that is, "deductions" which may not be well-founded. Working in a suitable theory, we are able to represent…
In this paper we consider first-order logic theorem proving and model building via approximation and instantiation. Given a clause set we propose its approximation into a simplified clause set where satisfiability is decidable. The…
We obtain a simple formula for the first-order trace of a regular differential operator on a segment perturbated by a multiplication operator. The main analytic ingredient of the proof is an improvement of the Tamarkin equiconvergence…
In this article, intended for the Handbook of Recursion Theory, we survey recursion theory on the ordinal numbers, with sections devoted to $\alpha$-recursion theory, $\beta$-recursion theory and the study of the admissibility spectrum.
The notion of bounded expansion captures uniform sparsity of graph classes and renders various algorithmic problems that are hard in general tractable. In particular, the model-checking problem for first-order logic is fixed-parameter…
One clock alternating timed automata OCATA have been recently introduced as natural extension of (one clock) timed automata to express the semantics of MTL (Ouaknine, Worrell 2005). We consider the application of OCATA to problem of…
This note discusses proofs for convergence of first-order methods based on simple potential-function arguments. We cover methods like gradient descent (for both smooth and non-smooth settings), mirror descent, and some accelerated variants.
There are two major generalizations of the standard ordinal analysis: One is Girard's $\Pi^1_2$-proof theory in which dilators are assigned to theories instead of ordinals. The other is Pohlers' generalized ordinal analysis with Spector…
We describe a proof-theoretic bound on $Sigma_{2}$-definable countable ordinals in Kripke-Platek set theory with $Pi_{1}$-Collection and the existence of $omega_{1}$.
Ordinal regression is aimed at predicting an ordinal class label. In this paper, we consider its semi-supervised formulation, in which we have unlabeled data along with ordinal-labeled data to train an ordinal regressor. There are several…
A very simple first-order algorithm is proposed for solving nonlinear optimization problems with deterministic nonlinear equality constraints. This algorithm adaptively selects steps in the plane tangent to the constraints or steps that…
Many recent studies on first-order methods (FOMs) focus on \emph{composite non-convex non-smooth} optimization with linear and/or nonlinear function constraints. Upper (or worst-case) complexity bounds have been established for these…
A diagonal version of the strong reflection principle is introduced, along with fragments of this principle associated to arbitrary forcing classes. The relationships between the resulting principles and related principles, such as the…