相关论文: Set theory without choice: not everything on cofin…

Let H be a separable, infinite dimensional Hilbert space and let S be a countable subset of H. Then most positive operators on H have the property that every nonzero vector in the span of S is cyclic, in the sense that the set of operators…

Kelley-Morse set theory KM is weaker than generally supposed and fails to prove several principles that may be desirable in a foundational second-order set theory. Even though KM includes the global choice principle, for example, (i) KM…

We study the consistency strength of Lebesgue measurability for $\Sigma^1_3$ sets over Zermelo set theory ($Z$) in a completely choiceless context. We establish a result analogous to the Solovay-Shelah theorem.

We prove, assuming resolution of singularities in positive characteristic, an analogue of Siegel's theorem on sum of squares in positive characteristic. The method of proof combines techniques from central simple algebras with model theory…

In this 1997 Ph.D. dissertation we prove a piecewise form of the discrete part of Wilf and Zeilberger's 1992 conjecture that a hypergeometric term is proper if and only if it is holonomic. We show that a holonomic hypergeometric term on…

We show that the incompatibility of a set of measurements cannot be increased by subjecting them to a filter, namely, by combining them with a device that post-selects the incoming states on a fixed outcome of a stochastic transformation.…

In this paper, we study the continuity of rational functions realized by B\"uchi finite state transducers. It has been shown by Prieur that it can be decided whether such a function is continuous. We prove here that surprisingly, it cannot…

We investigate the mathematics of a model of the human mind which has been proposed by the psychologist Jens Mammen. Mathematical realizations of this model consist of so-called \emph{Mammen spaces}, where a Mammen space is a triple…

The basic problem posed by free will (FW) for physics appears to be not the \textit{physical} one of whether it is compatible with the laws of physics, but the \textit{logical} one of how to consistently define it, since it incorporates the…

Let $\mu$ be a probability measure on $\mathbb{Z}$ that is not a Dirac mass and that has finite support. We prove that if the coefficients of a monic polynomial $f(x)\in\mathbb{Z}[x]$ of degree $n$ are chosen independently at random…

We show that for any $k\in\omega$, the structure $(H_k,\in)$ of sets that are hereditarily of size at most $k$ is decidable. We provide a transparent complete axiomatization of its theory, a quantifier elimination result, and tight bounds…

This is a slightly corrected version of an old work. For a cardinal $\mu$ we give a sufficient condition $\oplus_\mu$ (involving ranks measuring existence of independent sets) for: $\otimes_\mu$ if a Borel set $B\subseteq \mathbb{R} \times…

In this version small mistakes are corrected and the exposition is changed as suggested by the referee (to appear in Canadian Journal of Mathematics). The first main result of the paper is a criterion for a partially commutative group $\GG$…

Krueger showed that PFA implies that for all regular $\Theta \ge \aleph_2$, there are stationarily many $[H(\Theta)]^{\aleph_1}$ that are internally club but not internally approachable. From countably many Mahlo cardinals, we force a model…

The positive existential theories of the sets $M_n(\mathbb N)$ without parameters build an inclusion lattice isomorhic with the lattice of divisibility. All these sets are algorithmically undecidable. In further sections some easier…

We prove, for stably computably enumerable formal systems, direct analogues of the first and second incompleteness theorems of G\"odel. A typical stably computably enumerable set is the set of Diophantine equations with no integer…

We show that the problem `whether a finite set of regular-linear axioms defines a rigid theory' is undecidable.

This paper investigates the problem of extending measure theory to non-separable structures, from generalized descriptive set theory to a broader class of spaces beyond this framework. While various notions, such as the ideal of measure…

The main theorem of this article is that every countable model of set theory M, including every well-founded model, is isomorphic to a submodel of its own constructible universe. In other words, there is an embedding $j:M\to L^M$ that is…

We study $\omega$-categorical $MS$-measurable structures. Our main result is that a class of $\omega$-categorical Hrushovski constructions, supersimple of finite $SU$-rank is not $MS$-measurable. These results complement the work of Evans…