On the no-counterexample interpretation

被引:18
|
作者
Kohlenbach, U [1 ]
机构
[1] Aarhus Univ, Dept Comp Sci, Ctr Danish Natl Res Fdn, DK-8000 Aarhus C, Denmark
关键词
D O I
10.2307/2586791
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
In [15], [16] G. Kreisel introduced the no-counterexample interpretation (n.c.i.) of Peano arithmetic. In particular he proved, using a complicated epsilon-substitution method (due to W. Ackermann), that for every theorem A (A prenex) of first-order Peano arithmetic PA one can find ordinal recursive functionals <(Phi)under bar>(A) of order type < epsilon(0) which realize the Herbrand normal form A(H) of A. Subsequently more perspicuous proofs of this fact via functional interpretation (combined with normalization) and cut-elimination were found. These proofs however do not carry our the no-counterexample interpretation as a local proof interpretation and don't respect the modus ponens on the level of the no-counterexample interpretation of formulas A and A --> B. Closely related to this phenomenon is the fact that both proofs do not establish the condition (delta) and-at least not constructively-(gamma) which are part of the definition of an 'interpretation of a formal system' as formulated in [15]. In this paper we determine the complexity of the no-counterexample interpretation of the modus ponens rule for (i) PA-provable sentences, (ii) for arbitrary sentences A, B is an element of L(PA) uniformly in functionals satisfying the no-counterexample interpretation of (prenex normal forms of) A and A --> B, and (iii) for arbitrary A, B is an element of L(PA) pointwise in given alpha(< epsilon(0))-recursive functionals satisfying the no-counterexample interpretation of A and A --> B. This yields in particular perspicuous proofs of new uniform versions of the conditions (gamma), (delta). Finally we discuss a variant of the concept of an interpretation presented in [17] and show that it is incomparable with the concept studied in [15], [16]. In particular we show that the no-counterexample interpretation of PA(n) by alpha(< omega(n) (omega))-recursive functionals (n greater than or equal to 1) is an interpretation in the sense of [17] but nor in the sense of [15] since it violates the condition (delta).
引用
收藏
页码:1491 / 1511
页数:21
相关论文
共 50 条
  • [2] Counterexample driven refinement for abstract interpretation
    Gulavani, Bhargav S.
    Rajamani, Sriram K.
    [J]. TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS, PROCEEDINGS, 2006, 3920 : 474 - 488
  • [3] A Counterexample to A
    Hermes, Charles
    [J]. PHILOSOPHIA, 2014, 42 (02) : 387 - 389
  • [4] COUNTEREXAMPLE
    ARNOLD, J
    BOISEN, MB
    ASCHER, M
    CULL, P
    DRISCOLL, RJ
    ELSNER, L
    HAJEK, O
    JAGERS, AA
    LANTZ, DC
    LAUGWITZ, D
    ODONI, RWK
    STRATTON, AE
    ROBINSON, DW
    SINGLETON, R
    TAYLOR, W
    YOCOM, K
    DIXON, ED
    [J]. AMERICAN MATHEMATICAL MONTHLY, 1979, 86 (04): : 311 - 312
  • [5] A Counterexample to A
    Charles Hermes
    [J]. Philosophia, 2014, 42 : 387 - 389
  • [6] Counterexample classification
    Vick, Cole
    Kang, Eunsuk
    Tripakis, Stavros
    [J]. SOFTWARE AND SYSTEMS MODELING, 2024, 23 (02): : 455 - 472
  • [7] A controllability counterexample
    Elliott, DL
    [J]. IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2005, 50 (06) : 840 - 841
  • [8] An illuminating counterexample
    Hardy, N
    [J]. AMERICAN MATHEMATICAL MONTHLY, 2003, 110 (03): : 234 - 238
  • [9] On a Counterexample in Analysis
    Polovinkin, E. S.
    [J]. MATHEMATICAL NOTES, 2014, 95 (1-2) : 110 - 114
  • [10] AN EASY COUNTEREXAMPLE
    SHAFER, RE
    [J]. AMERICAN MATHEMATICAL MONTHLY, 1981, 88 (02): : 148 - 149