相关论文: Unprepared Indestructibility
We develop a general, non-probabilistic model of prediction which is suitable for assessing the (un)predictability of individual physical events. We use this model to provide, for the first time, a rigorous proof of the unpredictability of…
Assuming the negation of Chang's conjecture, there is a c.c.c. forcing which adds a strongly non-saturated Aronszajn tree. Using a Mahlo cardinal, we construct a model in which there exists a strongly non-saturated Aronszajn tree and the…
The forcing theorem is the most fundamental result about set forcing, stating that the forcing relation for any set forcing is definable and that the truth lemma holds, that is everything that holds in a generic extension is forced by a…
It is shown that Vop\v{e}nka's Principle (VP) can restore almost the entire ZF over a weak fragment of it. Namely, if EST is the theory consisting of the axioms of Extensionality, Empty Set, Pairing, Union, Cartesian Product,…
A recently proposed axiom system for Andr\'e's central translation structures is improved upon. First, one of its axioms turns out to be dependent (derivable from the other axioms). Without this axiom, the axiom system is indeed…
I survey an array of topics in set theory in the context of a novel class of forcing notions: subcomplete forcing. Subcompleteness was originally defined by Ronald Jensen. I have attempted to make the subject somewhat more approachable to…
This article is motivated by the fact that there is a distinction between the descriptions of logical explosion from syntactic and semantic points of view. The discussion is illustrated using the concept of abstract model structures and the…
We prove that Vop\v{e}nka's Principle implies that for every class $\mathfrak{X}$ of modules over any ring, the class of \textbf{$\boldsymbol{\mathfrak{X}}$-Gorenstein Projective modules}…
Independence of premise principles play an important role in characterizing the modified realizability and the Dialectica interpretations. In this paper we show that a great many intuitionistic set theories are closed under the…
We study relationships between various set theoretic compactness principles, focusing on the interplay between the three families of combinatorial objects or principles mentioned in the title. Specifically, we show the following. (1) Strong…
Unlike mathematics, in which the notion of truth might be abstract, in physics, the emphasis must be placed on algorithmic procedures for obtaining numerical results subject to the experimental verifiability. For, a physical science is…
The purpose of this article is to give a presentation of the method of forcing aimed at someone with a minimal knowledge of set theory and logic. The emphasis will be on how the method can be used to prove theorems in ZFC.
We present a coherent collection of finite mathematical theorems some of which can only be proved by going well beyond the usual axioms for mathematics. The proofs of these theorems illustrate in clear terms how one uses the well studied…
On August 5, 2005 in the American Mathematical Society Summer Institute on Algebraic Geometry in Seattle and later in several conferences I gave lectures on my analytic proof of the finite generation of the canonical ring for the case of…
In this paper, we give out some effective criterions which can be used to judge the separability of multipartite pure states. We obtain the relationship between separability and Schmidt decomposable of multipartite pure states in Theorem1.…
This work represents a translation from English into Russian of the second part of the monograph by Alexander Kiselev under the same title. It contains the proof (in ZF) of inaccessible cardinals nonexistence. The first edition of this work…
We investigate the provability of classical combinatorial theorems in ZF. Using combinatorial arguments, we establish the following results for each infinite cardinal ${\kappa}\in On$, (1) ${\kappa}^+\to ({\kappa},{\omega}+1)$, (2) any…
We present a set-theoretic, proof-irrelevant model for Calculus of Constructions (CC) with predicative induction and judgmental equality in Zermelo-Fraenkel set theory with an axiom for countably many inaccessible cardinals. We use Aczel's…
We begin with a context more general than set theory. The basic ingredients are essentially the object and functor primitives of category theory, and the logic is weak, requiring neither the Law of Excluded Middle nor quantification. Inside…
Let $A$ be a finite-dimensional algebra over an algebraically closed field $\Bbbk$. For any finite-dimensional $A$-module $M$ we give a general formula that computes the indecomposable decomposition of $M$ without decomposing it, for which…