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 条
12345