Related papers: On Rosser theories
We define a notion which contains numerous basic notions of Analysis as special cases, for example limit, continuity, differential, Riemann and Lebesgue integral, root and exponential functions. Properties like additivity or linearity of…
In this paper, we give the explicit bounds for the data of objects involved in some basic theorems of Singularity theory: the Inverse, Implicit and Rank Theorems for Lipschitz mappings, Splitting Lemma and Morse Lemma, the density and…
A constructive proof of the Goedel-Rosser incompleteness theorem has been completed using the Coq proof assistant. Some theory of classical first-order logic over an arbitrary language is formalized. A development of primitive recursive…
In this article we investigate the notion and basic properties of Boolean algebras and prove the Stone's representation theorem. The relations of Boolean algebras to logic and to set theory will be studied and, in particular, a neat proof…
As a generalization of Dempster-Shafer theory, D number theory provides a framework to deal with uncertain information with non-exclusiveness and incompleteness. However, some basic concepts in D number theory are not well defined. In this…
Primitive recursion, mu-recursion, universal object and universe theories, complexity controlled iteration, code evaluation, soundness, decidability, G\"odel incompleteness theorems, inconsistency provability for set theory, constructive…
To enable the study of open sets in computational approaches to mathematics, lots of extra data and structure on these sets is assumed. For both foundational and mathematical reasons, it is then a natural question, and the subject of this…
Is it possible to encompass the full extent of the universe within a theory based on a finite set of first principles and inference rules? The r\^{o}le of observers and observations in physics theories is considered here in the light of…
Tree sets are abstract structures that can be used to model various tree-shaped objects in combinatorics. Finite tree sets can be represented by finite graph-theoretical trees. We extend this representation theory to infinite tree sets.…
Wirsing's theorem on approximating algebraic numbers by algebraic numbers of bounded degree is a generalization of Roth's theorem in Diophantine approximation. We study variations of Wirsing's theorem where the inequality in the theorem is…
In this article, we investigate the arithmetical hierarchy from the perspective of realizability theory. An experimental observation in classical computability theory is that the notion of degrees of unsolvability for natural arithmetical…
First we survey generating function methods for obtaining useful probability estimates about random matrices in the finite classical groups. Then we describe a probabilistic picture of conjugacy classes which is coherent and beautiful.…
We study first-order expansions of the reals which do not define the set of natural numbers. We also show that several stronger notions of tameness are equivalent to each others.
The program Reverse Mathematics (RM for short) seeks to identify the axioms necessary to prove theorems of ordinary mathematics, usually working in the language of second-order arithmetic $L_{2}$. A major theme in RM is therefore the study…
We introduce the notion of limiting theories, giving examples and providing a sufficient condition under which the first order theory of a structure is the limit of the first order theories of a collection of substructures. We also give a…
We produce a long exact sequence whose terms are unit groups of associative algebras that behave as inner automorphisms of a given tensor. Our sequence generalizes known sequences for associative and non-associative algebras. In a manner…
Metaphysical interpretations of set theory are either inconsistent or incoherent. The uses of sets in mathematics actually involve three distinct kinds of collections (surveyable, definite, and heuristic), which are governed by three…
Article presents a short investigation into some properties of the Moser polynomials which appear in various problems from algebraic combinatorics. For instance, these polynomials can be used to solve the Generalized Moser's Problem on…
In this paper, we argue that while the concept of a set-theoretic paradox (or paradoxical set) can be relatively well-defined within a formal setting, the concept of a set-theoretic hypodox (or hypodoxical set) remains significantly less…
One way of studying a relational structure is to investigate functions which are related to that structure and which leave certain aspects of the structure invariant. Examples are the automorphism group, the self-embedding monoid, the…