相关论文: Non Cohen Oracle c.c.c

In [arXiv:1006.4939] the enumeration order reducibility is defined on natural numbers. For a c.e. set A, [A] denoted the class of all subsets of natural numbers which are co-order with A. In definition 5 we redefine co-ordering for rational…

We develop synthetic notions of oracle computability and Turing reducibility in the Calculus of Inductive Constructions (CIC), the constructive type theory underlying the Coq proof assistant. As usual in synthetic approaches, we employ a…

We define a $C(k)$ to be a family of $k$ sets $F_1,\dots,F_k$ such that $\textrm{conv}(F_i\cup F_{i+1})\cap \textrm{conv}(F_j\cup F_{j+1})=\emptyset$ when $\{i,i+1\}\cap \{j,j+1\}=\emptyset$ (indices are taken modulo $k$). We show that if…

We define a nontrivial version of the square principle $\Box_\omega$, which we then show consistent by means of forcing with finite conditions. This paper has been withdrawn by the author due to the fact that the presented $\Box_\omega$ can…

Deep clustering aims to learn a clustering representation through deep architectures. Most of the existing methods usually conduct clustering with the unique goal of maximizing clustering performance, that ignores the personalized demand of…

Conformal methods provide prediction sets for outcomes with confidence guarantees. We study their use in a selective inference setting, where inference is performed only when the prediction set is informative. The analyst may consider as…

Classical game theory treats players as special---a description of a game contains a full, explicit enumeration of all players---even though in the real world, "players" are no more fundamentally special than rocks or clouds. It isn't…

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…

In a self-contained way, we deal with revised countable support iterated forcing for the reals. We improve theorems on preservation of the property UP, weaker than semi proper, and we hopefully improve the presentation. We continue [Sh:b,…

Assume $\kappa = \kappa^{< \kappa}$ (usually $\aleph_0$ or an inaccessible). We shall deal with iterated forcings preserving ${}^{\kappa>}{\rm Ord}$ and not collapsing cardinals along a linear order $L$. A sufficient condition for this,…

We study uncountable structures similar to the Fra\"iss\'e limits. The standard inductive arguments from the Fra\"iss\'e theory are replaced by forcing, so the structures we obtain are highly sensitive to the universe of set theory. In…

These notes present a compact and self-contained approach to iterated forcing with a particular emphasis on semiproper forcing. We tried to make our presentation accessible to any scholar who has some familiarity with forcing and boolean…

In this paper we extend previous studies of selection principles for families of open covers of sets of real numbers to also include families of countable Borel covers. The main results of the paper could be summarized as follows: 1. Some…

We consider partially ordered sets of combinatorial structures under consecutive orders, meaning that two structures are related when one embeds in the other such that `consecutive' elements remain consecutive in the image. Given such a…

We present a systematic study of the method of "norms on possibilities" of building forcing notions with keeping their properties under full control. This technique allows us to answer several open problems, but on our way to get the…

We define and study a new type of quantum oracle, the quantum conditional oracle, which provides oracle access to the conditional probabilities associated with an underlying distribution. Amongst other properties, we (a) obtain speed-ups…

For a relational structure ${\mathbb X}$ we investigate the partial order $\langle {\mathbb P} ({\mathbb X}) ,\subset \rangle$, where ${\mathbb P} ({\mathbb X}):=\{ f[X]: f\in \mathop{\rm Emb}\nolimits ({\mathbb X})\}$. Here we consider…

Semi-supervised active clustering (SSAC) utilizes the knowledge of a domain expert to cluster data points by interactively making pairwise "same-cluster" queries. However, it is impractical to ask human oracles to answer every pairwise…

The aim of this paper is to provide some theoretical understanding of quasi-Bayesian aggregation methods non-negative matrix factorization. We derive an oracle inequality for an aggregated estimator. This result holds for a very general…

We exhibit a family of computably enumerable sets which can be learned within polynomial resource bounds given access only to a teacher, but which requires exponential resources to be learned given access only to a membership oracle. In…