Hostname: page-component-7b7567c8c-w7t8q Total loading time: 0 Render date: 2026-11-18T05:03:35.128Z Has data issue: false hasContentIssue false

Notions of weak genericity

Published online by Cambridge University Press:  12 March 2014

Stuart A. Kurtz*
Affiliation:
University of Illinois at Urbana-Champaign, Urbana, Illinois 61801University of Chicago, Chicago, Illinois 60637

Extract

This paper deals with forcing in arithmetic (as first introduced by Feferman [2]) and its connections with recursive function theory. We define for each n ≥ 1 the class of weakly n-generic sets. We prove that these classes merge with the classes of n-generic sets to form the hierarchy suggested by the terminology. Our notation is the same as that of Jockusch [5].

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1983

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable