Related papers: Hilbert's Program Then and Now
We propose a sequential homotopy method for the solution of mathematical programming problems formulated in abstract Hilbert spaces under the Guignard constraint qualification. The method is equivalent to performing projected backward Euler…
The theory of classical realizability is a framework in which we can develop the proof-program correspondence. Using this framework, we show how to transform into programs the proofs in classical analysis with dependent choice and the…
Since the early twentieth century, it has been understood that mathematical definitions and proofs can be represented in formal systems systems with precise grammars and rules of use. Building on such foundations, computational proof…
With the technology of the time, Kowalski's seminal 1974 paper {\em Predicate Logic as a Programming Language} was a breakthrough for the use of logic in computer science. It introduced two fundamental ideas: on the declarative side, the…
A new computational method that uses polynomial equations and dynamical systems to evaluate logical propositions is introduced and applied to Goedel's incompleteness theorems. The truth value of a logical formula subject to a set of axioms…
There are several remarks on Hilbert series of finitely presented (f. p.) associative algebras over a field and their modules. First, given an integer $D$, the set of Hilbert series of right-sided ideals with generators and relations of…
In two papers entitled "On a new foundation [Neue Begr\"undung] of quantum mechanics," Pascual Jordan (1927b,g) presented his version of what came to be known as the Dirac-Jordan statistical transformation theory. As an alternative that…
In the theory of answer set programming, two groups of rules are called strongly equivalent if, informally speaking, they have the same meaning in any context. The relationship between strong equivalence and the propositional logic of…
Processing programs as data is one of the successes of functional and logic programming. Higher-order functions, as program-processing programs are called in functional programming, and meta-programs, as they are called in logic…
This paper presents a solution to a problem from superanalysis about the existence of Hilbert-Banach superalgebras. Two main results are derived: 1) There exist Hilbert norms on some graded algebras (infinite-dimensional superalgebras…
Algebraic logic studies algebraic theories related to proposition and first-order logic. A new algebraic approach to first-order logic is sketched in this paper. We introduce the notion of a quantifier theory, which is a functor from the…
For any power series $a(t)$ with exponentially bounded nonnegative integer coefficients we suggest a simple construction of a finitely generated monomial associative algebra $R$ with Hilbert series $H(R,t)$ very close to $a(t)$. If $a(t)$…
Integral operators of Abel type of order a > 0 arise naturally in a large spectrum of physical processes. Their inversion requires care since the resulting inverse problem is ill-posed. The purpose of this work is to devise and analyse a…
In this paper we propose two proximal gradient algorithms for fractional programming problems in real Hilbert spaces, where the numerator is a proper, convex and lower semicontinuous function and the denominator is a smooth function, either…
This paper explores multiple closely related themes: bounding the complexity of Diophantine equations over the integers and developing mathematical proofs in parallel with formal theorem provers. Hilbert's Tenth Problem (H10) asks about the…
The bilateralist approach to logical consequence maintains that judgments of different qualities should be taken into account in determining what-follows-from-what. We argue that such an approach may be actualized by a two-dimensional…
Standard expositions of Goedel's 1931 paper on undecidable arithmetical propositions are based on two presumptions in Goedel's 1931 interpretation of his own, formal, reasoning - one each in Theorem VI and in Theorem XI - which do not meet…
The need for a mathematically rigorous quantization procedure of singular spaces and incomplete motions is pointed out in connection with quantum cosmology. We put our previous suggestion for such a procedure, based on the theory of induced…
In this paper, we trace the development of the theory of the calculus of variations. From its roots in the work of Greek thinkers and continuing through to the Renaissance, we see that advances in physics serve as a catalyst for…
We investigate some aspects of the geometry of two classical generalisations of the Hilbert schemes of points. Precisely, we show that parity conjecture for $\text{Quot}_r^d\mathbb{A}^3$ already fails for $d=8$ and $r=2$ and that lots of…