Related papers: Comparing Hume's Principle, Basic Law V and Peano …
Learning arguments is highly relevant to the field of explainable artificial intelligence. It is a family of symbolic machine learning techniques that is particularly human-interpretable. These techniques learn a set of arguments as an…
In this paper hypergraph Lambek calculus ($\mathrm{HL}$) is presented. This formalism aims to generalize the Lambek calculus ($\mathrm{L}$) to hypergraphs as hyperedge replacement grammars extend context-free grammars. In contrast to the…
In reverse mathematics, is is possible to have a curious situation where we know that an implication does not reverse, but appear to have no information on on how to weaken the assumption while preserving the conclusion. A main cause of…
Previous results on proving confluence for Constraint Handling Rules are extended in two ways in order to allow a larger and more realistic class of CHR programs to be considered confluent. Firstly, we introduce the relaxed notion of…
A hypergraph $G=(V,E)$ is $(k,\ell)$-sparse if no subset $V'\subset V$ spans more than $k|V'|-\ell$ hyperedges. We characterize $(k,\ell)$-sparse hypergraphs in terms of graph theoretic, matroidal and algorithmic properties. We extend…
The quotient hyperfield is a landmark on the borderline of fields and hyperfields. In this paper, which is the second part of our previously published paper, all the hyperfields of order 7 are constructed, enumerated and presented, in the…
We prove that Lefschetz's principle of approximating the cohomology of a possibly singular affine scheme of finite type over a field by the cohomology of a suitable (thickening of a) hyperplane section can be made uniform: in the affine…
A new formalism is given for the renormalization of quantum field theories to all orders of perturbation theory, in which there are manifestly no overlapping divergences. We prove the BPH theorem in this formalism, and show how the local…
We investigate the order $\rho$ of the four entire functions in the Nevanlinna matrix of an indeterminate Hamburger moment sequence. We give an upper estimate for $\rho$ which is explicit in terms of the parameters of the canonical system…
To determine whether a number is congruent or not is an old and difficult topic and progress is slow. The paper presents a new theorem when a prime number is a congruent number or not. The proof is not necessarily any simpler or shorter…
Superdeduction is a method specially designed to ease the use of first-order theories in predicate logic. The theory is used to enrich the deduction system with new deduction rules in a systematic, correct and complete way. A proof-term…
We study the complexity of reasoning in abstracts argumentation frameworks close to graph classes that allow for efficient reasoning methods, i.e.\ to one of the classes of acyclic, noeven, biparite and symmetric AFs. In this work we show…
By employing certain extended classical summation theorems, several surprising \pi and other formulae are displayed.
We define instantiational and algorithmic completeness for a formal language. We show that, in the presence of Church's Thesis, an alternative interpretation of Goedelian incompleteness is that Peano Arithmetic is instantiationally…
We present a new manifestation of G\"odel's second incompleteness theorem and discuss its foundational significance, in particular with respect to Hilbert's program. Specifically, we consider a proper extension of Peano arithmetic…
This article provides a concise overview of the main mathematical theory of Benford's law in a form accessible to scientists and students who have had first courses in calculus and probability. In particular, one of the main objectives here…
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…
Recently, it has been shown how to perform the quantum hamiltonian reduction in the case of general $sl(2)$ embeddings into Lie (super)algebras, and in the case of general $osp(1|2)$ embeddings into Lie superalgebras. In another development…
We present critical arguments against individual interpretation of Bohr's complementarity and Heisenberg's uncertainty principles. Statistical interpretation of these principles is discussed in the contextual framework. We support the…
We give an arithmetical proof of the strong normalization of the $\lambda$-calculus (and also of the $\lambda\mu$-calculus) where the type system is the one of simple types with recursive equations on types. The proof using candidates of…