Related papers: A Logical Framework for Set Theories
This is a short introductory course to Set Theory, based on axioms of von Neumann--Bernays--G\"odel (briefly NBG). The text can be used as a base for a lecture course in Foundations of Mathematics, and contains a reasonable minimum which a…
We propose a set theory strong enough to interpret powerful type theories underlying proof assistants such as LEGO and also possibly Coq, which at the same time enables program extraction from its constructive proofs. For this purpose, we…
The concept of definability of physical fields within a set-theoretical foundation is introduced. We propose an axiomatic set theory and show the Schroedinger equation and, more generally, a nonlinear sigma model come naturally out of the…
As an approach to a Theory of Everything a framework for developing a coherent theory of mathematics and physics together is described. The main characteristic of such a theory is discussed: the theory must be valid and and sufficiently…
We propose a natural theory SO axiomatizing the class of sets of ordinals in a model of ZFC set theory. Both theories possess equal logical strength. Constructibility theory in SO corresponds to a natural recursion theory on ordinals.
This talk presents foundations of mathematics as a historically variable set of principles appealing to various modes of human intuition and devoid of any prescriptive/prohibitive power. At each turn of history, foundations crystallize the…
Bayesian probability theory is used as a framework to develop a formalism for the scientific method based on principles of inductive reasoning. The formalism allows for precise definitions of the key concepts in theories of physics and also…
We develop an untyped framework for the multiverse of set theory. $\mathsf{ZF}$ is extended with semantically motivated axioms utilizing the new symbols $\mathsf{Uni}(\mathcal{U})$ and $\mathsf{Mod}(\mathcal{U, \sigma})$, expressing that…
The standard approach to logic in the literature in philosophy and mathematics, which has also been adopted in computer science, is to define a language (the syntax), an appropriate class of models together with an interpretation of…
This paper describes a new technique, called "knowledge patterns", for helping construct axiom-rich, formal ontologies, based on identifying and explicitly representing recurring patterns of knowledge (theory schemata) in the ontology, and…
Sets with atoms serve as an alternative to ZFC foundations for mathematics, where some infinite, though highly symmetric sets, behave in a finitistic way. Therefore, one can try to carry over analysis of the classical algorithms from finite…
We present a novel treatment of set theory in a four-valued paraconsistent and paracomplete logic, i.e., a logic in which propositions can be both true and false, and neither true nor false. Our approach is a significant departure from…
We provide a "shared axiomatization" of natural numbers and hereditarily finite sets built around a polymorphic abstraction of bijective base-2 arithmetics. The "axiomatization" is described as a progressive refinement of Haskell type…
This thesis concerns embeddings and self-embeddings of foundational structures in both set theory and category theory. The first part of the work on models of set theory consists in establishing a refined version of Friedman's theorem on…
Questions of set-theoretic size play an essential role in category theory, especially the distinction between sets and proper classes (or small sets and large sets). There are many different ways to formalize this, and which choice is made…
We show that the (typical) quantitative considerations about proper (as too big) and small classes are just tangential facts regarding the consistency of Zermelo-Fraenkel Set Theory with Choice. Effectively, we will construct a first-order…
Conceptual modeling is a strongly interdisciplinary field of research. Although numerous proposals for axiomatic foundations of the main ideas of the field exist, there is still a lack of understanding main concepts such as system, process,…
Justification theory is a unifying semantic framework. While it has its roots in non-monotonic logics, it can be applied to various areas in computer science, especially in explainable reasoning; its most central concept is a justification:…
A set $F$ of formulas is complete relative to a given class of logics, if every logic from this class can be axiomatized by formulas from $F$. A set of formulas $F$ is {\L}-complete relative to a given class of logics, if every logic of…
Traditional treatments of formal logic provide: 1. A syntax for formulas. 2. An inference relation between sets of formulas. 3. A rule for assigning meaning to formulas (semantics) that is sound with respect to the inference relation. First…