Book contents
- Frontmatter
- Contents
- Preface
- Part I Invited Papers
- Gödel's program for new axioms: Why, where, how and what?
- Infinite-valued G?del Logics with 0-1-Projections and Relativizations
- Contributions of K. Gödel to Relativity and Cosmology
- Kurt Gödel and the constructive Mathematics of A.A. Markov
- Hao Wang as Philosopher
- A bottom-up approach to foundations of mathematics
- K-graph Machines: generalizing Turing's machines and arguments
- Forcing on Bounded Arithmetic
- Uniform Interpolation and Layered Bisimulation
- Part II Contributed Papers
- References
Uniform Interpolation and Layered Bisimulation
from Part I - Invited Papers
Published online by Cambridge University Press: 23 March 2017
Edited by
Book contents
- Frontmatter
- Contents
- Preface
- Part I Invited Papers
- Gödel's program for new axioms: Why, where, how and what?
- Infinite-valued G?del Logics with 0-1-Projections and Relativizations
- Contributions of K. Gödel to Relativity and Cosmology
- Kurt Gödel and the constructive Mathematics of A.A. Markov
- Hao Wang as Philosopher
- A bottom-up approach to foundations of mathematics
- K-graph Machines: generalizing Turing's machines and arguments
- Forcing on Bounded Arithmetic
- Uniform Interpolation and Layered Bisimulation
- Part II Contributed Papers
- 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
- Gödel '96Logical Foundations of Mathematics, Computer Science and Physics - Kurt Gödel's Legacy, pp. 139 - 164Publisher: Cambridge University PressPrint publication year: 2017
References
, The complexity of the pigeon hole principle, Proc. IEEE 29th Annual Symp. Foundation of Computer Science, 1988, 346–355.
, Parity and the pigeon hole principle. Feasible Mathematics, editors: and , Birkhauser, 1–24
1990
, The independence of the modulo p counting principles, Proc. of the 26th Annual ACM Symp. on Theory of Computing, 402–417, ACM Press, 1994.
, , , , and , Lower bounds on Hilbert's Nullstellensatz and, prepositional proofs, to appear.,
, , , , and and , Exponential lower bounds for the pigeon hole principle, Proc. of the 24th Annual ACM Symp. on Theory of Computing, 200–221, ACM Press, 1992.
, Bounded Arithmetic, Bibliopolis, Napoli, 1986.
, A letter to von Neumann, Arithmetic, Proof Theory, and Computational Complexity, editors: and , Oxford University Press, 1993.
,
On Frege and Extended Frege Proof Systems,
Feasible Mathematics II., editors: and , Birkhauser, 1995, 284–319.
, Bounded, Propositional Logic, and Complexity Theory,
Cambridge University Press, 1995.
J.B. Paris and , Counting problems in bounded arithmetic, Methods in Mathematical Logic, LNM 1130, 317–340, Springer Verlag, 1985.
,
Making Infinite Structures Finite in Models of Second Order Bounded Arithmetic,
Arithmetic, Proof Theory, and Computational Complexity, editors: and , Oxford University Press, 289–319.
, Two Applications of Logic to Mathematics, Princeton University Press, 1978.
,
RSUV Isomorphisms,
Arithmetic, Proof Theory, and Computational Complexity, editors: and , Oxford University Press, 364–386.
, Frege proof System and TNC°, to appear in J. Symbolic Logic.
- 7
- Cited by