Related papers: Quantifier-free induction for lists

In this article we relate a family of methods for automated inductive theorem proving based on cycle detection in saturation-based provers to well-known theories of induction. To this end we introduce the notion of clause set cycles -- a…

This paper is devoted to study some expressions of the type $\prod_{p} p^{\lfloor\frac{x}{f(p)}\rfloor}$, where $x$ is a nonnegative real number, $f$ is an arithmetic function satisfying some conditions, and the product is over the primes…

Let $(M,\omega)$ be a connected symplectic manifold on which a connected Lie group $G$ acts properly and in a Hamiltonian fashion with moment map $\mu:M \lra \mf g^*$. Our purpose is investigate multiplicity-free actions, giving criteria to…

Extending the work of Freese and Cook, which develop the basic theory of calculus and power series over real associative algebras, we examine what can be said about the logarithmic functions over an algebra. In particular, we find that for…

Despite recent advances in automating theorem proving in full first-order theories, inductive reasoning still poses a serious challenge to state-of-the-art theorem provers. The reason for that is that in first-order logic induction requires…

Deciding formulas mixing arithmetic and uninterpreted predicates is of practical interest, notably for applications in verification. Some decision procedures consist in building by structural induction an automaton that recognizes the set…

We show that adding recursion does not increase the total functions definable in the typed $\lambda\beta\eta$-calculus or the partial functions definable in the $\lambda\Omega$-calculus. As a consequence, adding recursion does not increase…

We describe PromptBoosting, a query-efficient procedure for building a text classifier from a neural language model (LM) without access to the LM's parameters, gradients, or hidden representations. This form of "black-box" classifier…

A simplicial set is said to be non-singular if the representing map of each non-degenerate simplex is degreewise injective. The inclusion into the category of simplicial sets, of the full subcategory whose objects are the non-singular…

The main result of this article establishes the free analog of Grothendieck's Theorem on bijective polynomial mappings of $\mathbb{C}^g$. Namely, we show if $p$ is a polynomial mapping in $g$ freely non-commuting variables sending…

We show that induction over $\Delta(\mathbb R)$-definable well-founded classes is equivalent to the reflection principle which asserts that any true formula of first order set theory with real parameters holds in some transitive set. The…

We consider the problem of inserting a new item into an ordered list of N-1 items. The length of an algorithm is measured by the number of comparisons it makes between the new item and items already on the list. Classically, determining the…

Let p be prime number, K be a p-adically closed field, X $\subseteq$ K^m a semi-algebraic set defined over K and L(X) the lattice of semi-algebraic subsets of X which are closed in X. We prove that the complete theory of L(X) eliminates the…

We give a pedagogical introduction to integration techniques appropriate for non-commutative spaces while presenting some new results as well. A rather detailed discussion outlines the motivation for adopting the Hopf algebra language. We…

We prove that the Lie algebra of primitive elements of a graded and connected bialgebra, free as an associative algebra, over a eld of characteristic zero, is a free Lie algebra. The main tool is a ltration, which allows to embed the…

We provide a co-free construction which adds elementary structure to a primary doctrine. We show that the construction preserves comprehensions and all the logical operations which are in the starting doctrine, in the sense that it maps a…

Hamiltonian simulation is believed to be one of the first tasks where quantum computers can yield a quantum advantage. One of the most popular methods of Hamiltonian simulation is Trotterization, which makes use of the approximation…

A set $B$ is said to be \emph{sum-free} if there are no $x,y,z\in B$ with $x+y=z$. We show that there exists a constant $c>0$ such that any set $A$ of $n$ integers contains a sum-free subset $A'$ of size $|A'|\geqslant n/3+c\log \log n$.…

We present the concept of the \emph{information efficiency of functions} as a technique to understand the interaction between information and computation. Based on these results we identify a new class of objects that we call…

Class-Agnostic Counting (CAC) seeks to accurately count objects in a given image with only a few reference examples. While previous methods achieving this relied on additional training, recent efforts have shown that it's possible to…