Related papers: Herbrand's Theorem: a short statement and a model-…
The primary aim of Hilbert's proof theory was to establish the consistency of classical mathematics using finitary means only. Hilbert's strategy for doing this was to eliminate the infinite (in the form of unbounded quantifiers) from…
Superposition is an established decision procedure for a variety of first-order logic theories represented by sets of clauses. A satisfiable theory, saturated by superposition, implicitly defines a minimal term-generated model for the…
We present the model theoretic concepts that allow mathematics to be developed with the notion of the potential infinite instead of the actual infinite. The potential infinite is understood as a dynamic notion, being an indefinitely…
The model theory of a first-order logic called N^4 is introduced. N^4 does not eliminate double negations, as classical logic does, but instead reduces fourfold negations. N^4 is very close to classical logic: N^4 has two truth values;…
Safe first-order formulas generalize the concept of a safe rule, which plays an important role in the design of answer set solvers. We show that any safe sentence is equivalent, in a certain sense, to the result of its grounding -- to the…
It is well-known that a Hilbert-style deduction system for first-order classical logic is sound and complete for a model theory built using all Boolean algebras as truth-value algebras if and only if it is sound and complete for a model…
We generalise the Fundamental Theorem of Calculus to higher dimensions. Our generalisation is based on the observation that the antiderivative of a function of $n$-variables is a solution of a partial differential equation of order $n$…
Recent improvement on Tarski's procedure for quantifier elimination in the first order theory of real numbers makes it feasible to solve small instances of the following problems completely automatically: 1. listing all equality and…
We present a simple short proof of the Fundamental Theorem of Algebra, without complex analysis and with a minimal use of topology. It can be taught in a first year calculus class.
The Heisenberg uncertainty relation is known to be obtainable by a purely mathematical argument. Based on that fact, here it is shown that the Heisenberg uncertainty relation remains valid when Quantum Mechanics is re-formulated within far…
Although there are many simple proofs of Jordan's decomposition theorem in the literature (see [1], the references mentioned there, and [2]), our proof seems to be even more elementary. In fact, all we need is the theorem on the dimensions…
We propose a purely extensional semantics for higher-order logic programming. In this semantics program predicates denote sets of ordered tuples, and two predicates are equal iff they are equal as sets. Moreover, every program has a unique…
We find new "reasons" for a class of models for not having a universal model in a cardinal $\lambda$. This work, though it has consequences in model theory, is really in combinatorial set theory. We concentrate on a prototypical class which…
We describe a method for inverting Gentzen's cut-elimination in classical first-order logic. Our algorithm is based on first computign a compressed representation of the terms present in the cut-free proof and then cut-formulas that realize…
The import of Bell's Theorem is elucidated. The theorem's proof is illustrated both heuristically and in mathematical detail in a pedagogical fashion. In the same fashion, it is shown that the proof is correct mathematically, but it doesn't…
The notion of a categorical quotient can be generalized since its standard categorical concept does not recover the expected quotients in certain categories. We present a more general formulation in the form of $\mathcal{F}$-quotients in a…
A sufficient and necessary condition is given under which least Herbrand models exactly characterize the answers of definite clause programs. To appear in Theory and Practice of Logic Programming (TPLP).
It is well known that many-sorted logic can be reduced to unsorted first-order logic by adding predicates for each sort, relativizing quantifiers to these predicates, and adding appropriate axioms governing their behavior. Existing…
We consider categorical logic on the category of Hilbert spaces. More generally, in fact, any pre-Hilbert category suffices. We characterise closed subobjects, and prove that they form orthomodular lattices. This shows that quantum logic is…
Quantum theory demands that, in contrast to classical physics, not all properties can be simultaneously well defined. The Heisenberg Uncertainty Principle is a manifestation of this fact. Another important corollary arises that there can be…