Related papers: Francis Bessi\`ere Un nouveau regard sur les fonde…
Leftist grammars [Motwani et al., STOC 2000] are special semi-Thue systems where symbols can only insert or erase to their left. We develop a theory of leftist grammars seen as word transformers as a tool toward rigorous analyses of their…
In this article, the weakest possible theorem providing a foundation for the Hilbert space formalism of quantum theory is stated. The necessary postulates are formulated, and the mathematics is spelt out in detail. It is argued that, from…
A theory of recursive definitions has been mechanized in Isabelle's Zermelo-Fraenkel (ZF) set theory. The objective is to support the formalization of particular recursive definitions for use in verification, semantics proofs and other…
Ramsey Theorem [6] for pairs is intuitionistically but not classically provable: it is equivalent to a subclassical principle [2]. In this note we show that Ramsey may be restated in an intuitionistically provable form, which is informative…
By [R. Bautista, P. Gabriel, A.V Roiter., L. Salmeron, Representation-finite algebras and multiplicative basis. Invent. Math. 81 (1985) 217-285.], a finite-dimensional algebra having finitely many isoclasses of indecomposable…
The classical platonist / formalist dilemma in philosophy of mathematics can be expressed in lay terms as a deceptively naive question: \emph{Is new mathematics discovered or invented? Using examples from my own mathematical work during the…
By exploiting the description of topological spaces by either neighborhood systems or filter convergence, we obtain a neighborhood-like presentation of categories of lax algebras. A notable advantage of this approach is that it does not…
This is an introduction to the set-theoretic method of forcing, including its application in proving the independence of the Continuum Hypothesis from the Zermelo-Fraenkel axioms of set theory. I presuppose no particular mathematical…
In this article, we prove certain Weber-Schafheitlin type integral formulae for Bessel functions over complex numbers. A special case is a formula for the Fourier transform of regularized Bessel functions on complex numbers. This is applied…
Abstract argumentation frameworks (AFs) provide a formal setting to analyze many forms of reasoning with conflicting information. While the expressiveness of general infinite AFs make them a tempting tool for modeling many kinds of…
Leibniz's mathematical texts are a perfect example of a type of historical document that is extremely difficult to deal with in the context of an editorial enterprise: the draft. The tables in Leibniz's mathematical manuscripts are a…
Ontology embeddings map classes, relations, and individuals in ontologies into $\mathbb{R}^n$, and within $\mathbb{R}^n$ similarity between entities can be computed or new axioms inferred. For ontologies in the Description Logic…
Logical bilateralism challenges traditional concepts of logic by treating assertion and denial as independent yet opposed acts. While initially devised to justify classical logic, its constructive variants show that both acts admit…
The classical platonist/formalist dilemma in philosophy of mathematics can be expressed in lay terms as a deceptively naive question: is new mathematics discovered or invented? Using an example from my own mathematical life, I argue that…
Fuzzy Epistemic Logic is an important formalism for approximate reasoning. It extends the well known basic propositional logic BL, introduced by H\'ajek, by offering the ability to reason about possibility and necessity of fuzzy…
We propose a new paradigm for Belief Change in which the new information is represented as sets of models, while the agent's body of knowledge is represented as a finite set of formulae, that is, a finite base. The focus on finiteness is…
The Axiom-Based Atlas is a novel framework that structurally represents mathematical theorems as proof vectors over foundational axiom systems. By mapping the logical dependencies of theorems onto vectors indexed by axioms - such as those…
We propose FC, a new logic on words that combines finite model theory with the theory of concatenation - a first-order logic that is based on word equations. Like the theory of concatenation, FC is built around word equations; in contrast…
The goal of this paper is to give a simple proof of Deligne's conjecture (proven by Fujiwara) and to generalize it to the situation appearing in our joint project with David Kazhdan on the global Langlands correspondence over function…
The classical propositional assumption-based model is extended to incorporate probabilities for the assumptions. Then it is placed into the framework of evidence theory. Several authors like Laskey, Lehner (1989) and Provan (1990) already…