Related papers: The Continuity Postulate in Economic Theory: A Dec…
For Hilbert, the consistency of a formal theory T is an infinite series of statements "D is free of contradictions" for each derivation D and a consistency proof is i) an operation that, given D, yields a proof that D is free of…
A commuting tuple of $n$ operators $(S_1, \dots, S_{n-1}, P)$ defined on a Hilbert space $\mathcal{H}$, for which the closed symmetrized polydisc \[ \Gamma_n = \left\{ \left(\sum_{i=1}^{n}z_i, \sum\limits_{1\leq i<j\leq n}z_iz_j, \dots,…
Bachmair's and Ganzinger's abstract redundancy concept for the Superposition Calculus justifies almost all operations that are used in superposition provers to delete or simplify clauses, and thus to keep the clause set manageable. Typical…
The central open question in Descriptive Complexity is whether there is a logic that characterizes deterministic polynomial time (PTIME) on relational structures. Towards this goal, we define a logic that is obtained from first-order logic…
In [12], Nilsson proposed the probabilistic logic in which the truth values of logical propositions are probability values between 0 and 1. It is applicable to any logical system for which the consistency of a finite set of propositions can…
The consideration of nonstandard models of the real numbers and the definition of a qualitative ordering on those models provides a generalization of the principle of maximization of expected utility. It enables the decider to assign…
The second law of thermodynamics, which deals with irreversibility and makes the theory so special, is usually considered empirical. The definition of equilibrium as an attractor, on the other hand, requires a postulate. This article shows…
This paper presents a formal theory which describes propositional binary logic as a semantically closed formal language, and allows for syntactically and semantically well-formed formulae, formal proofs (demonstrability in Hilbertian…
The question of which functions acting entrywise preserve positive semidefiniteness has a long history, beginning with the Schur product theorem [Crelle 1911], which implies that absolutely monotonic functions (i.e., power series with…
The binary relation framework has been shown to be applicable to many real-life preference handling scenarios. Here we study preference contraction: the problem of discarding selected preferences. We argue that the property of minimality…
We formalize the general principle of significance with respect to binary relations which is a universal tool for description and analysis of various situations in and apart from mathematics. We derive the basic properties and focus on a…
G\"odel's Incompleteness Theorems suggest that no single formal system can capture the entirety of one's mathematical beliefs, while pointing at a hierarchy of systems of increasing logical strength that make progressively more explicit…
We introduce a new definition of topological degree for a meaningful class of operators which need not be continuous. Subsequently, we derive a number of fixed point theorems for such operators. As an application, we deduce a new existence…
The purpose of this paper is to address some criticisms recently raised by John Horty in two articles against the validity of two commonly accepted defeasible reasoning patterns, viz. reinstatement and floating conclusions. I shall argue…
We present here three different approaches to the problem of modeling mathematically the concept of a non-deterministic mechanism. Each of these three approaches leads to a mathematical definition. We then show that all the three…
Whatever other beliefs there may remain for considering Cantor's diagonal argument as mathematically legitimate, there are three that, prima facie, lend it an illusory legitimacy; they need to be explicitly discounted appropriately. The…
This paper improves two existing theorems of interest to neo-logicist philosophers of mathematics. The first is a classification theorem due to Fine for equivalence relations between concepts definable in a well-behaved second-order logic.…
This paper discusses the semantics and proof theory of Nilsson's probabilistic logic, outlining both the benefits of its well-defined model theory and the drawbacks of its proof theory. Within Nilsson's semantic framework, we derive a set…
The aim of this article is to generalize logics of formal inconsistency ($\textbf{LFI}$s) to systems dealing with the concept of incompatibility, expressed by means of a binary connective. The basic idea is that having two incompatible…
We study Tao's finitary viewpoint of convergence in metric spaces, as captured by the notion of metastability. We adopt the perspective of continuous model theory. We show that, in essence, metastable convergence with a given rate is the…