Related papers: The full basis theorem does not imply analytic wel…
The idea of this paper is to explore the existence of canonical countably saturated models for different classes of structures. It is well-known that, under CH, there exists a unique countably saturated linear order of cardinality…
This dissertation is a contribution to the project of second-order set theory, which has seen a revival in recent years. The approach is to understand second-order set theory by studying the structure of models of second-order set theories.…
We show that Dependent Choice is a sufficient choice principle for developing the basic theory of proper forcing, and for deriving generic absoluteness for the Chang model in the presence of large cardinals, even with respect to…
Alon's combinatorial Nullstellensatz (Theorem 1.1 from \cite{Alon1}) is one of the most powerful algebraic tools in combinatorics, with a diverse array of applications. Let $\F$ be a field, $S_1,S_2,..., S_n$ be finite nonempty subsets of…
Proofs of the fundamental theorem of algebra can be divided up into three groups according to the techniques involved: proofs that rely on real or complex analysis, algebraic proofs, and topological proofs. Algebraic proofs make use of the…
In this paper we present a simpler proof of the fact that no inequality between $\mathrm{cof}(\mathcal{SN})$ and $\mathfrak{c}$ can be decided in ZFC by using well-known tecniques and results.
In previous papers on this project a general static logical framework for formalizing and mechanizing set theories of different strength was suggested, and the power of some predicatively acceptable theories in that framework was explored.…
We present an abstract social aggregation theorem. Society, and each individual, has a preorder that may be interpreted as expressing values or beliefs. The preorders are allowed to violate both completeness and continuity, and the…
In this paper, we give an algebraic completeness theorem for constructive logic with strong negation in terms of finite rough set-based Nelson algebras determined by quasiorders. We show how for a quasiorder $R$, its rough set-based Nelson…
For a compactification $\alpha X$ of a Tychonoff space $X$, the algebra of all functions $f\in C(X)$ that are continuously extendable over $% \alpha X$ is denoted by $C_{\alpha}(X)$. It is shown that, in a model of $\textbf{ZF}$, it may…
The aim of these lectures is to give a short introduction to forcing. We will avoid metamathematical issues as much as possible and similarly we will avoid performing the actual construction of forcing. We assume familiarity with basic…
Given any polynomial with real coefficients, the existence of a real quadratic polynomial factor is proven using only basic real analysis. The aim is to provide an approachable proof to anybody who is familiar with the least upper bound…
In a previous paper [1] it was discussed the viability of functional analysis using as a basis a couple of generic functions, and hence vectorial decomposition. Here we complete the paradigm exploiting one of the analysis methodologies…
An $\omega_1$-compact space is a space in which every closed discrete subspace is countable. We give various general conditions under which a locally compact, $\omega_1$-compact space is $\sigma$-countably compact, i.e., the union of…
The purpose of this paper is to generalize in a geometric setting theorems of Severi, Brown and Bochner about analytic continuation of real analytic functions which are holomorphic or harmonic with respect to one of its variables. We prove…
Non-wellfounded proof theory results from allowing proofs of infinite height in proof theory. To guarantee that there is no vicious infinite reasoning, it is usual to add a constraint to the possible infinite paths appearing in a proof.…
The Wholeness Axioms, proposed by Paul Corazza, axiomatize the existence of an elementary embedding j:V-->V. Formalized by augmenting the usual language of set theory with an additional unary function symbol j to represent the embedding,…
We utilize the same technique as in [arXiv:2205.04254 (2022)] to provide some representations of polynomials non-negative on a basic semi-algebraic set, defined by polynomial inequalities, under more general conditions. Based on each…
This article was motivated by the discovery of a potential new foundation for mainstream mathematics. The goals are to clarify the relationships between primitives, foundations, and deductive practice; to understand how to determine what…
We demonstrate that theories $\text{Z}^-$, $\text{ZF}^-$, $\text{ZFC}^-$ (minus means the absence of the Power Set axiom) and $\text{PA}_2$, $\text{PA}_2^-$ (minus means the absence of the Countable Choice schema) are equiconsistent to each…