Selected Logic Papers PDF Download

The author selects 23 of his papers in mathematical logic that pursue definability via priority, forcing, compactness and fine structure applied to classical recursion, hyperarithmetic sets, recursion in objects of finite type, measure, models and E-recursion. His general introduction provides a chronology both personal and technical. Contents:On the Degrees Less Than 0'Recursive Enumerability and the Jump OperatorThe Recursively Enumerable Degrees are DenseA Simple Set Which is Not Effectively SimpleMetarecursive Sets (with G Kreisel)Post's Problem, Admissible Ordinals, and RegularityOn a Theorem of Lachlan and MartinA Minimal Hyperdegree (with R O Gandy)Measure-Theoretic Uniformity in Recursion Theory and Set TheoryRecursion in Objects of Finite TypeForcing with Perfect Closed SetsThe α-Finite Injury Method (with S G Simpson)The 1-Section of a Type n ObjectRemarks Against Foundational ActivityCountable Admissible Ordinals and HyperdegreesThe k-Section of a Type n ObjectEffective Bounds on Morley RankPost's Problem, Absoluteness and Recursion in Finite TypesOn the Number of Countable ModelsPost's Problem in E-RecursionThe Limits of E-Recursive EnumerabilityInadmissible Forcing (with T A Slaman)Effective Forcing Versus Proper Forcing Readership: Mathematical logicians and computer scientists. keywords:Recursion Theory;Computability Theory;Classical Degree Theory;Alpha-Recursion;E-Recursion;Model Theory;Splitting;Density;Jump "... this volume, together with Sacks' monograph on the subject, will be a useful source of information to those who want to bring life to the subject again." Mathematical Reviews