Related papers: An Investigation of the Chung-Feller Theorem

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…

Suppose we have been sold on the idea that formalised proofs in an LCF system should resemble their written counterparts, and so consist of formulas that only provide signposts for a fully verified proof. To be practical, most of the fully…

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…

We prove Kontsevich's cyclic formality conjecture.

Let $Y$ admit a rectangular Lefschetz decomposition of its derived category, and consider a cyclic cover $X\to Y$ ramified over a divisor $Z$. In a setting not considered by Kuznetsov and Perry, we define a subcategory $\mathcal{A}_Z$ of…

The aim of this paper is to try to establish a generic model for the problem that several multivariable number-theoretic functions represent simultaneously primes for infinitely many integral points. More concretely, we introduced briefly…

We formulate the Hauptvermutung of Causal Set Theory in two mathematically well-defined but different ways one of which turns out to be wrong and the other one turns out to be true. A further result is that the Hauptvermutung is true if we…

Checking the soundness of cyclic induction reasoning for first-order logic with inductive definitions (FOLID) is decidable but the standard checking method is based on an exponential complement operation for B\"uchi automata. Recently, we…

We regard explanations as a blending of the input sample and the model's output and offer a few definitions that capture various desired properties of the function that generates these explanations. We study the links between these…

In this note we provide a quick proof of the Sklar's Theorem on the existence of copulas by using the generalized inverse functions as in the one dimensional case, but a little more sophisticated.

We review recent work that employs the framework of logical inference to establish a bridge between data gathered through experiments and their objective description in terms of human-made concepts. It is shown that logical inference…

A silting theorem was established by Buan and Zhou as a generalisation of the classical tilting theorem of Brenner and Butler. In this paper, we give an alternative proof of the theorem by using differential graded algebras.

In the paper based on the question of Zhang and L\"{u}[15], we present one theorem which will improve and extend the results of Banerjee-Majumder [2] and a recent result of Li-Huang [9].

Here we present ZFC theorems yielding the Halpern-L\a"uchli theorem and avoiding metamathematical notions in their formulations.

We provide an elementary proof of an asymptotic formula for prime counting functions. As a minor application we give a new reduction of the proof of Chebotar\"ev's density theorem to the cyclic case.

By means of the mathematical analysis theory, inequality theory, mathematical induction and the dimension reduction method, under the proper hypotheses, we establish the following cyclic inequalities: \[\sum_{i=1}^{n}…

The forcing theorem is the most fundamental result about set forcing, stating that the forcing relation for any set forcing is definable and that the truth lemma holds, that is everything that holds in a generic extension is forced by a…

We extend the original cylinder conjecture on point sets in affine three-dimensional space to the more general framework of divisible linear codes over $\mathbb{F}_q$ and their classification. Through a mix of linear programming,…

It is well known that for all $n\geq1$ the number $n+ 1$ is a divisor of the central binomial coefficient ${2n\choose n}$. Since the $n$th central binomial coefficient equals the number of lattice paths from $(0,0)$ to $(n,n)$ by unit steps…

In this article we adapt the existing account of class-forcing over a ZFC model to a model $(M,\mathcal{C})$ of Morse-Kelley class theory. We give a rigorous definition of class-forcing in such a model and show that the Definability Lemma…