Author(s): George Metakides
Series: Studies in Logic & Mathematics
Publisher: Elsevier Science Ltd
Year: 1982
Language: English
Pages: 386
Edited by......Page 1
Copyright page......Page 2
Prologos......Page 3
Recursive Functionals and Quantifiers of Finite Types Revisited III......Page 4
Recursion Theory on Matroids......Page 44
Recursion Theory and Abstract Dependence......Page 69
Major Subsets in Effective Topology......Page 79
Effective Isomorphisms of Algebraic Structures......Page 97
Recursive Linear Orderings......Page 125
External and Internal Algorithms on the Continuous Functionals......Page 139
The Turing Degrees and the Metadegrees have Isomorphic Cones*......Page 147
Symmetric Groups and the Open Sentence Problem......Page 160
Iterated Inductive Fixed-Point Theories: Application to Hancock's Conjecture......Page 171
A Finite Combinatorial Principle Which is Equivalent to the 1-Consistency of Predicative Analysis......Page 197
The Addison Game Played Backwards: Index Sets in Topology......Page 231
Analytic Equivalence Relations and Coanalytic Games......Page 238
Model Theory and Lattices of Formulas......Page 260
Saturated Ideals and Nonregular Ultrafilters......Page 295
What are R-Sets?......Page 304
Global and Local Admissibility......Page 322
Morass-Level Combinatorial Principles......Page 336
Generalized Quantifiers in Models of Set Theory......Page 356
-Theorems and Elimination Theorems of Uniqueness Conditions......Page 369
List of Participants......Page 384
