Related papers: On some $\Sigma^{B}_{0}$-formulae generalizing cou…

The module theorem by Janhunen et al. demonstrates how to provide a modular structure in answer set programming, where each module has a well-defined input/output interface which can be used to establish the compositionality of answer sets.…

We investigate the proof complexity of a class of propositional formulas expressing a combinatorial principle known as the Kneser-Lov\'{a}sz Theorem. This is a family of propositional tautologies, indexed by an nonnegative integer parameter…

Recent results established exponential lower bounds for the length of any Resolution proof for the weak pigeonhole principle. More formally, it was proved that any Resolution proof for the weak pigeonhole principle, with $n$ holes and any…

We show that many principles of first-order arithmetic, previously only known to lie strictly between $\Sigma_1$-induction and $\Sigma_2$-induction, are equivalent to the well-foundedness of $\omega^\omega$. Among these principles are the…

The schematic CERES method is a method of cut elimination for proof schemata, that is a sequence of proofs with a recursive construction. Proof schemata can be thought of as a way to circumvent the addition of an induction rule to the…

We prove an induction theorem for the higher algebraic K-groups of group algebras $kG$ of finite groups $G$ over characteristic $p$ finite fields $k$. For a certain class of finite groups, which we call $p$-isolated, this reduces…

The basic motivation behind this work is to raise the question that whether post selection can be considered a valid physical transformation (on probability space) or not. We study the consequences of both answers set in a device (theory)…

In previous work, an attempt was made to apply the schematic CERES method [8] to a formal proof with an arbitrary number of {\Pi} 2 cuts (a recursive proof encapsulating the infinitary pigeonhole principle) [5]. However the derived…

Let $q$ be a power of the prime number $p$, let $K={\mathbb F}_q(t)$, and let $r\ge 2$ be an integer. For points ${\mathbf a}, {\mathbf b}\in K$ which are $\mathbb{F}_q$-linearly independent, we show that there exist positive constants…

We introduce ordinal collapsing principles that are inspired by proof theory but have a set theoretic flavor. These principles are shown to be equivalent to iterated $\Pi^1_1$-comprehension and the existence of admissible sets, over weak…

The infinite pigeonhole principle for 2-partitions ($\mathsf{RT}^1_2$) asserts the existence, for every set $A$, of an infinite subset of $A$ or of its complement. In this paper, we study the infinite pigeonhole principle from a…

We prove, under a computational complexity hypothesis, that it is consistent with the true universal theory of p-time algorithms that a specific p-time function extending $n$ bits to $m \geq n^2$ bits violates the dual weak pigeonhole…

We give a concise historical background to Montmort's matching problem and its modern variants such as the hat-check problem, then develop a unified counting framework for fixed-point-free allocations. Using elementary recurrence and…

We consider polynomial equations, or systems of polynomial equations, with integer coefficients, modulo prime numbers $p$. We offer an elementary approach based on a counting method. The outcome is a weak form of the Lang-Weil lower bound…

A classical result of A. Fleck states that if p is a prime, and n>0 and r are integers, then $$\sum_{k=r(mod p)}\binom {n}{k}(-1)^k=0 (mod p^{[(n-1)/(p-1)]}).$$ Recently R. M. Wilson used Fleck's congruence and Weisman's extension to…

Proof schemata are infinite sequences of proofs which are defined inductively. In this paper we present a general framework for schemata of terms, formulas and unifiers and define a resolution calculus for schemata of quantifier-free…

We prove some injectivity theorems. Our proof depends on the theory of mixed Hodge structures on cohomology groups with compact support. Our injectivity theorems would play crucial roles in the minimal model theory for higher-dimensional…

It is proved that a module M over a commutative noetherian ring R is injective if Ext^i((R/p)_p,M)=0 holds for every i\ge 1 and every prime ideal p in R. This leads to the following characterization of injective modules: If F is faithfully…

We study the reverse mathematics of countable analogues of several maximality principles that are equivalent to the axiom of choice in set theory. Among these are the principle asserting that every family of sets has a $\subseteq$-maximal…

Given a finite set of roots of unity, we show that all power sums are non-negative integers iff the set forms a group under multiplication. The main argument is purely combinatorial and states that for an arbitrary finite set system the…