Old Web
English
Sign In
Acemap
>
Paper
>
Applications of forcing to definability problems in the arithmetical hierarchy
Applications of forcing to definability problems in the arithmetical hierarchy
1970
Alan L. Selman
Keywords:
Combinatorics
Analytical hierarchy
Arithmetical hierarchy
Computability theory
Arithmetical set
Forcing (mathematics)
Discrete mathematics
Mathematics
Algebra
recursive functions
Correction
Source
Cite
Save
Machine Reading By IdeaReader
7
References
1
Citations
NaN
KQI
[]