Abbreviating Proofs Using Metamathematical Rules

0401860 - UIVT-O 930004 GB eng C - Konferenční příspěvek (zahraniční konf.)
Hájek, Petr - Montagna, F. - Pudlák, Pavel
Abbreviating Proofs Using Metamathematical Rules.
Arithmetic, Proof Theory and Computational Complexity. Oxford: Clarendon Press, 1993 - (Clote, P.; Krajíček, J.), s. 197-221. Oxford Logic Guides, 23. ISBN 978-0-19-853690-1
Klíčová slova: arithmetics * proof theory * computational complexity

Citováno: 5

--- De Jongh D., Japaridze G. The Logic of Provability. in : ILLC Research Report and Technical Notes Series, ML-97-01, ISSN 0928-3315. Armsterdam : Institute for Logic, Language and Computation, University of Amsterdam, (1997), pp. 432
--- Lindström Per. in : Aspects of Incompleteness. Lecture Notes in Logic; 10. Berlin : Springer-Verlag, (1997), pp. 126
--- Japaridze G., de Jongh D. The Logic of Provability. in : Handbook of Proof Theory. Studies in Logic and the Foundations of Mathematics. Amsterdam : Elsevier, vol. 137, (1998), pp. 475-546
--- HERNEST, M.D. - KOHLENBACH, U. A complexity analysis of functional interpretations. THEORETICAL COMPUTER SCIENCE. ISSN 0304-3975, JUN 10 2005, vol. 338, no. 1-3, p. 200-246. [WOS]
--- FREUND, A. Proof lengths for instances of the Paris-Harrington principle. ANNALS OF PURE AND APPLIED LOGIC. ISSN 0168-0072, JUL 2017, vol. 168, no. 7, p. 1361-1382. [WOS]

Trvalý link: http://hdl.handle.net/11104/0122294