COUNTING IN BOUNDED ARITHMETIC AND RELATED PROBLEMS

被引：0

|

作者：

PARIS, J

机构：

来源：

JOURNAL OF SYMBOLIC LOGIC | 1984年 / 49卷 / 04期

关键词：

D O I：

暂无

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

收藏

页码：1437 / 1437

页数：1

相关论文

共 50 条

[31] Higher complexity search problems for bounded arithmetic and a formalized no-gap theorem
Thapen, Neil
ARCHIVE FOR MATHEMATICAL LOGIC, 2011, 50 (7-8): : 665 - 680
[32] Some counting problems related to permutation groups
Cameron, PJ
DISCRETE MATHEMATICS, 2000, 225 (1-3) : 77 - 92
[33] 2 CLOSELY RELATED MODULAR COUNTING PROBLEMS
BINZ, JC
AMERICAN MATHEMATICAL MONTHLY, 1986, 93 (03): : 216 - 217
[34] FINITE AUTOMATA, REAL-TIME PROCESSES AND COUNTING PROBLEMS IN BOUNDED ARITHMETICS
KUTYLOWSKI, M
JOURNAL OF SYMBOLIC LOGIC, 1988, 53 (01) : 243 - 258
[35] Forcing on bounded arithmetic II
Takeuti, G
Yasumoto, M
JOURNAL OF SYMBOLIC LOGIC, 1998, 63 (03) : 860 - 868
[36] Note on sharply bounded arithmetic
Johannsen, J.
Archive for Mathematical Logic, 1994, 33 (02)
[37] Induction rules in bounded arithmetic
Jerabek, Emil
ARCHIVE FOR MATHEMATICAL LOGIC, 2020, 59 (3-4) : 461 - 501
[38] Logic of proofs for bounded arithmetic
Goris, Evan
COMPUTER SCIENCE - THEORY AND APPLICATIONS, 2006, 3967 : 191 - 201
[39] Notes on polynomially bounded arithmetic
Zambella, D
JOURNAL OF SYMBOLIC LOGIC, 1996, 61 (03) : 942 - 966
[40] Godel sentences of bounded arithmetic
Takeuti, G
JOURNAL OF SYMBOLIC LOGIC, 2000, 65 (03) : 1338 - 1346

← 1 2 3 4 5 →