Related papers: Two remarks on proof theory of first-order arithme…
We show how lattice paths and the reflection principle can be used to give easy proofs of unimodality results. In particular, we give a "one-line" combinatorial proof of the unimodality of the binomial coefficients. Other examples include…
The problem of gauge symmetry in higher derivative Lagrangian systems is discussed from a Hamiltonian point of view. The number of independent gauge parameters is shown to be in general {\it{less}} than the number of independent primary…
We present a combination of raising, explicit variable dependency representation, the liberalized delta-rule, and preservation of solutions for first-order deductive theorem proving. Our main motivation is to provide the foundation for our…
Logical relations are one of the most powerful techniques in the theory of programming languages, and have been used extensively for proving properties of a variety of higher-order calculi. However, there are properties that cannot be…
In these notes we propose a new, simpler proof system for first-order matching logic with application and definedness. The new proof system is inspired by Tarski's axiomatization for first order-logic with equality (simplified by Kalish and…
A dependent theory is a (first order complete theory) T which does not have the independence property. A main result here is: if we expand a model of T by the traces on it of sets definable in a bigger model then we preserve its being…
For events $A$ and $B$, we have \[ \mathbb{P}(A\mid B) > \mathbb{P}(A\mid \neg B) \qquad\Longleftrightarrow\qquad \mathbb{P}(B\mid A) > \mathbb{P}(B\mid \neg A) \] whenever all four quantities are defined. In other words, $B$ is evidence…
We present a theorem about irreducibility of a polynomial that is the resultant of two others polynomials. The proof of this fact is based on the field theory. We also consider the converse theorem and some examples.
I deal with two approaches to proof-theoretic semantics: one based on argument structures and justifications, which I call reducibility semantics, and one based on consequence among (sets of) formulas over atomic bases, called base…
Mathematical proof aims to deliver confident conclusions, but a very similar process of deduction can be used to make uncertain estimates that are open to revision. A key ingredient in such reasoning is the use of a "default" estimate of…
We present an elementary combinatorial proof of the celebrated Friendship theorem. The proof involves looking at independent sets and constructing a bound on their size which forces a contradiction.
In this paper, we give two proofs of the wellfoundedness of recursive notation systems for $\Pi_N$-reflecting ordinals. One is based on $\Pi_{N-1}^0$-inductive definitions, and the other is based on distinguished classes.
One may formulate the dependent product types of Martin-L\"of type theory either in terms of abstraction and application operators like those for the lambda-calculus; or in terms of introduction and elimination rules like those for the…
We consider several formalizations in the language of second-order arithmetic of "The formula $\phi$ is a theorem of $\omega$-logic", including some which have been studied in the literature and a new variant defined via a least fixed…
We begin a systematic development of structure theory for a first order theory, which is stable over a monadic predicate. We show that stability over a predicate implies quantifier free definability of types over stable sets, introduce an…
We investigate how much type theory is able to prove about the natural numbers. A classical result in this area shows that dependent type theory without any universes is conservative over Heyting Arithmetic (HA). We build on this result by…
An important characteristic of many logics for Artificial Intelligence is their nonmonotonicity. This means that adding a formula to the premises can invalidate some of the consequences. There may, however, exist formulae that can always be…
We generalize the notion of proof term to the realm of transfinite reduction. Proof terms represent reductions in the first-order term format, thereby facilitating their formal analysis. We show that any transfinite reduction can be…
A serial property is a suitably enumerated sequence $\{F_n\}$ of formulas and is called selector provable in PA if there is a PA-recursive function $s(x)$ such that PA $\vdash \forall x (s(x){:}_{\text{PA}} \ulcorner F_x\urcorner)$ where…
In this paper, we consider the problem of learning a first-order theorem prover that uses a representation of beliefs in mathematical claims to construct proofs. The inspiration for doing so comes from the practices of human mathematicians…