Related papers: The Creating Subject, the Brouwer-Kripke Schema, a…
It is well known that Sperner lemma is equivalent to Brouwer fixed-point theorem. Tanaka [12] proved that Brouwer theorem is equivalent to Arrow theorem, hence Arrow theorem is equivalent to Sperner lemma. In this paper we will prove this…
We generalize Fitting's work on Intuitionistic Kripke models of Set Theory using Ono and Komori's Residuated Kripke models. Based on these models, we provide a generalization of the von Neumann hierarchy in the context of Modal Residuated…
The semantic paradoxes are associated with self-reference or referential circularity. However, there are infinitary versions of the paradoxes, such as Yablo's paradox, that do not involve this form of circularity. It remains an open…
We reprove the countable splitting lemma by adapting Nawrotzki's algorithm which produces a sequence that converges to a solution. Our algorithm combines Nawrotzki's approach with taking finite cuts. It is constructive in the sense that…
We focus on a type of linguistic formal reasoning where the goal is to reason over explicit knowledge in the form of natural language facts and rules (Clark et al., 2020). A recent work, named PRover (Saha et al., 2020), performs such…
This is a study of S. Kripke's notion of fulfilment. Motivated by Paris-Harrington statement, Kripke was looking for a proof of G\"odel's Incompleteness Theorem which was model-theoretic, natural (without self-reference), and easy.…
A key component of mathematical reasoning is the ability to formulate interesting conjectures about a problem domain at hand. In this paper, we give a brief overview of a theory exploration system called QuickSpec, which is able to…
In Chapter 3 of his Notes on constructive mathematics, Martin-L{\"o}f describes recursively constructed ordinals. He gives a constructively acceptable version of Kleene's computable ordinals. In fact, the Turing definition of computable…
Canonical inference rules and canonical systems are defined in the framework of non-strict single-conclusion sequent systems, in which the succeedents of sequents can be empty. Important properties of this framework are investigated, and a…
Using the minimax technique from the critical point theory, which consists in constructing or transforming a suitable class of applications such that a critical value $c$ of a functional $f$ can be characterized as a minimax value over this…
Computational materials design often profits from the fact that some complicated contributions are not calculated for the real material, but replaced by results of models. We turn this approximation into a very general and in principle…
The computational complexity of reasoning within the Dempster-Shafer theory of evidence is one of the main points of criticism this formalism has to face. To overcome this difficulty various approximation algorithms have been suggested that…
The ultraproduct construction is generalized to $p$-ultramean constructions ($1\leqslant p<\infty$) by replacing ultrafilters with finitely additive measures. These constructions correspond to the linear fragments $\mathscr L^p$ of…
In Mathematical Thought and Its Objects, Charles Parsons argues that our knowledge of the iterability of functions on the natural numbers and of the validity of complete induction is not intuitive knowledge; Brouwer disagrees on both…
This is a survey of constructive and computable measure theory with an emphasis on the close connections with algorithmic randomness. We give a brief history of constructive measure theory from Brouwer to the present, emphasizing how…
This is in some sense an addendum to the book Relational Mathematics by the first-named author. It originated from work on diverse other topics during which a lot of purely relational results with broad applicability have been produced.…
Structural proof theory is praised for being a symbolic approach to reasoning and proofs, in which one can define schemas for reasoning steps and manipulate proofs as a mathematical structure. For this to be possible, proof systems must be…
In the first part of the article, a new interesting system of difference equations is introduced. It is developed for re-rating purposes in general insurance. A nonlinear transformation $\varphi $ of a d-dimensional $(d \ge 2)$ Euclidean…
This paper is directed towards combining Pearl's structural-model approach to causal reasoning with high-level formalisms for reasoning about actions. More precisely, we present a combination of Pearl's structural-model approach with…
We give an overview of some uses of proper scoring rules in statistical inference, including frequentist estimation theory and Bayesian model selection with improper priors.