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
Collapsing Polynomial-Time Degrees
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. 1 - 24Publisher: Cambridge University PressPrint publication year: 2000
References
1. . News fromthe isomorphism front. Bulletin of the European Association for Computer Science 66:73–81, 1998.Google Scholar
2. . Inhomogeneities in the polynomial-time degrees: the degrees of super sparse sets. Information Processing Letters 22:113–117, 1986.Google Scholar
3. . Resource-bounded genericity. In: et al., editors, Computability, Enumerability, Unsolvability: Directions in Recursion Theory. London Mathematical Society Lecture Note Series 224, 1–59. Cambridge University Press, 1996.
4. . Polynomial reducibilities and complete sets. Ph.D. dissertation, Cornell University, 1977.
5. , . On isomorphisms and density of NP and other complete sets. SIAM Journal on Computing 6:305–322, 1977.Google Scholar
6. . Resource Bounded Reductions. Ph.D. dissertation, Universiteit van Amsterdam, Amsterdam, 1993.
7. , . Complete sets and structure in subrecursive classes. In: , , , editors, Logic Colloquium '96, 45–77, Lecture Notes in Logic 12, Springer Verlag, 1998.
8. . Notions of resource-bounded category and genericity. Proceedings of the 6th Annual Structure in Complexity Theory Conference, 1991, 196–212, IEEE Computer Society Press, 1991.
9. , , and . On 1-truth-table-hard languages. Theoretical Computer Science. 115:383–389, 1993.Google Scholar
10. . Semirecursive sets and positive reducibility. Transactions of the American Mathematical Society 131:420–436, 1968.Google Scholar
11. , , and . The structure of complete degrees. In: [16], 108–146.
12. , , . A comparison of polynomial time reducibilities. Theoretical Computer Science 1:103–123, 1975.Google Scholar
13. , . An Introduction to Kolmogorov Complexity and Its Applications. Springer-Verlag, 1997.
14. . On the density of families of sets. Journal of Combinatorial Theory, Series A, 13:145–147, 1972.Google Scholar
15. . P-selective sets, tally languages, and the behavior of polynomial time reducibilities on NP. Mathematical Systems Theory 13:55–65, 1979.Google Scholar
16. , editor. Complexity Theory Retrospective. Springer-Verlag, 1990.
17. . Juris Hartmanis: fundamental contributions to isomorphism problems. In [16], 28–58.
18. . A comparison of polynomial time completeness notions. Theoretical Computer Science 54:249-265, 1987.Google Scholar