Related papers: Induction rules in bounded arithmetic

Even with impressive advances in automated formal methods, certain problems in system verification and synthesis remain challenging. Examples include the verification of quantitative properties of software involving constraints on timing…

We define a bi-directional embedding between hypersequent calculi and a subclass of systems of rules (2-systems). In addition to showing that the two proof frameworks have the same expressive power, the embedding allows for the recovery of…

We describe a Schubert induction theorem, a tool for analyzing intersections on a Grassmannian over an arbitrary base ring. The key ingredient in the proof is the Geometric Littlewood-Richardson rule, described in a companion paper.…

A central challenge in many areas of science and engineering is to identify model parameters that are consistent with prior knowledge and empirical data. Bayesian inference offers a principled framework for this task, but can be…

Let $\mathbb{F}_q[t]$ be the polynomial ring over the finite field $\mathbb{F}_{q}$. For arithmetic functions $\psi_{1}, \psi_{2}: \mathbb{F}_{q}[t]\rightarrow\mathbb{C}$, we establish that if a Bombieri-Vinogradov type equidistribution…

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…

The paper introduces a generalization for known probabilistic models such as log-linear and graphical models, called here multiplicative models. These models, that express probabilities via product of parameters are shown to capture…

Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent calculus involving induction and co-induction. These proof principles…

As models of cognition grow in complexity and number of parameters, Bayesian inference with standard methods can become intractable, especially when the data-generating model is of unknown analytic form. Recent advances in simulation-based…

For a given finite index inclusion of conformal nets $\mathcal{B}\subset \mathcal{A}$ and a group $G < \mathrm{Aut}(\mathcal{A}, \mathcal{B})$, we consider the induction and the restriction procedures for $G$-twisted representations. We…

The preferred-basis problem and the definite-outcome aspect of the measurement problem persist even when the detector is modeled unitarily. Experimental data are represented in a Boolean event algebra of mutually exclusive records, while…

In supervised learning, an inductive learning algorithm extracts general rules from observed training instances, then the rules are applied to test instances. We show that this splitting of training and application arises naturally, in the…

We consider a totally asymmetric exclusion process on the positive half-line. When particles enter in the system according to a Poisson source, Liggett has computed all the limit distributions when the initial distribution has an asymptotic…

The depth-bounded fragment of the pi-calculus is an expressive class of systems enjoying decidability of some important verification problems. Unfortunately membership of the fragment is undecidable. We propose a novel type system,…

I give an introduction to algorithmic uses of the principle of inclusion-exclusion. The presentation is intended to be be concrete and accessible, at the expense of generality and comprehensiveness.

We provide a scheme for inferring causal relations from uncontrolled statistical data based on tools from computational algebraic geometry, in particular, the computation of Groebner bases. We focus on causal structures containing just two…

By calculating the O(\alpha_s) corrections to inclusive heavy-to-light sum rules we find model independent upper and lower bounds on form factors for B to pi and B to rho. We use the bounds to rule out model predictions. Some models violate…

We derive the TBA system of equations from the S-matrix describing integrable massive perturbation of the coset $G_l \times G_m / G_{l+m}$ by the field $(1,1,adj)$ for all the infinite series of the simple Lie algebras $G=A,B,C,D$. In the…

This article studies some new insertion algorithms that associate pairs of shifted tableaux to finite integer sequences in which certain terms may be primed. When primes are ignored in the input word these algorithms reduce to known…

We study the algebras generated by restriction and induction operations on complex modules over dihedral groups. In the case where the orders of all dihedral groups involved are not divisible by four, we describe the relations, a basis, the…