Related papers: Higher Cardinals are only a Convention
This article discusses completeness of Boolean Algebra as First Order Theory in Goedel's meaning. If Theory is complete then any possible transformation is equivalent to some transformation using axioms, predicates etc. defined for this…
This paper introduces an alternative approach to proving the existence of choice functions for specific families of sets within Zermelo-Fraenkel set theory (ZF) without assuming any form on the Axiom of Choice (AC). Traditional methods of…
Given two languages, a separator is a third language that contains the first one and is disjoint from the second one. We investigate the following decision problem: given two regular input languages of finite words, decide whether there…
We argue against Foreman's proposal to settle the continuum hypothesis and other classical independent questions via the adoption of generic large cardinal axioms.
This article explores the model-dependent nature of set cardinality, emphasizing that cardinality is not absolute but varies across different axiomatic frameworks. Although Cantor's diagonal argument shows the real numbers are…
We discuss how singular can cardinals be in absence of the axiom of choice. We show that, contrasting with known negative consistency results (of Gitik and others), certain positive results are provable. Then we pose some problems.
This is a paper that aims to interpret the cardinality of a set in terms of Baire Category, i.e. how many closed nowhere dense sets can be deleted from a set before the set itself becomes negligible. . To do this natural tree-theoretic…
We introduce the notion of $\mathcal{C}$-system of filters, generalizing the standard definitions of both extenders and towers of normal ideals. This provides a framework to develop the theory of extenders and towers in a more general and…
Limit can be defined by two axioms: 1. Strict inequality between limits implies, ultimately, strict inequality between functions. 2. For constant functions limit is trivial. How can basic results on convergence be derived from these axioms?…
Cantor's ordinal numbers, a powerful extension of the natural numbers, are a cornerstone of set theory. They can be used to reason about the termination of processes, prove the consistency of logical systems, and justify some of the core…
We define a potentialist system of ZF-structures, that is, a collection of possible worlds in the language of ZF connected by a binary accessibility relation, achieving a potentialist account of the full background set-theoretic universe…
This paper enlarges classical syllogistic logic with assertions having to do with comparisons between the sizes of sets. So it concerns a logical system whose sentences are of the following forms: {\sf All $x$ are $y$} and {\sf Some $x$ are…
We define a class of Separation Logic formulae, whose entailment problem: given formulae $\phi, \psi_1, \ldots, \psi_n$, is every model of $\phi$ a model of some $\psi_i$? is 2EXPTIME-complete. The formulae in this class are existentially…
In this paper, we describe the formalization of the axiom of choice and several of its famous equivalent theorems in Morse-Kelley set theory. These theorems include Tukey's lemma, the Hausdorff maximal principle, the maximal principle,…
We introduce reflection properties of cardinals in which the attributes that reflect are expressible by infinitary formulas whose lengths can be strictly larger than the cardinal under consideration. This kind of generalized reflection…
In a previous article the authors determined the best-known upper bound for the cardinality of the image set for several classes of functions, including planar functions. Here, we show that the upper bound cannot be tight for planar…
Most of the assertions in the theory of well ordered sets are quite simple. However, one of its central statements, Zermelo's theorem, stands out of this rule, for its well-known proofs are rather complicated. The aim of the current paper…
We introduce a generalized notion of inference system to support more flexible interpretations of recursive definitions. Besides axioms and inference rules with the usual meaning, we allow also coaxioms, which are, intuitively, axioms which…
We show that the excellence axiom in the definition of Zilber's quasiminimal excellent classes is redundant, in that it follows from the other axioms. This substantially simplifies a number of categoricity proofs.
The Recurrence Axiom for a class $\mathcal{P}$ of \pos\ and a set $A$ of parameters is an axiom scheme in the language of ZFC asserting that if a statement with parameters from $A$ is forced by a poset in $\mathcal{P}$, then there is a…