Related papers: Quantifier-free induction for lists

In this paper we develop cyclic proof systems for the problem of inclusion between the least sets of models of mutually recursive predicates, when the ground constraints in the inductive definitions belong to the quantifier-free fragments…

We introduce a modification of Voiculescu's free entropy which coincides with the liminf variant of Voiculescu's free entropy on extremal states, but is a concave upper semi-continuous function on the trace state space. We also extend the…

We introduce a model-complete theory which completely axiomatizes the structure $Z_{\alpha}=(Z, +, 0, 1, f)$ where $f : x \to \lfloor{\alpha} x \rfloor $ is a unary function with $\alpha$ a fixed transcendental number. When $\alpha$ is…

A cyclic proof system is a proof system whose proof figure is a tree with cycles. The cut-elimination in a proof system is fundamental. It is conjectured that the cut-elimination in the cyclic proof system for first-order logic with…

A novel class of derivative-free optimization algorithms is developed. The main idea is to utilize certain non-commutative maps in order to approximate the gradient of the objective function. Convergence properties of the novel algorithms…

Constructor rewriting systems are said to be cons-free if, roughly, constructor terms in the right-hand sides of rules are subterms of constructor terms in the left-hand side; the computational intuition is that rules cannot build new data…

In this paper I introduce a new and intuitive first-order foundational theory (where the concept of set is not primitive) and use it to show that the power set of an infinite set does not exist. In particular, proofs of uncountability of a…

In this paper, we introduce two focussed sequent calculi, LKp(T) and LK+(T), that are based on Miller-Liang's LKF system for polarised classical logic. The novelty is that those sequent calculi integrate the possibility to call a decision…

In this note we show that there exist a $2^\mathfrak{c}$-generated free algebra $\mathcal{S} \subset \mathbb{R}^\mathbb{R}$ of Riemann integrable functions and a free algebra $\mathcal{C} \subset \mathbb{R}^{[0,1]}$ of continuous functions,…

We derive the monotonicity of the quantum relative entropy by an elementary operational argument based on Stein's lemma in quantum hypothesis testing. For the latter we present an elementary and short proof that requires the law of large…

In various situations one is given only the predictions of multiple classifiers over a large unlabeled test data. This scenario raises the following questions: Without any labeled data and without any a-priori knowledge about the…

In the impredicative type theory of System F ({\lambda}2), it is possible to create inductive data types, such as natural numbers and lists. It is also possible to create coinductive data types such as streams. They work well in the sense…

Given a set of integers with no three in arithmetic progression, we construct a Stanley sequence by adding integers greedily so that no arithmetic progression is formed. This paper offers two main contributions to the theory of Stanley…

An integer additive set-indexer is defined as an injective function $f:V(G)\rightarrow 2^{\mathbb{N}_0}$ such that the induced function $g_f:E(G) \rightarrow 2^{\mathbb{N}_0}$ defined by $g_f (uv) = f(u)+ f(v)$ is also injective. An integer…

Using dynamical techniques we show that there are no isolated elements on the space of left-preorders on a free product of two groups. As a consequence, when the groups are finitely generated, this space is either empty or a Cantor set. For…

We derive a formula for expressing free cumulants whose entries are products of random variables in terms of the lattice structure of non-crossing partitions. We show the usefulness of that result by giving direct and conceptually simple…

The development of statistical methods for valid and efficient probabilistic inference without prior distributions has a long history. Fisher's fiducial inference is perhaps the most famous of these attempts. We argue that, despite its…

In this paper, we extend the notion of microstate free entropy to the bi-free setting. In particular, using the bi-free analogue of random matrices, microstate bi-free entropy is defined. Properties essential to an entropy theory are…

We show how the existence of various free vector lattices and free vector lattice algebras can be derived from a theorem on equational classes in universal algebra. A discussion about free $f$-algebras over non-empty sets is given, where…

This paper is concerned with test of the conditional independence. We first establish an equivalence between the conditional independence and the mutual independence. Based on the equivalence, we propose an index to measure the conditional…