Related papers: Herbrand's Theorem: a short statement and a model-…
In this paper, a new calculus on sequences is defined. Also, the $\lambda$-derivative and the $\lambda$-integration are investigated. The fundamental theorem of $\lambda$-calculus is included. A suitable function basis for the…
This paper proves normalisation theorems for intuitionist and classical negative free logic, without and with the $\invertediota$ operator for definite descriptions. Rules specific to free logic give rise to new kinds of maximal formulas…
Free theorems are a popular tool in reasoning about parametrically polymorphic code. They are also of instructive use in teaching. Their derivation, though, can be tedious, as it involves unfolding a lot of definitions, then hoping to be…
Let $F \in \mathbb{Z}[x_1, \ldots, x_n]$ be a homogeneous form of degree $d \geq 2$, and $V_F^*$ the singular locus of the hypersurface $\{\mathbf{x} \in \mathbb{A}^n_{\mathbb{C}}: F(\mathbf{x}) = 0 \}$. A longstanding result of Birch…
We derive the Helmholtz theorem for Hamiltonian systems defined on time scales in the context of nonshifted calculus of variations which encompass the discrete and continuous case. Precisely, we give a theorem characterizing first order…
Bertrand's paradox is a famous problem of probability theory, pointing to a possible inconsistency in Laplace's principle of insufficient reason. In this article we show that Bertrand's paradox contains two different problems: an "easy"…
Generalized Higman's Theorem is the direct counterpart of Higman's Theorem that asserts the closure of the class of \emph{better} quasi-orders, instead of the class of \emph{well} quasi-orders, under the construction $P\mapsto P^{<\omega}$…
In this paper a novel calculus system has been established based on the concept of 'werden'. The basis of logic self-contraction of the theories on current calculus was shown. Mistakes and defects in the structure and meaning of the…
In the theory of conditional sets, many classical theorems from areas such as functional analysis, probability theory or measure theory are lifted to a conditional framework, often to be applied in areas such as mathematical economics or…
This paper presents a sequent calculus and a dual domain semantics for a theory of definite descriptions in which these expressions are formalised in the context of complete sentences by a binary quantifier $I$. $I$ forms a formula from two…
It is found that without any additional assumptions, Nernst's equation can be re-deduced from the experimental data obtained from the thermodynamic systems at ultra-low temperatures, and consequently, the physical content included by…
We study first-order concatenation theory with bounded quantifiers. We give axiomatizations with interesting properties, and we prove some normal-form results. Finally, we prove a number of decidability and undecidability results.
A causal, non-Hermitian, renormalizable, local, unitary and Lorentz convariant formulation of Quantum Theory (QT) (= Quantum Mechanics (QM) and Quantum Field Theory (QFT)) is developed which is free of formalistic problems we face in the…
A longstanding open problem in lambda calculus is whether there exist continuous models of the untyped lambda calculus whose theory is exactly the least lambda-theory lambda-beta or the least sensible lambda-theory H (generated by equating…
A new characterization of provably recursive functions of first-order arithmetic is described. Its main feature is using only terms consisting of 0, the successor S and variables in the quantifier rules, namely, universal elimination and…
This paper contains a complete proof of a fundamental theorem on the normalizers of unipotent subgroups in semisimple algebraic groups.
The jiggling lemma of Thurston shows that any triangulation can be jiggled (read: subdivided and then perturbed) to be in general position with respect to a distribution. Our main result is a generalization of Thurston's lemma. It states…
We introduce a proper display calculus for first-order logic, of which we prove soundness, completeness, conservativity, subformula property and cut elimination via a Belnap-style metatheorem. All inference rules are closed under uniform…
We use automated theorem provers to significantly shorten a formal development in higher order set theory. The development includes many standard theorems such as the fundamental theorem of arithmetic and irrationality of square root of…
The principle which allows to construct new physical theories on the basis of classical mechanics by reduction of the number of its axiom without engaging new postulates is formulated. The arising incompleteness of theory manifests itself…