Bounded arithmetic, proof complexity and two papers of Parikh

被引：2
|
作者：
Buss, SR [1 ]
机构：
[1] Univ Calif San Diego, Dept Math, La Jolla, CA 92093 USA
来源：
ANNALS OF PURE AND APPLIED LOGIC | 1999年 / 96卷 / 1-3期
基金：
美国国家科学基金会;
关键词：
feasibility; exponentiation; bounded arithmetic; proof length; proof complexity; unification;
D O I：
10.1016/S0168-0072(98)00030-X
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
This article surveys R. Parikh's work on feasibility, bounded arithmetic and the complexity of proofs. We discuss in depth two of Parikh's papers on these subjects and some of the subsequent progress in the areas of feasible arithmetic and lengths of proofs. (C) 1999 Elsevier Science B.V. All rights reserved.
引用
收藏
页码：43 / 55
页数：13
相关论文
共 50 条
  • [1] From positive and intuitionistic bounded arithmetic to monotone proof complexity
    Das, Anupam
    PROCEEDINGS OF THE 31ST ANNUAL ACM-IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS 2016), 2016, : 126 - 135
  • [2] On the proof complexity of logics of bounded branching
    Jerabek, Emil
    ANNALS OF PURE AND APPLIED LOGIC, 2023, 174 (01)
  • [3] Bounded Parikh Automata
    Cadilhac, Michael
    Finkel, Alain
    McKenzie, Pierre
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2011, (63): : 93 - 102
  • [4] BOUNDED PARIKH AUTOMATA
    Cadilhac, Michael
    Finkel, Alain
    Mckenzie, Pierre
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2012, 23 (08) : 1691 - 1709
  • [5] The Complexity of Bounded Register and Skew Arithmetic Computation
    Arvind, Vikraman
    Raja, S.
    COMPUTING AND COMBINATORICS, COCOON 2014, 2014, 8591 : 572 - 583
  • [6] CONSISTENCY PROOF OF A FRAGMENT OF PV WITH SUBSTITUTION IN BOUNDED ARITHMETIC
    Yamagata, Yoriyuki
    JOURNAL OF SYMBOLIC LOGIC, 2018, 83 (03) : 1063 - 1090
  • [7] AN APPLICATION OF BOOLEAN COMPLEXITY TO SEPARATION PROBLEMS IN BOUNDED ARITHMETIC
    BUSS, SR
    KRAJICEK, J
    PROCEEDINGS OF THE LONDON MATHEMATICAL SOCIETY, 1994, 69 : 1 - 21
  • [8] Unprovability of Strong Complexity Lower Bounds in Bounded Arithmetic
    Li, Jiatu
    Oliveira, Igor C.
    PROCEEDINGS OF THE 55TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, STOC 2023, 2023, : 1051 - 1057
  • [9] THE COMPLEXITY OF PRESBURGER ARITHMETIC WITH BOUNDED QUANTIFIER ALTERNATION DEPTH
    FURER, M
    THEORETICAL COMPUTER SCIENCE, 1982, 18 (01) : 105 - 111
  • [10] MODELS OF BOUNDED ARITHMETIC THEORIES AND SOME RELATED COMPLEXITY QUESTIONS
    Alam, Abolfazl
    Moniri, Morteza
    BULLETIN OF THE SECTION OF LOGIC, 2022, 51 (02): : 163 - 176
12345