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 条
  • [41] Dependency quantified Horn formulas:: Models and complexity
    Bubeck, Uwe
    Buening, Hans Kleine
    THEORY AND APPLICATIONS OF SATISFIABILITY TESTING - SAT 2006, PROCEEDINGS, 2006, 4121 : 198 - 211
  • [42] COMPLEXITY OF THE PROBLEM OF BEING EQUIVALENT TO HORN FORMULAS
    Kogabaev, N. T.
    ALGEBRA AND LOGIC, 2022, 60 (06) : 380 - 388
  • [43] ON THE COMPLEXITY OF THE MAXIMUM SATISFIABILITY PROBLEM FOR HORN FORMULAS
    JAUMARD, B
    SIMEONE, B
    INFORMATION PROCESSING LETTERS, 1987, 26 (01) : 1 - 4
  • [44] Homogeneous Algebraic Complexity Theory and Algebraic Formulas
    Dutta, Pranjal
    Gesmundo, Fulvio
    Ikenmeyer, Christian
    Jindal, Gorav
    Lysikov, Vladimir
    15TH INNOVATIONS IN THEORETICAL COMPUTER SCIENCE CONFERENCE, ITCS 2024, 2024,
  • [45] The complexity of homomorphisms and renamings for minimal unsatisfiable formulas
    Hans Kleine Büning
    Daoyun Xu
    Annals of Mathematics and Artificial Intelligence, 2005, 43 : 113 - 127
  • [46] Complexity of the Problem of Being Equivalent to Horn Formulas
    N. T. Kogabaev
    Algebra and Logic, 2022, 60 : 380 - 388
  • [47] On meta complexity of propositional formulas and propositional proofs
    Pavel Naumov
    Archive for Mathematical Logic, 2008, 47
  • [48] Complexity of Sets Obtained as Values of Propositional Formulas
    A. V. Chernov
    Mathematical Notes, 2004, 75 : 131 - 139
  • [49] Complexity of Implementation of Boolean Functions by Real Formulas
    Gashkov, S. B.
    Vegner, Ya. V.
    MOSCOW UNIVERSITY MATHEMATICS BULLETIN, 2008, 63 (02) : 76 - 78
  • [50] Complexity of sets obtained as values of propositional formulas
    Chernov, AV
    MATHEMATICAL NOTES, 2004, 75 (1-2) : 131 - 139
12345