On the Provability Logic of Bounded Arithmetic
暂无分享,去创建一个
[1] Albert Visser. On the Σ10-Conservativity of Σ10-Completeness , 1991, Notre Dame J. Formal Log..
[2] H. Putnam,et al. The Decision Problem for Exponential Diophantine Equations , 1961 .
[3] Petr Hájek,et al. On interpretability in set theories. II. , 1972 .
[4] Albert Visser. On the Σ 1 0 -Conservativity of Σ 1 0 -Completeness. , 1991 .
[5] P. Pudlák. On the length of proofs of finitistic consistency statements in first order theories , 1986 .
[6] R. Solovay. Provability interpretations of modal logic , 1976 .
[7] Pavel Pudlák,et al. Cuts, consistency statements and interpretations , 1985, Journal of Symbolic Logic.
[8] Vítezslav Svejdar. Modal Analysis of Generalized Rosser Sentences , 1983, J. Symb. Log..
[9] Franco Montagna,et al. On the proof of Solovay's theorem , 1991, Stud Logica.
[10] Jeff B. Paris,et al. On the scheme of induction for bounded arithmetic formulas , 1987, Ann. Pure Appl. Log..