Book contents
- Frontmatter
- Preface
- Plenary sessions
- Special sessions
- Contents
- The Number of Path-Components of a Compact Subset of Rn
- Intervals without Critical Triples
- Beyond Gödel's Theorem: Turing Nonrigidity Revisited
- Types and Indescernibles in Finite Models
- Model Theory of Modules
- Noninterpretability of Infinite Linear Orders
- Combinatorial Principles from Adding Cohen Reals
- Extensions of models of PV
- Convergence Laws for Random Graphs
- V=L and Maximize
- Towards a Categorical Foundation of Mathematics
- Strongly Minimal Sets and Geometry
- Computationally-Sound Proofs
- Lambek Calculus and Formal Languages
- Zil'ber's Trichotomy and o-minimal Structures
- The Higher Infinite in Proof Theory
- There May Be No Nowhere Dense Ultrafilter
- Towards Recursive Model Theory
- Accessible Segments of the Fast Growing Hierarchy
- Author Index
- References
Extensions of models of PV
Published online by Cambridge University Press: 24 March 2017
By
Book contents
- Frontmatter
- Preface
- Plenary sessions
- Special sessions
- Contents
- The Number of Path-Components of a Compact Subset of Rn
- Intervals without Critical Triples
- Beyond Gödel's Theorem: Turing Nonrigidity Revisited
- Types and Indescernibles in Finite Models
- Model Theory of Modules
- Noninterpretability of Infinite Linear Orders
- Combinatorial Principles from Adding Cohen Reals
- Extensions of models of PV
- Convergence Laws for Random Graphs
- V=L and Maximize
- Towards a Categorical Foundation of Mathematics
- Strongly Minimal Sets and Geometry
- Computationally-Sound Proofs
- Lambek Calculus and Formal Languages
- Zil'ber's Trichotomy and o-minimal Structures
- The Higher Infinite in Proof Theory
- There May Be No Nowhere Dense Ultrafilter
- Towards Recursive Model Theory
- Accessible Segments of the Fast Growing Hierarchy
- Author Index
- References
Summary
A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
- Type
- Chapter
- Information
- Logic Colloquium '95 , pp. 104 - 114Publisher: Cambridge University PressPrint publication year: 2017
References
(1986) Bounded Arithmetic. Naples, Bibliopolis.
(1995) Relating the bounded arithmetic and polynomial time hierarchies, Annals of Pure and Applied Logic, 75: 67–77.Google Scholar
(1975) Feasibly constructive proofs and the prepositional calculus, in: Proc. 7th Annual ACM Symp. on Theory of Computing, pp. 83–97. ACM Press.
(1995) Bounded arithmetic, propositional logic and complexity theory, Encyclopedia of Mathematics and Its Applications, Vol. 60, Cambridge University Press, Cambridge - New York - Melbourne, 343 p.
(1995) On Frege and Extended Frege proof systems, in: Feasible Mathemaics II, eds. and
Birkhauser, pp. 284–319.
(1995) On methods for proving lower bounds in propositional logic, in: Proceedings of the Tenth International Congress Logic, Methodology and Philosophy of Science, International Union of History and Philosophy of Science, Florence (August 19–25, 1995), Eds.
,
to appear.
and (1990) Propositional Provability and Models of Weak Arithmetic, in: Computer Science Logic (Kaiserlautern, Oct. –89),
(eds.), LNCS 440, Springer-Verlag, pp. 193–210.
, , and (1991) Bounded arithmetic and the polynomial hierarchy, Annals of Pure and Applied Logic, 52: 143–153.Google Scholar
(1996) Notes on polynomially bounded arithmetic, J. of Symbolic Logic, 61(3), pp. 942–966.Google Scholar