Book contents
- Frontmatter
- Contents
- Preface
- Participants Photograph
- Generic absoluteness for Σ1 formulas and the continuum problem
- Axioms of generic absoluteness
- Generalised dynamic ordinals — universal measures for implicit computational complexity
- The Worm principle
- “One is a lonely number”: logic and communication
- Computable versions of the uniform boundedness theorem
- Symmetry of the universal computable function: A study of its automorphisms, homomorphisms and isomorphic embeddings
- PCF theory and Woodin cardinals
- Embedding finite lattices into the computably enumerable degrees — a status survey
- Dimension theory inside a homogeneous model
- Reals which compute little
- Bisimulation invariance and finite models
- Choice principles in constructive and classical set theories
- Ash's theorem for abstract structures
- Martin-Löf random and PA-complete sets
- Learning and computing in the limit
- References
Generalised dynamic ordinals — universal measures for implicit computational complexity
Published online by Cambridge University Press: 31 March 2017
Book contents
- Frontmatter
- Contents
- Preface
- Participants Photograph
- Generic absoluteness for Σ1 formulas and the continuum problem
- Axioms of generic absoluteness
- Generalised dynamic ordinals — universal measures for implicit computational complexity
- The Worm principle
- “One is a lonely number”: logic and communication
- Computable versions of the uniform boundedness theorem
- Symmetry of the universal computable function: A study of its automorphisms, homomorphisms and isomorphic embeddings
- PCF theory and Woodin cardinals
- Embedding finite lattices into the computably enumerable degrees — a status survey
- Dimension theory inside a homogeneous model
- Reals which compute little
- Bisimulation invariance and finite models
- Choice principles in constructive and classical set theories
- Ash's theorem for abstract structures
- Martin-Löf random and PA-complete sets
- Learning and computing in the limit
- References
- Type
- Chapter
- Information
- Logic Colloquium '02 , pp. 48 - 74Publisher: Cambridge University PressPrint publication year: 2006
References
[1] , , and , Relativizations of the P = NP question SIAM Journal on Computing, vol. 4 (1975), no. 4, pp. 431–442.
[2] , Seperating Fragments of Bounded Predicative Arithmetic, Ph.D. thesis, Westfälische Wilhelms-Universität, Münster, 1996.
[3] , A note on universal measures for weak implicit computational complexity Logic for Programming, Artificial Intelligence, and Reasoning (Matthias Baaz and Andrei Voronkov, editors), Lecture Notes in Computer Science, vol. 2514, Springer, Berlin, 2002, pp. 53–67.
[4] , Dynamic ordinal analysis Archive for Mathematical Logic, vol. 42 (2003), no. 4, pp. 303–334.
[5] , Height restricted constant depth LK, Research Note Report TR03-034, Electronic Colloquium on Computational Complexity, 2003, http://www.eccc.uni-trier.de/eccc-reports/2003/TR03-034/.
[6] , Bounded Arithmetic, Studies in Proof Theory. Lecture Notes, vol. 3, Bibliopolis, Naples, 1986.
[7] , Axiomatizations and conservation results for fragments of bounded arithmetic Logic and Computation (Pittsburgh, PA, 1987) (, editor), ContemporaryMathematics, vol. 106, AMS, Providence, RI, 1990, pp. 57–84.Google Scholar
[8] , Relating the bounded arithmetic and polynomial time hierarchies Annals of Pure and Applied Logic, vol. 75 (1995), no. 1-2, pp. 67–77.
[9] and , An application of Boolean complexity to separation problems in bounded arithmetic Proceedings of the London Mathematical Society. Third Series, vol. 69 (1994), no. 1, pp. 1–21.
[10] , Almost optimal lower bounds for small depth circuits Randomness and Computation, vol. 5 (1969), pp. 143–170.
[11] , Computational Limitations of Small Depth Circuits,MIT Press, Cambridge, MA, 1987.
[12] , A note on sharply bounded arithmetic Archive for Mathematical Logic, vol. 33 (1994), no. 2, pp. 159–165.
[13] , Fragments of bounded arithmetic and bounded query classes Transactions of the American Mathematical Society, vol. 338 (1993), no. 2, pp. 587–598.
[14] , Lower bounds to the size of constant-depth propositional proofs The Journal of Symbolic Logic, vol. 59 (1994), no. 1, pp. 73–86.
[15] , Bounded Arithmetic, Propositional Logic, and Complexity Theory, Cambridge University Press, Cambridge, 1995.
[16] , Pavel Pudlák, and , Bounded arithmetic and the polynomial hierarchy Annals of Pure and Applied Logic, vol. 52 (1991), no. 1-2, pp. 143–153.
[17] , Substructural termination proofs and feasibility certification Proceedings of the 3rd Workshop on Implicit Computational Complexity (Aarhus), 2001, pp. 75–91.
[18] and , Counting problems in bounded arithmetic Methods in Mathematical Logic (Caracas, 1983) (Carlos Augusto di Prisco, editor), Lecture Notes in Mathematics, vol. 1130, Springer, Berlin, 1985, pp. 317–340.
[19] , Proof Theory: An introduction, Lecture Notes in Mathematics, vol. 1407, Springer-Verlag, Berlin, 1989.
[20] , Structure and definability in general bounded arithmetic theories Annals of Pure and Applied Logic, vol. 100 (1999), no. 1-3, pp. 189–245.
[21] , RSUV isomorphisms Arithmetic, Proof Theory, and Computational Complexity (Prague, 1991) ( and , editors), Oxford Logic Guides, vol. 23, Oxford Univ. Press, New York, 1993, pp. 364–386.
[22] , Separating the polynomial-time hierarchy by oracles Proc. 26th Ann. IEEE Symp. on Foundations of Computer Science (, editor), 1985, pp. 1–10.
[23] , Notes on polynomially bounded arithmetic The Journal of Symbolic Logic, vol. 61 (1996), no. 3, pp. 942–966.
- 1
- Cited by