Searching for "P-Generic Sets." – sorted by Relevance.
-
A Note on Genericity and Bi-Immunity
- -immunity by proposing an extended notion of bi-immunity that exactly characterizes the p-generic sets. 1 Introduction
- Cited by 7 (2 self) – Add To MetaCart
-
Genericity and Measure for Exponential Time
- of the corresponding facts for the tally p-generic sets in [2] (see [2], Theorem 5.9). Note that, for any set A, AA p
- Cited by 26 (1 self) – Add To MetaCart
-
Resource Bounded Randomness and Weakly Complete Problems
- .1 Let A be n c+1 -random. Then A is n c -generic. Hence any prandom set is p-generic. Proof. Let C
- Cited by 36 (6 self) – Add To MetaCart
-
Almost Weakly 2-Generic Sets
- theory [3, 13, 23, 25, 9]. For example, Ambos-Spies, Fleischhack, & Huwig introduced p-generic sets in [2
- Cited by 1 (1 self) – Add To MetaCart
-
Definability in the Enumeration Degrees
- kp; – kq is greater than or equal to kp. Given a P-generic set G, let Fi,G and Gi,G be the unions
- Cited by 3 (1 self) – Add To MetaCart
-
A partition theorem for pairs of finite sets
- ne a forcing notion P that produces a generic co nal homogeneous set for F , and then show that P
- Cited by 1 (0 self) – Add To MetaCart
-
A PARTITION THEOREM FOR PAIRS OF FINITE SETS
- homogeneous set for F . In fact, we define a forcing notion P that produces a generic cofinal homogeneous set
- Add To MetaCart
-
A Finite-State Approach to Event Semantics
- ) be the set of Φ(Time)-models generated by P -generic sets MOD(P ) = {Time(G) | G is P -generic} , and (going
- Cited by 3 (3 self) – Add To MetaCart
-
A Finite-State Approach to Event Semantics
- ∋ p. Given P ⊆ P (ET, Time, Oτ ), let MOD(P ) be the set of Φ(Time)-models generated by P -generic
- Add To MetaCart
-
A coherent family of partial functions on
- are pairwise compatible. Theorem 1. If f = fG = � p∈G fp for a P-generic set G, thenfα(defined by fα(k)=f(α, k
- Cited by 3 (1 self) – Add To MetaCart

