#### Filter Results:

- Full text PDF available (9)

#### Publication Year

2004

2012

- This year (0)
- Last 5 years (1)
- Last 10 years (7)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Kevin M. Woods, Imre Bárány, +4 authors Bart Kastermans
- 2004

ACKNOWLEDGEMENTS My thanks to the many people whose thoughts have contributed to this thesis and to my mathematical development, including In particular, my collaborations with Tyrrell McAllister and Herb Scarf have been tremendously invaluable. Many thanks to my doctoral committee, especially John Stembridge for his careful reading of this thesis. I am… (More)

- Rodney G. Downey, Bart Kastermans, Steffen Lempp
- J. Symb. Log.
- 2009

We make progress toward solving a long-standing open problem in the area of computable linear orderings by showing that every computable η-like linear ordering without an infinite strongly η-like interval has a computable copy without nontrivial computable self-embedding. The precise characterization of those computable linear order-ings which have… (More)

- Bart Kastermans, Juris Steprans, Yi Zhang
- J. Symb. Log.
- 2008

If F ⊆ N N is an analytic family of pairwise eventually different functions then the following strong maximality condition fails: For any countable H ⊆ N N, no member of which is covered by finitely many functions from F , there is f ∈ F such that for all h ∈ H there are infinitely many integers k such that f (k) = h(k). However if V = L then there exists a… (More)

- Bart Kastermans, Steffen Lempp
- Theor. Comput. Sci.
- 2010

It is an open problem in the area of computable ran-domness whether Kolmogorov-Loveland randomness coincides with Martin-Löf randomness. Joe Miller and André Nies suggested some variations of Kolmogorov-Loveland randomness to approach this problem and to provide a partial solution. We show that their proposed notion of partial permutation randomness is… (More)

- Bart Kastermans, Yi Zhang
- Ann. Pure Appl. Logic
- 2006

We consider the possible cardinalities of the following three cardinal invariants which are related to the permutation group on the set of natural numbers: a g := the least cardinal number of maximal cofinitary permutation groups; a p := the least cardinal number of maximal almost disjoint permutation families; c(Sym(N)) := the cofinality of the permutation… (More)

- Bart Kastermans
- Bulletin of Symbolic Logic
- 2009

- Carl G. Jockusch, Bart Kastermans, Steffen Lempp, Manuel Lerman, Reed Solomon
- J. Symb. Log.
- 2009

Hirschfeldt and Shore have introduced a notion of stability for infinite posets. We define an arguably more natural notion called weak stability, and we study the existence of infinite computable or low chains or antichains, and of infinite Π 0 1 chains and antichains, in infinite computable stable and weakly stable posets. For example, we extend a result… (More)

ACKNOWLEDGEMENTS This thesis is the result of research I have done while I was a PhD student at the University of Michigan. I would like to thank everyone who has played a part in my doing this. In particular I am grateful to Andreas Blass for being an excellent advisor, Peter Hinman for many nice discussions and much information about recursion theory, and… (More)

The notion of very mad family is a strengthening of the notion of mad family of functions. Here we show existence of very mad families in different contexts.