Related papers: Set Theory Axioms Using Explication

We define an extension of predicate logic, called Binding Logic, where variables can be bound in terms and in propositions. We introduce a notion of model for this logic and prove a soundness and completeness theorem for it. This theorem is…

In this paper we develop a structure called Link Algebra, in which we present a Set with two binary operations and an axiom system developed from the study of graph theory and set/antiset theory, sowing main theorems and definitions. Once…

Recently, in Axioms 10(2): 119 (2021), a nonclassical first-order theory T of sets and functions has been introduced as the collection of axioms we have to accept if we want a foundational theory for (all of) mathematics that is not weaker…

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…

The work lays the foundations of the theory of changeable sets. In author opinion, this theory, in the process of it's development and improvement, can become one of the tools of solving the sixth Hilbert problem least for physics of…

We present the first steps of interaction spaces theory, a universal mathematical theory of complex systems which is able to embed cellular automata, agent based models, master equation based models, stochastic or deterministic, continuous…

In this note, we introduce the notion of support graph to define explanations for any model of a logic program. An explanation is an acyclic support graph that, for each true atom in the model, induces a proof in terms of program rules…

We present a system of axioms motivated by a topological intuition: The set of subsets of any set is a topology on that set. On the one hand, this system is a common weakening of Zermelo-Fraenkel set theory ZF, the positive set theory GPK…

Many different systems with explicit substitutions have been proposed to implement a large class of higher-order languages. Motivations and challenges that guided the development of such calculi in functional frameworks are surveyed in the…

Justification theory is a general framework for the definition of semantics of rule-based languages that has a high explanatory potential. Nested justification systems, first introduced by Denecker et al. (2015), allow for the composition…

The foundations of mathematics have long been considered settled by the Zermelo-Fraenkel-Choice axioms. But set theory abounds in models with different truths and even classical questions such as the measurability of projective sets can…

CZF is a system of set theory which, over classical logic, is equivalent to ZF, while over intuitionistic logic, it has a well-known constructive type-theoretic interpretation. This article introduces a simpler, intuitive family of…

We provide a setting-independent definition of reals by introducing the notion of a streak. We show that various standard constructions of reals satisfy our definition. We study the structure of reals by noting that its pieces correspond to…

Mathematicians still use Naive Set Theory when generating sets without danger of producing any contradiction. Therefore their working method can be considered as a consistent inference system with an experience of over 100 years. My…

A logic is presented for reasoning on iterated sequences of formulae over some given base language. The considered sequences, or "schemata", are defined inductively, on some algebraic structure (for instance the natural numbers, the lists,…

From the climate system to the effect of the internet on society, chaotic systems appear to have a significant role in our future. Here a method of statistical learning for a class of chaotic systems is described along with underlying…

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…

Soft set theory provides a direct framework for parameterized decision modeling by assigning to each attribute (parameter) a subset of a given universe, thereby representing uncertainty in a structured way [1, 2]. Over the past decades, the…

New sets (typically found by computer search) with Sidon constant equal to the square root of their cardinalities are given. For each integer $N$ there are only a finite number of groups of prime order containing $N$-element extreme sets.…

We introduce a framework that allows for the construction of sequent systems for expressive description logics extending ALC. Our framework not only covers a wide array of common description logics, but also allows for sequent systems to be…