Skip to main content Accessibility help
×
Home
Hostname: page-component-6c8bd87754-dzvvk Total loading time: 7.328 Render date: 2022-01-21T03:40:18.624Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "metricsAbstractViews": false, "figures": true, "newCiteModal": false, "newCitedByModal": true, "newEcommerce": true, "newUsageEvents": true }

Uniform Interpolation and Layered Bisimulation

from Part I - Invited Papers

Published online by Cambridge University Press:  23 March 2017

Albert Visser
Affiliation:
University of Utrecht
Petr Hájek
Affiliation:
Academy of Sciences of the Czech Republic, Prague
Get access

Summary

Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Chapter
Information
Gödel '96
Logical Foundations of Mathematics, Computer Science and Physics - Kurt Gödel's Legacy
, pp. 139 - 164
Publisher: Cambridge University Press
Print publication year: 2017

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Ajtai, M., The complexity of the pigeon hole principle, Proc. IEEE 29th Annual Symp. Foundation of Computer Science, 1988, 346–355.
Ajtai, M., Parity and the pigeon hole principle. Feasible Mathematics, editors: Buss, S.R. and Scott, P.J., Birkhauser, 1–24 1990
Ajtai, M., The independence of the modulo p counting principles, Proc. of the 26th Annual ACM Symp. on Theory of Computing, 402–417, ACM Press, 1994.
Beame, P., Impagliazo, R., Krajíček, J., Pitassi, T., and Pudlák, P., Lower bounds on Hilbert's Nullstellensatz and, prepositional proofs, to appear.,
Beame, P., Impagaliazzo, R., Krajíček, J., Pitassi, T., and Pudlák, P. and Woods, A., Exponential lower bounds for the pigeon hole principle, Proc. of the 24th Annual ACM Symp. on Theory of Computing, 200–221, ACM Press, 1992.
Buss, S., Bounded Arithmetic, Bibliopolis, Napoli, 1986.
Gödel, K., A letter to von Neumann, Arithmetic, Proof Theory, and Computational Complexity, editors: Clote, P. and Krajicek, J., Oxford University Press, 1993.
Krajicek, J., On Frege and Extended Frege Proof Systems, Feasible Mathematics II., editors: Clote, P. and Remmel, J.B., Birkhauser, 1995, 284–319.
Krajíček, J., Bounded, Propositional Logic, and Complexity Theory, Cambridge University Press, 1995.
J.B. Paris and Wilkie, A., Counting problems in bounded arithmetic, Methods in Mathematical Logic, LNM 1130, 317–340, Springer Verlag, 1985.
Riis, S., Making Infinite Structures Finite in Models of Second Order Bounded Arithmetic, Arithmetic, Proof Theory, and Computational Complexity, editors: Clote, P. and Krajicek, J., Oxford University Press, 289–319.
Takeuti, G., Two Applications of Logic to Mathematics, Princeton University Press, 1978.
Takeuti, G., RSUV Isomorphisms, Arithmetic, Proof Theory, and Computational Complexity, editors: Clote, P. and Krajíček, J., Oxford University Press, 364–386.
Takeuti, G., RSUV Isomorphisms for TACi, TNCi and TLS, Arch. Math. Logic, 427–453, 1995.Google Scholar
Takeuti, G., Frege proof System and TNC°, to appear in J. Symbolic Logic.
5
Cited by

Send book to Kindle

To send this book to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle.

Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Send book to Dropbox

To send content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about sending content to Dropbox.

Available formats
×

Send book to Google Drive

To send content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about sending content to Google Drive.

Available formats
×