Skip to main content Accessibility help
×
Hostname: page-component-7c8c6479df-7qhmt Total loading time: 0 Render date: 2024-03-29T02:17:29.551Z Has data issue: false hasContentIssue false

Consistency and games— in search of new combinatorial principles

from RESEARCH ARTICLES

Published online by Cambridge University Press:  30 March 2017

Viggo Stoltenberg-Hansen
Affiliation:
Uppsala Universitet, Sweden
Jouko Väänänen
Affiliation:
University of Helsinki
Get access
Type
Chapter
Information
Logic Colloquium '03 , pp. 244 - 281
Publisher: Cambridge University Press
Print publication year: 2006

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

[1] Z., Adamowicz, On tableaux consistency in weak theories, Preprint 618 (2001) of the Mathematical Institute of the Polish Academy of Sciences.
[2] Z., Adamowicz,Herbrand consistency and bounded arithmetic, FundamentaMathematicae, vol. 171 (2002), pp. 279–292.Google Scholar
[3] Z., Adamowicz and L., Kolodziejczyk, Well-behaved principle alternative to bounded induction, Theoretical Computer Science, vol. 322 (2004), pp. 5–16.Google Scholar
[4] Z., Adamowicz and P., Zbierski, On Herbrand consistency in weak arithmetic, Archive for Mathematical Logic, vol. 40 (2001), pp. 399–413.Google Scholar
[5] S. A., Bloch, Divide and conquer in parallel complexity and proof theory, Ph.D. thesis, University of California, San Diego, 1992.
[6] S. R., Buss, Bounded arithmetic, Bibliopolis, 1986.
[7] S. R., Buss, Axiomatizations and conservation results for fragments of bounded arithmetic,Logic and computations, ContemporaryMathematics, vol. 106, American Mathematical Society, 1990, pp. 57–84.
[8] S. R., Buss and J., Krajíček, An application of boolean complexity to separation problems in bounded arithmetic, Proceedings of the London Mathematical Society, vol. 69 (1994), no. 3, pp. 1–21.Google Scholar
[9] S. A., Cook, Feasibly constructive proofs and the propositional calculus, Proceedings of the 7th annual symposium on theory of computing, ACM Press, 1975, pp. 83–97.
[10] F., Ferreira, What are the ∀Σb1 -consequences of T1 2 and T2 2?, Annals of Pure and Applied Logic, vol. 75 (1995), pp. 79–88.Google Scholar
[11] P., Hájek and P., Pudlák,Metamathematics of first-order arithmetic, Perspectives inMathematical Logic, Springer-Verlag, 1993.
[12] J., Hanika, Search problems in bounded arithmetic, Ph.D. thesis, Charles University, Prague, 2004.
[13] R., Impagliazzo and J., Krajíček, A note on conservativity relations among bounded arithmetic theories,Mathematical Logic Quarterly, vol. 48 (2002), no. 3, pp. 375–377.Google Scholar
[14] R., Kaye, J., Paris, and C., Dimitracopoulos, On parameter schemas, The Journal of Symbolic Logic, vol. 53 (1988), no. 4, pp. 1082–1097.Google Scholar
[15] J., Krajíček, No counter-example interpretation and interactive computations, Logic from computer science (Y. N., Moschovakis, editor), Springer-Verlag, 1992, pp. 287–293.
[16] J., Krajíček, Fragments of bounded arithmetic and bounded query classes, Transactions of the AMS, vol. 338 (1993), no. 2, pp. 587–98.Google Scholar
[17] J., Krajíček, Bounded arithmetic, propositional logic, and complexity theory, Encyclopedia of Mathematics and its Applications, vol. 60, Cambridge Univ. Press, 1995.
[18] J., Krajíček and M., Chiari, Witnessing functions in bounded arithmetic and search problems, The Journal of Symbolic Logic, vol. 63 (1998), no. 3, pp. 1095–1115.Google Scholar
[19] J., Krajíček and M., Chiari, Lifting independence results in bounded arithmetic, Archive for Mathematical Logic, vol. 38 (1999), pp. 123–138.Google Scholar
[20] J., Krajíček and P., Pudlák, Quantified propositional calculi and fragments of bounded arithmetic, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, vol. 36 (1990), pp. 29–46.Google Scholar
[21] J., Krajíček, P., Pudlák, and G., Takeuti, Bounded arithmetic and the polynomial hierarchy, Annals of Pure and Applied Logic, vol. 52 (1991), pp. 143–153.Google Scholar
[22] J., Krajíček and G., Takeuti, On induction-free provability, Annals of Mathematics and Artificial Intelligence, vol. 6 (1992), pp. 107–126.Google Scholar
[23] R., Parikh, Existence and feasibility in arithmetic, The Journal of Symbolic Logic, vol. 36 (1971), pp. 494–508.Google Scholar
[24] J. B., Paris and L., Harrington, A mathematical incompleteness in Peano arithmetic, Handbook of mathematical logic, North-Holland, 1977, pp. 1133–1142.
[25] J. B., Paris and A. J., Wilkie, Counting problems in bounded arithmetic, Methods in mathematical logic, LNM, vol. 1130, Springer-Verlag, 1985, pp. 317–340.
[26] P., Pudlák, Some relations between subsystems of arithmetic and the complexity of computations, Logic from computer science (Y. N., Moschovakis, editor), Springer-Verlag, 1992, pp. 308–317.
[27] P., Pudlák, The lengths of proofs, Handbook of proof theory, Elsevier, 1998, pp. 547–637.
[28] P., Pudlák, Parallel strategies, The Journal of Symbolic Logic, vol. 68 (2003), no. 4, pp. 1242–1250.Google Scholar
[29] S., Salehi,Herbrand consistency in arithmetics with bounded induction, Ph.D. thesis,Mathematical Institute of the Polish Academy of Sciences, 2001.
[31] A. J., Wilkie and J. B., Paris, On the schema of induction for bounded arithmetical formulas, Annals of Pure and Applied Logic, vol. 35 (1987), pp. 261–302.
[30] G., Takeuti, Proof theory, North-Holland, 1975.
[32] D., Willard, The semantic tableaux version of the second incompleteness theorem extends almost to Robinson's arithmetic Q, Automated reasoning with semantic tableaux and related methods, LNCS 1847, Springer-Verlag, 2000, pp. 415–430.

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@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 saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved 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
×

Save book to Dropbox

To save 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 saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save 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 saving content to Google Drive.

Available formats
×