Book contents
- Frontmatter
- Preface
- Opening speech of Petr Vopěnka
- Bolzano Medal awarded to Gaisi Takeuti
- Contents
- Collapsing Polynomial-Time Degrees
- Qualitative and Probabilistic Models of Full Belief
- Relative Splittings of in the-Enumeration Degrees
- A Realizability Interpretation for Classical Arithmetic
- An Axiomatization of Quantified Propositional Gödel Logic Using the Takeuti-Titani Rule
- Another Pathological Well-Ordering
- How Small Can the Set of Generics Be?
- Entailment Relations and Distributive Lattices
- The Friedberg Jump Inversion Theorem Revisited: A Study of Undefinable Cuts
- Hartley Rogers’ 1965 Agenda
- Liftings of Homomorphisms Between Quotient Structures and Ulam Stability
- Mathematical Fuzzy Logic – State of Art
- Reflections on the Last Delfino Problem
- Continuous Images of Coanalytic Sets
- Classification of Subsheaves over GL-Algebras
- On the Bit-Comprehension Rule
- Cardinal Invariants Associated with Predictors
- A Theorem on Countable Ordered Sets with an Application to Universal Graphs
- Dimension Theory and Smooth Stratification of Rigid Subanalytic Sets
- The Ramsey Structure of A-Determined Sets in a Saturated Universe
- On Definability of Admissible Sets
- Additive Theories
- Adding Multiplication to an O-minimal Expansion of the Additive Group of Real Numbers
- The Superjump in Martin-Löf Type Theory
- “Just Because”: Taking Belief Bases Seriously
- Artin Approximation via the Model Theory of Cohen-Macaulay Rings
- Ordinal Systems, Part 2: One Inaccessible
- Autonomous Fixed Point Progressions and Fixed Point Transfinite Recursion
- Finitary Reductions for Local Predicativity, I: Recursively Regular Ordinals
- The Complexity of Linear Logic with Weakening
- Some Remarks on the Maximality of Inner Models
- Author Index
- References
Hartley Rogers’ 1965 Agenda
Published online by Cambridge University Press: 31 March 2017
Book contents
- Frontmatter
- Preface
- Opening speech of Petr Vopěnka
- Bolzano Medal awarded to Gaisi Takeuti
- Contents
- Collapsing Polynomial-Time Degrees
- Qualitative and Probabilistic Models of Full Belief
- Relative Splittings of in the-Enumeration Degrees
- A Realizability Interpretation for Classical Arithmetic
- An Axiomatization of Quantified Propositional Gödel Logic Using the Takeuti-Titani Rule
- Another Pathological Well-Ordering
- How Small Can the Set of Generics Be?
- Entailment Relations and Distributive Lattices
- The Friedberg Jump Inversion Theorem Revisited: A Study of Undefinable Cuts
- Hartley Rogers’ 1965 Agenda
- Liftings of Homomorphisms Between Quotient Structures and Ulam Stability
- Mathematical Fuzzy Logic – State of Art
- Reflections on the Last Delfino Problem
- Continuous Images of Coanalytic Sets
- Classification of Subsheaves over GL-Algebras
- On the Bit-Comprehension Rule
- Cardinal Invariants Associated with Predictors
- A Theorem on Countable Ordered Sets with an Application to Universal Graphs
- Dimension Theory and Smooth Stratification of Rigid Subanalytic Sets
- The Ramsey Structure of A-Determined Sets in a Saturated Universe
- On Definability of Admissible Sets
- Additive Theories
- Adding Multiplication to an O-minimal Expansion of the Additive Group of Real Numbers
- The Superjump in Martin-Löf Type Theory
- “Just Because”: Taking Belief Bases Seriously
- Artin Approximation via the Model Theory of Cohen-Macaulay Rings
- Ordinal Systems, Part 2: One Inaccessible
- Autonomous Fixed Point Progressions and Fixed Point Transfinite Recursion
- Finitary Reductions for Local Predicativity, I: Recursively Regular Ordinals
- The Complexity of Linear Logic with Weakening
- Some Remarks on the Maximality of Inner Models
- Author Index
- References
- Type
- Chapter
- Information
- Logic Colloquium '98 , pp. 154 - 172Publisher: Cambridge University PressPrint publication year: 2000
References
1. [1983], Automorphism bases for the r.e. degrees (abstract), in Extended Abstracts of Short Talks of the 1982 Summer Institute on Recursion Theory Held at Cornell University (I. Kalantari, ed.), special publication of Recursive Function Theory Newsletter, pp. 3–4.
4. [1995], Automorphisms of the Lattice of Recursively Enumerable Sets, Memoirs Amer. Math. Soc., Vol. 113, No. 541.Google Scholar
5. [1936], A note on the Entscheidungsproblem, J. Symbolic Logic 1, 40–41 and 101–102.Google Scholar
6. [1990a], The jump is definable in the structure of the degrees of unsolvability, Bull. Amer. Math. Soc. 23, 151–158.Google Scholar
7. [1990b], Enumeration reducibility, nondeterministic computations and relative computability of partial function, in Recursion TheoryWeek, Oberwolfach 1989 (, , , eds.), Springer-Verlag, Berlin, Heidelberg, New York, 57–110.
8. [1994], Rigidity and definability in the non-computable universe, Logic,Methodology and Philosophy of Science IX, Proceedings of the Ninth InternationalCongress of Logic, Methodology and Philosophy of Science, Uppsala, Sweden, August 7–14,1991 (, and , eds.), North-Holland, Amsterdam, Lausanne, New York, Oxford, Shannon, Tokyo, pp. 209–236.
9. [1997], Beyond Gödel's Theorem: The failure to capture information content, in Complexity, Logic and Recursion Theory (, ed.), Lecture Notes in Pure and Applied Mathematics, vol. 187, Marcel Dekker, New York, pp. 93–122.
10. [1999], Clockwork or Turing U/universe? – remarks on causal determinism and computability, in Models and Computability ( and , eds.), London Mathematical Society Lecture Note Series 259, Cambridge University Press, pp. 63–116.
12. and [1997], There is no degree invariant half-jump, Proc. Amer. Math. Soc. 125, 3033–3037.Google Scholar
13. [1976], Certain properties of the Medvedev lattice,Matmatičeskiî Sbornik 101 (143), 360–379 (Russian); Math. Notes 30, 321–340 (English tr.).Google Scholar
15. and , Jr. [1959], Reducibility and completeness for sets of integers, Z. Math. Logik Grundlag.Math. 5, 117–125.Google Scholar
16. [1971], Some Results on Enumeration Reducibility, Ph.D. Dissertation, Simon Fraser University.
17. and [1998], Coding in the partial order of enumerable sets, Adv. Math. 133, 133–162.Google Scholar
18. and [1996], Definability, automorphisms, and dynamic properties of computably enumerable sets, Bull. Symbolic Logic 2, 199–213.Google Scholar
19. [1984], The undecidability of the elementary theory of the lattice of recursively enumerable sets (abstract), in Frege Conference 1984, Proceedings of the International Conference at Schwerin, GDR, Akademie-Verlag, Berlin, pp. 66–72.
21. , Jr. and [1981], Automorphism bases for degrees of unsolvability, Israel J. Math. 40, 150–164.Google Scholar
22. , Jr. and [1984], Pseudo jump operators II: Transfinite iterations, hierarchies, and minimal covers, J. Symbolic Logic 49, 1205–1236.Google Scholar
23. , Jr. and [1976], A degree theoretic definition of the ramified analytical hierarchy, Ann. Math. Logic 10, 1–32.Google Scholar
24. [1962], Constructive analogues of the group of permutations of the natural numbers, Trans. Amer. Math. Soc. 104, 347–362.Google Scholar
25. [1962], The Structure of Scientific Revolutions (Third edition 1996), University of Chicago Press, Chicago, London.
26. [1968a], Degrees of recursively enumerable sets which have no maximal superset, J. Symbolic Logic 33, 431–443.Google Scholar
27. [1983], Degrees of Unsolvability, Perspectives in Mathematical Logic, Omega Series, Springer-Verlag, Berlin, Heidelberg, London, New York, Tokyo.
28. [1966], Classes of recursively enumerable sets and degrees of unsolvability, Z. Math. Logik Grundlag.Math. 12, 295–310.Google Scholar
29. [1968], The axiom of determinateness and reduction principles in the analytical hierarchy, Bull. Amer. Math. Soc. 74, 687–689.Google Scholar
30. [1984], The Structure of the Enumeration Degrees, Ph.D. thesis, University of Leeds.
31. [1955], Degrees of difficulty of the mass problem, Dokl. Akad. Nauk SSSR N.S. 104, 501–504 (Russian).
33. and [1980a], Second order logic and first order theories of reducibility orderings, in The Kleene Symposium ( et al., eds.), North-Holland, Amsterdam, pp. 181-200.
34. and [1980b], Reducibility orderings: theories, definability and automorphisms, Ann. Math. Logic 18, 61–89.Google Scholar
35. [1997], Intervals of the lattice of computably enumerable sets and effective Boolean algebras, Bull. London Math. Soc. 29, 683–692.Google Scholar
36. , , [1996], Definability in the recursively enumerable degrees, Bull. Symbolic Logic 2, 392–404.Google Scholar
37. , , [1998], Interpretability and definability in the recursively enumerable degrees, Proc. London Math. Soc. (3) 77, 241–291.Google Scholar
38. [1989], Classical Recursion Theory, North-Holland, Amsterdam, New York, Oxford.
39. [ta1], Reducibilities, to appear in The Handbook of Computability Theory (, ed.), North-Holland, Amsterdam, New York, Oxford.
40. [ta2], Classical Recursion Theory, Vol. II, North-Holland, Amsterdam, New York, Oxford, to appear.
41. [1944], Recursively enumerable sets of positive integers and their decision problems, Bull. Amer. Math. Soc. 50, 284–316.Google Scholar
42. [1948], Degrees of unsolvability: preliminary report (abstract), Bull. Amer.Math. Soc. 54, 641–642.Google Scholar
43. , Jr. [1967a], Some problems of definability in recursive function theory, in Sets, Models and Recursion Theory (, ed.), Proceedings of the Summer School in Mathematical Logic and Tenth Logic Colloquium, Leicester, August-September, 1965, North Holland, Amsterdam, pp. 183–201.
44. , Jr. [1967b], Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York.
45. [1978], The semi-lattice of e-degrees, in Recursive Functions, Ivanov.Gos. Univ., Ivanovo, 71–84 (Russian).
47. [1966], Degrees of Unsolvability (revised edition), Ann. of Math. Studies No. 55, Princeton University Press, Princeton, N.J.
48. [1985], Some open questions in recursion theory, in Recursion Theory Week (, and , eds.), Proceedings of a Conference held in Oberwolfach, West Germany, April 15-21, 1984, Lecture Notes in Mathematics No. 1141, Springer-Verlag, Berlin, Heidelberg, New York, Tokyo, pp. 333-342.
49. [1971], Arithmetical reducibilities I, Z. Math. Logik Grundlag. Math. 17, 335–350.Google Scholar
52. [1977], First-order theory of the degrees of recursive unsolvability, Ann.of Math. (2) 105, 121–139.Google Scholar
53. [1991], Degree structures, in Proceedings of the International Congress of Mathematicians, Kyoto, 1990, Springer-Verlag, Berlin, Heidelberg, London, New York, Tokyo, pp. 303–316.
55. [1974a], Automorphisms of the lattice of recursively enumerable sets, Bull.Amer. Math. Soc. 80, 53–58.Google Scholar
56. [1974b], Automorphisms of the lattice of recursively enumerable sets, Part I: Maximal sets, Ann. Math. (2) 100, 80–120.Google Scholar
57. [1987], Recursively Enumerable Sets and Degrees, Springer-Verlag, Berlin, Heidelberg, London, New York.
58. [1990], Some remarks on the algebraic structure of the Medvedev lattice, J. Symbolic Logic 55, 831–853.Google Scholar
59. [1996], The Medvedev lattice of degrees of difficulty, in Computability, Enumerability,Unsolvability: Directions in Recursion Theory (, and , eds.), London Mathematical Society Lecture Note Series 224, Cambridge University Press, Cambridge, 289–312.
60. [1998], Sets of generators and automorphism bases for the enumeration degrees Ann. Pure and Applied Logic 94, 263–272.Google Scholar
61. [1936], On computable numbers, with an application to the Entscheidungsproblem, Proc. London Math. Soc. 42, 230–265.Google Scholar
62. [1939], Systems of logic based on ordinals, Proc. London Math. Soc. 45, 161–228; reprinted in The Undecidable. Basic Papers on Undecidable Propositions, Unsolvable Problems, and Computable Functions (, ed.), Raven Press, New York, 1965, pp. 154–222.