Related papers: Lindenbaum Method
Lindstr\"om theorem obviously fails as a characterization of $\mathcal{L}_{\omega \omega}^{-} $, first-order logic without identity. In this note we provide a fix: we show that $\mathcal{L}_{\omega \omega}^{-} $ is \emph{maximal} among…
This paper introduces and investigates the structure of $\delta$-Leibniz algebras, which serve as a parametric generalization of classical Leibniz algebras defined by a scalar $\delta$. The authors define $\delta$-Lie algebras, $\delta$-Lie…
It is shown that propositional intuitionistic logic is the maximal (with respect to expressive power) abstract logic satisfying a certain topological property reminiscent of compactness, the Tarski union property and preservation under…
Recent developments in the categorical foundations of universal algebra have given fresh impetus to an understanding of the lambda calculus coming from categorical logic: an interpretation is a semi-closed algebraic theory. Scott's…
We introduce a new framework called linear algebraic number theory (LANT) that reformulates the number-theoretic problem as a regression model and solves it using matrix algebra. This framework restricts all computations to log space,…
Hilbert's program was an ambitious and wide-ranging project in the philosophy and foundations of mathematics. In order to "dispose of the foundational questions in mathematics once and for all, "Hilbert proposed a two-pronged approach in…
The history of computability theory and and the history of analysis are surprisingly intertwined since the beginning of the twentieth century. For one, \'Emil Borel discussed his ideas on computable real number functions in his introduction…
Building on the correspondence between finitely axiomatised theories in {\L}ukasieiwcz logic and rational polyhedra, we prove that the unification type of the fragment of {\L}ukasiewicz logic with $n\geq 2$ variables is nullary. This solves…
Basic arithmetic is the cornerstone of mathematics and computer sciences. In arithmetic, 'division by zero' is an undefined operation and any attempt at extending logic for algebraic division to incorporate division by zero has resulted in…
The Collatz conjecture is a famous math problem that was introduced by Lothar Collatz in 1937, and nobody has yet succeeded in proving or disproving it. In this article, I will analyze this problem with a new approach and I will discuss my…
Computational Logic is the use of computers to establish facts in a logical formalism. Originating in 19th-century attempts to understand the nature of mathematical reasoning, the subject now comprises a wide variety of formalisms,…
The time evolution of Markovian open quantum systems is governed by Lindblad master equations, whose solution can be formally written as the Lindbladian exponential acting on the initial density matrix. By expanding this Lindbladian…
We present a set of principles and methodologies which may serve as foundations of a unifying theory of Mathematics. These principles are based on a new view of Grothendieck toposes as unifying spaces being able to act as `bridges' for…
We present a linearity theorem for a proof language of intuitionistic multiplicative additive linear logic, incorporating addition and scalar multiplication. The proofs in this language are linear in the algebraic sense. This work is part…
It is well-known that the W\"ustholz' analytic subgroup theorem is one of the most powerful theorems in transcendence theory. The theorem gives in a very systematic and conceptual way the transcendence of a large class of complex numbers,…
Kolmogorov introduced an informal calculus of problems in an attempt to provide a classical semantics for intuitionistic logic. This was later formalised by Medvedev and Muchnik as what has come to be called the Medvedev and Muchnik…
A logic-enriched type theory (LTT) is a type theory extended with a primitive mechanism for forming and proving propositions. We construct two LTTs, named LTTO and LTTO*, which we claim correspond closely to the classical predicative…
We are considering the algebraic structure of the Pawlak-Brouwer-Zadeh lattice to distinguish vagueness due to imprecision from ambiguity due to coarseness. We show that a general class of many-valued logics useful for reasoning about data…
The information-theoretic point of view proposed by Leibniz in 1686 and developed by algorithmic information theory (AIT) suggests that mathematics and physics are not that different. This will be a first-person account of some doubts and…
Ralph Henstock (1923 - 2007), with (independently) Jaroslav Kurzweil, was the originator of the Riemann-complete or generalized Riemann integral. This material consists of four chapters of a book proposal to Cambridge University Press,…