Related papers: Counting false entries in truth tables of brackete…
Isomorphism between formulae is defined with respect to categories formalizing equality of deductions in classical propositional logic and in the multiplicative fragment of classical linear propositional logic caught by proof nets. This…
We discuss the procedure of different partitions in the finite set of $N$ integer numbers and construct generic formulas for a bijective map of real numbers $s_y$, where $y=1,2,\ldots,N$, $N=\prod \limits_{k=1}^{n} X_k$, and $X_k$ are…
The paper proposes a new type of negation in multi-valued logics, providing a different way to answer the following question: what does it mean that some object language formula does not have a given truth-value. Along the way, the paper…
We prove results about the asymptotic formulae in short intervals for the average number of representations of integers of the forms $n=p_{1}^{\ell_1}+p_{2}^{\ell_2}$, with $\ell_1, \ell_2\in\{2,3\}$, $\ell_1+\ell_2\le 5$ are fixed…
We first introduce the Hamming distance between two strings. Then, we apply this concept to the representations of whole numbers in base n for all positive integers n > 2. We claim that a simple formula exists for the sum of all Hamming…
The paper is devoted to the Poisson brackets compatible with multiplication in associative algebras. These brackets are shown to be quadratic and their relations with the classical Yang--Baxter equation are revealed. The paper also contains…
Let $g_{n_1,n_2}$ be the number of standard Young tableau of truncated shifted shape with $n_1$ rows and $n_2$ boxes in each row. By using of the integral method this paper derives the recurrence relations of $g_{3,n}$, $g_{n,4}$ and…
This work was intended to be an attempt to introduce the meta-language for working with multiple-conclusion inference rules that admit asserted propositions along with the rejected propositions. The presence of rejected propositions, and…
We examine the convergence properties of sequences of nonnegative real numbers that satisfy a particular class of recursive inequalities, from the perspective of proof theory and computability theory. We first establish a number of results…
Databases contain information about which relationships do and do not hold among entities. To make this information accessible for statistical analysis requires computing sufficient statistics that combine information from different…
The problem of verifying whether a textual hypothesis holds based on the given evidence, also known as fact verification, plays an important role in the study of natural language understanding and semantic representation. However, existing…
We present some exact expressions for the number of paths of a given length in a perfect $m$-ary tree. We first count the paths in perfect rooted $m$-ary trees and then use the results to determine the number of paths in perfect unrooted…
We derive an asymptotic formula for the number of strongly connected digraphs with $n$ vertices and $m$ arcs (directed edges), valid for $m-n\to\infty$ as $n\to \infty$ provided $m=O(n\log n)$. This fills the gap between Wright's results…
We consider the sum of the reciprocals of the middle prime factor of an integer, defined according to multiplicity or not. We obtain an asymptotic expansion in the first case and an asymptotic formula involving an implicit parameter in the…
A famous result of Bennequin states that for any braid representative of the unknot the Bennequin number is negative. We will extend this result to all n-trivial closed n-braids. This is a class of infinitely many knots closed under taking…
We show that for Multiplicative Exponential Linear Logic (without weakenings) the syntactical equivalence relation on proofs induced by cut-elimination coincides with the semantic equivalence relation on proofs induced by the multiset based…
The number of tuples with positive integers pairwise relatively prime to each other with product at most $n$ is considered. A generalization of $\mu^{2}$ where $\mu$ is the M\"{o}bius function is used to formulate this divisor sum and…
Recent research has generated hope that inference scaling, such as resampling solutions until they pass verifiers like unit tests, could allow weaker models to match stronger ones. Beyond inference, this approach also enables training…
We investigate the number of symmetric matrices of non-negative integers with zero diagonal such that each row sum is the same. Equivalently, these are zero diagonal symmetric contingency tables with uniform margins, or loop-free regular…
A positive integer $n$ is said to be a Zumkeller number or an integer-perfect number if the set of its positive divisors can be partitioned into two subsets of equal sums. In this paper, we prove several results regarding Zumkeller numbers.…