相关论文: Solovay-type characterizations for forcing-algebra…

We systematically investigate the complexity of model checking the existential positive fragment of first-order logic. In particular, for a set of existential positive sentences, we consider model checking where the sentence is restricted…

Chain conditions are one of the major tools used in the theory of forcing. We say that a partial order has the countable chain condition if every antichain (in the sense of forcing) is countable. Without the axiom of choice antichains tend…

The forcing method is a powerful tool to prove the consistency of set-theoretic assertions relative to the consistency of the axioms of set theory. Laver's theorem and Bukovsk\'y's theorem assert that set-generic extensions of a given…

We define a notion of pseudo-unitarizability for weight modules over a generalized Weyl algebra (of rank one, with commutative coeffiecient ring $R$), which is assumed to carry an involution of the form $X^*=Y$, $R^*\subseteq R$. We prove…

The notion of clause set cycle abstracts a family of methods for automated inductive theorem proving based on the detection of cyclic dependencies between clause sets. By discerning the underlying logical features of clause set cycles, we…

In this expository paper aimed at a general mathematical audience, we discuss how to combine certain classic theorems of set-theoretic inner model theory and effective descriptive set theory with work on Hilbert's tenth problem and…

In this paper we show that if $(X,\mathcal{A})$ is a measurable space and if $Y$ is a topological model of a Lawvere theory $\mathcal{T}$ equipped with $\mathcal{B}$ the Borel $\sigma$-algebra on $Y$, then the set of…

We modify arguments in Vladimir Kanovei, Linearization of definable order relations, APAL, 102(1-2):69--100, 2000, to reprove a linearization theorem on real-ordinal definable partial quasi-orderings in the Solovay model.

We prove that Solovay's set $\Sigma$ is generic over the ground model via a forcing notion whose order relation $\subseteq$-extends the given order relation.

We consider the fragment F of first order arithmetic in which quantification is restricted to ''for all but finitely many.'' We show that the integers form an F-elementary substructure of the real numbers. Consequently, the F-theory of…

We say that a set is exhaustible if it admits algorithmic universal quantification for continuous predicates in finite time, and searchable if there is an algorithm that, given any continuous predicate, either selects an element for which…

We first show that in the function realizability topos every metric space is separable, and every object with decidable equality is countable. More generally, working with synthetic topology, every $T_0$-space is separable and every…

We present necessary and sufficient conditions for the existence of a countably additive measure on a complete Boolean algebra.

We introduce and study a multiplicative analogue of additive indecomposability for linear order types that we call untranscendability, as well as a strengthening that we call $s$-untranscendability. We show that, with the unique exception…

In various models of set theory, we consider covering Aleph_1 x Aleph_1 rectangles by countably many smooth curves, and we study differentiable isomorphisms between Aleph_1-dense sets of reals.

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…

A function F:R^2->R is sup-measurable if F_f:R->R given by F_f(x)=F(x,f(x)), x in R, is measurable for each measurable function f:R->R. It is known that under different set theoretical assumptions, including CH, there are sup-measurable…

We employ the notions of `sequential function' and `interrogation' (dialogue) in order to define new partial combinatory algebra structures on sets of functions. These structures are analyzed using J. Longley's preorder-enriched category of…

We lay the ground for an Isabelle/ZF formalization of Cohen's technique of forcing. We formalize the definition of forcing notions as preorders with top, dense subsets, and generic filters. We formalize the definition of forcing notions as…

We investigate predicative aspects of order theory in constructive univalent foundations. By predicative and constructive, we respectively mean that we do not assume Voevodsky's propositional resizing axioms or excluded middle. Our work…