On complexity reduction of Σ1 formulas

被引：2
|
作者：
Adamowicz, Z
Zbierski, P
机构：
[1] Polish Acad Sci, Inst Math, PL-00950 Warsaw, Poland
[2] Warsaw Univ, Dept Math, Warsaw, Poland
来源：
ARCHIVE FOR MATHEMATICAL LOGIC | 2003年 / 42卷 / 01期
关键词：
Complexity Reduction;
D O I：
10.1007/s001530200145
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
For a fixed q is an element of N and a given Sigma(1) definition phi(d, x), where d is a parameter, we construct a model M of I Delta(0) + - exp and a non standard d is an element of M such that in M either phi has no witness smaller than d or 0 is equivalent to a formula rho(d, x) having no more than q alternations of blocks of quantifiers.
引用
收藏
页码：45 / 58
页数：14
相关论文
共 50 条
  • [1] On complexity reduction of Σ1 formulas
    Zofia Adamowicz
    Pawe Zbierski
    Archive for Mathematical Logic, 2003, 42 : 45 - 58
  • [2] ON THE DEPTH COMPLEXITY OF FORMULAS
    SHAMIR, E
    SNIR, M
    MATHEMATICAL SYSTEMS THEORY, 1980, 13 (04): : 301 - 322
  • [3] The complexity of variable minimal formulas
    Chen ZhenYu
    Xu BaoWen
    Ding DeCheng
    CHINESE SCIENCE BULLETIN, 2010, 55 (18): : 1957 - 1960
  • [4] The complexity of variable minimal formulas
    CHEN ZhenYu1
    2 Software Institute
    3 Department of Mathematics
    Science Bulletin, 2010, (18) : 1957 - 1960
  • [5] The complexity of variable minimal formulas
    CHEN ZhenYuXU BaoWen DING DeCheng National Key Laboratory for Novel Software TechnologyNanjing UniversityNanjing China Software InstituteNanjing UniversityNanjing China Department of MathematicsNanjing UniversityNanjing China
    Chinese Science Bulletin, 2010, 55 (18) : 1957 - 1960
  • [6] REALIZATION COMPLEXITY OF PROPOSITIONAL FORMULAS
    KHOMICH, VI
    DOKLADY AKADEMII NAUK SSSR, 1970, 195 (05): : 1050 - &
  • [7] ON THE COMPLEXITY OF FORMULAS IN SEMANTIC PROGRAMMING
    Ospichev, Sergey
    Ponomarev, Denis
    SIBERIAN ELECTRONIC MATHEMATICAL REPORTS-SIBIRSKIE ELEKTRONNYE MATEMATICHESKIE IZVESTIYA, 2018, 15 : 987 - 995
  • [8] DEPTH OF PROOFS, DEPTH OF CUT FORMULAS AND COMPLEXITY OF CUT FORMULAS
    ZHANG, WH
    THEORETICAL COMPUTER SCIENCE, 1994, 129 (01) : 193 - 206
  • [9] NEW REDUCTION FORMULAS
    SHIROKOV, YM
    SOVIET PHYSICS JETP-USSR, 1964, 19 (02): : 397 - 403
  • [10] Complexity of DNF and isomorphism of monotone formulas
    Goldsmith, J
    Hagen, M
    Mundhenk, M
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2005, PROCEEDINGS, 2005, 3618 : 410 - 421
12345