Related papers: What is the theory ZFC without power set?
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…
We investigate the structure of FN bases (Frechet-Nikodym bases) without assuming the Continuum Hypothesis (CH), refining results of Siu-Ah Ng concerning definability via flatness and nonforking. In particular, we examine the dependence of…
I introduce a new family of axioms extending ZFC set theory, the $\Sigma_n$-correct forcing axioms. These assert roughly that whenever a forcing name $\dot{a}$ can be forced by a poset in some forcing class $\Gamma$ to have some $\Sigma_n$…
We deal with relatives of GCH which are provable. In particular we deal with rank version of the revised GCH. Our motivation was to find such results when only weak versions of the axiom of choice are assumed but some of the results gives…
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…
When a linear order has an order preserving surjection onto each of its suborders we say that it is strongly surjective. We prove that the set of countable strongly surjective linear orders is complete for the class of sets which are the…
Answering questions of A. Avil\'es, F. Cabello S\'anchez, J. Castillo, M. Gonz\'alez and Y. Moreno we show that the following statements are independent of the usual axioms ZFC with arbitrarily large continuum: for every (some)…
We prove that it is consistent with ZFC that no sequential topological groups of intermediate sequential orders exist. This shows that the answer to a 1981 question of P.~Nyikos is independent of the standard axioms of set theory. The model…
We characterize those standard models M of ZFC which are embeddable, as the class of all standard sets, in a model of internal set theory IST. The necessary and sufficient condition is that 1) there is a wellordering < of M which does not…
We construct a countable simple theory which, in Keisler's order, is strictly above the random graph (but "barely so") and also in some sense orthogonal to the building blocks of the recently discovered infinite descending chain. As a…
We work in set-theory without choice ZF. Denoting by AC(N) the countable axiom of choice, we show in ZF+AC(N) that the closed unit ball of a uniformly convex Banach space is compact in the convex topology (an alternative to the weak…
Lattice power-counting is extended to QCD with staggered fermions. As preparation, the difficulties encountered by Reisz's original formulation of the lattice power-counting theorem are illustrated. One of the assumptions that is used in…
The main aim of the article is to show, in the absence of the Axiom of Choice, relationships between the following, independent of $\mathbf{ZF}$, statements: "Every countable product of compact metrizable spaces is separable (respectively,…
In this paper, the class of all linearly ordered topological spaces (LOTS) quasi-ordered by the embeddability relation is investigated. In ZFC it is proved that for countable LOTS this quasi-order has both a maximal (universal) element and…
Using Kripke models, it is shown that CZF does not prove Power Set, and that CZF with Subset Collection substituted by Exponentiation does not prove Subset Collection.
We show in ZFC that there is no set of reals of size continuum which can be translated away from every set in the Marczewski ideal. We also show that in the Cohen model, every set with this property is countable.
A new construction is given of non-standard uniserial modules over certain valuation domains; the construction resembles that of a special Aronszajn tree in set theory. A consequence is the proof of a sufficient condition for the existence…
Recently, the Elementary Process Theory (EPT) has been developed as a set of fundamental principles that might underlie a gravitational repulsion of matter and antimatter. This paper presents set matrix theory (SMT) as the foundation of the…
Constructive theories usually have interesting metamathematical properties where explicit witnesses can be extracted from proofs of existential sentences. For relational theories, probably the most natural of these is the existence…
A question dating to Sibe Marde\v{s}i\'{c} and Andrei Prasolov's 1988 work Strong homology is not additive, and motivating a considerable amount of set theoretic work in the ensuing years, is that of whether it is consistent with the ZFC…