Priest, Graham On a paradox of Hilbert and Bernays. (English) Zbl 0869.03005 J. Philos. Log. 26, No. 1, 45-56 (1997). Reviewer: J.Mackenzie (Sydney) MSC: 03A05 03B65 03F30 PDFBibTeX XMLCite \textit{G. Priest}, J. Philos. Log. 26, No. 1, 45--56 (1997; Zbl 0869.03005) Full Text: DOI
Hamano, Masahiro; Okada, Mitsuhiro A relationship among Gentzen’s proof-reduction, Kirby-Paris’ Hydra game and Buchholz’s Hydra game. (English) Zbl 0872.03038 Math. Log. Q. 43, No. 1, 103-120 (1997). Reviewer: A.Weiermann (Münster) MSC: 03F15 03F05 03F30 PDFBibTeX XMLCite \textit{M. Hamano} and \textit{M. Okada}, Math. Log. Q. 43, No. 1, 103--120 (1997; Zbl 0872.03038) Full Text: DOI
Wehmeier, Kai F. Fragments of HA based on \(\Sigma_ 1\)-induction. (English) Zbl 0886.03040 Arch. Math. Logic 37, No. 1, 37-49 (1997). Reviewer: K.F.Wehmeier (Münster) MSC: 03F30 03D20 PDFBibTeX XMLCite \textit{K. F. Wehmeier}, Arch. Math. Logic 37, No. 1, 37--49 (1997; Zbl 0886.03040) Full Text: DOI
Baaz, Matthias; Egly, Uwe; Fermüller, Christian G. Lean induction principles for tableaux. (English) Zbl 1415.03015 Galmiche, Didier (ed.), Automated reasoning with analytic tableaux and related methods. International conference, TABLEAUX ’97, Pont-à-Mousson, France, May 13–16, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1227, 62-75 (1997). MSC: 03B35 03F30 PDFBibTeX XMLCite \textit{M. Baaz} et al., Lect. Notes Comput. Sci. 1227, 62--75 (1997; Zbl 1415.03015) Full Text: DOI
Janičić, Predrag; Green, Ian; Bundy, Alan A comparison of decision procedures in Presburger arithmetic. (English) Zbl 1014.03504 Tošić, Ratko (ed.) et al., Proceedings of the VIII international conference on logic and computer science: theoretical foundations of computer science, Lira ’97, Novi Sad, Yugoslavia, September 1-4, 1997. Novi Sad: Univ. of Novi Sad, Faculty of Science, Institute of Mathematics, 91-101 (1997). Reviewer: Miodrag Kapetanović (Beograd) MSC: 03B25 03F30 PDFBibTeX XMLCite \textit{P. Janičić} et al., in: Proceedings of the VIII international conference on logic and computer science: theoretical foundations of computer science, Lira '97, Novi Sad, Yugoslavia, September 1--4, 1997. Novi Sad: Univ. of Novi Sad, Faculty of Science, Institute of Mathematics. 91--101 (1997; Zbl 1014.03504)
Bartol, Wiktor Hilbert’s Second Problem (the consistency of arithmetic). (Polish. English summary) Zbl 0978.01030 Wiȩsław, Witold (ed.), Hilbert’s problems. On the occasion of the fiftieth anniversary of the death of their creator. Proceedings of the 7th All-Polish School on the history of mathematics, Miȩdzyzdroje, Poland, May 10-14, 1993. Warsaw: Instytut Historii Nauki PAN. 27-34 (1997). Reviewer: Witold Wiȩsław (Wrocław) MSC: 01A60 03-03 03F30 PDFBibTeX XMLCite \textit{W. Bartol}, in: Problemy Hilberta. W piȩćdziesiȩciolecie śmierci ich twórcy. Warsaw: Instytut Historii Nauki PAN. 27--34 (1997; Zbl 0978.01030)
Korec, Ivan Undecidability and uniform definability in classes of structures related to Pascal triangles modulo \(n\). (English) Zbl 0974.03007 Tatra Mt. Math. Publ. 11, 129-146 (1997). MSC: 03B10 03B25 03C62 03D35 11B65 11U05 PDFBibTeX XMLCite \textit{I. Korec}, Tatra Mt. Math. Publ. 11, 129--146 (1997; Zbl 0974.03007)
Belyakin, N. V.; Odintsov, S. P. Infinite arithmetic formulas and the reflection principle. (English. Russian original) Zbl 0937.03066 Algebra Logika 36, No. 3, 245-258 (1997); translation in Algebra Logic 36, No. 3, 147-154 (1997). MSC: 03F30 PDFBibTeX XMLCite \textit{N. V. Belyakin} and \textit{S. P. Odintsov}, Algebra Logika 36, No. 3, 245--258 (1997; Zbl 0937.03066); translation in Algebra Logic 36, No. 3, 147--154 (1997)
Isles, David Theorems of Peano arithmetic are Buridan-Volpin recursively satisfiable. (English) Zbl 0946.03072 Rep. Math. Logic 31, 57-74 (1997). MSC: 03F30 03F05 PDFBibTeX XMLCite \textit{D. Isles}, Rep. Math. Logic 31, 57--74 (1997; Zbl 0946.03072)
Raatikainen, Panu The problem of the simplest diophantine representation. (English) Zbl 0938.03064 Nord. J. Philos. Log. 2, No. 2, 47-54 (1997). MSC: 03D35 11U05 03D15 03F20 03F30 PDFBibTeX XMLCite \textit{P. Raatikainen}, Nord. J. Philos. Log. 2, No. 2, 47--54 (1997; Zbl 0938.03064)
Sato, Masahiko Classical Brouwer-Heyting-Kolmogorov interpretation. (English) Zbl 0936.03056 RIMS Kokyuroku 1021, 28-47 (1997). MSC: 03F30 03F25 03F07 PDFBibTeX XMLCite \textit{M. Sato}, RIMS Kokyuroku 1021, 28--47 (1997; Zbl 0936.03056)
Takeuti, Gaisi Bounded arithmetic and fundamental problems of complexity of computation. (Japanese) Zbl 0930.03045 Sugaku 49, No. 2, 121-143 (1997). Reviewer: M.Yasuhara (Princeton) MSC: 03D15 03F30 03H15 03E40 PDFBibTeX XMLCite \textit{G. Takeuti}, Sūgaku 49, No. 2, 121--143 (1997; Zbl 0930.03045)
Heck, Richard G. jun. The Julius Caesar objection. (English) Zbl 0938.03531 Heck, Richard G. jun. (ed.), Language, thought, and logic. Essays in honour of Michael Dummett. Oxford: Oxford University Press. 273-308 (1997). MSC: 03A05 03F30 00A30 PDFBibTeX XMLCite \textit{R. G. Heck jun.}, in: Language, thought, and logic. Essays in honour of Michael Dummett. Oxford: Oxford University Press. 273--308 (1997; Zbl 0938.03531)
Parsons, Charles Wright on abstraction and set theory. (English) Zbl 0938.03535 Heck, Richard G. jun. (ed.), Language, thought, and logic. Essays in honour of Michael Dummett. Oxford: Oxford University Press. 263-271 (1997). MSC: 03A05 00A30 03F30 03E30 PDFBibTeX XMLCite \textit{C. Parsons}, in: Language, thought, and logic. Essays in honour of Michael Dummett. Oxford: Oxford University Press. 263--271 (1997; Zbl 0938.03535)
Boolos, George Is Hume’s principle analytic? (English) Zbl 0938.03506 Heck, Richard G. jun. (ed.), Language, thought, and logic. Essays in honour of Michael Dummett. Oxford: Oxford University Press. 245-261 (1997). MSC: 03A05 00A30 03F30 PDFBibTeX XMLCite \textit{G. Boolos}, in: Language, thought, and logic. Essays in honour of Michael Dummett. Oxford: Oxford University Press. 245--261 (1997; Zbl 0938.03506)
Wright, Crispin On the philosophical significance of Frege’s theorem. (English) Zbl 0938.03508 Heck, Richard G. jun. (ed.), Language, thought, and logic. Essays in honour of Michael Dummett. Oxford: Oxford University Press. 201-244 (1997). MSC: 03A05 00A30 03F30 PDFBibTeX XMLCite \textit{C. Wright}, in: Language, thought, and logic. Essays in honour of Michael Dummett. Oxford: Oxford University Press. 201--244 (1997; Zbl 0938.03508)
Frascolla, Pasquale The Tractatus system of arithmetic. (English) Zbl 0929.03005 Synthese 112, No. 3, 353-378 (1997). MSC: 03A05 03F30 PDFBibTeX XMLCite \textit{P. Frascolla}, Synthese 112, No. 3, 353--378 (1997; Zbl 0929.03005) Full Text: DOI
Mashuryan, Ashot Paths to the art of formal systems. Propositional calculus, predicate calculus, number theory. (Armenian) Zbl 0922.03002 Erevan: Noyyan Tappan, 252 p. (1997). Reviewer: Victor V.Pambuccian (Phoenix) MSC: 03-01 03B05 03B10 03F30 PDFBibTeX XMLCite \textit{A. Mashuryan}, Paths to the art of formal systems. Propositional calculus, predicate calculus, number theory (Armenian). Erevan: Noyyan Tappan (1997; Zbl 0922.03002)
Kuroda, Satoru Counting small sets in weak bounded arithmetic. (English) Zbl 0925.03191 RIMS Kokyuroku 976, 27-33 (1997). MSC: 03D15 03F30 68Q15 PDFBibTeX XMLCite \textit{S. Kuroda}, RIMS Kokyuroku 976, 27--33 (1997; Zbl 0925.03191)
Kikuchi, Makoto On Buss and Turán’s extensions of Haken’s results. (English) Zbl 0925.03210 RIMS Kokyuroku 976, 34-37 (1997). MSC: 03F20 03B35 03D15 03F30 68Q15 PDFBibTeX XMLCite \textit{M. Kikuchi}, RIMS Kokyuroku 976, 34--37 (1997; Zbl 0925.03210)
Ikeda, Kazuma Normal forms for derivations in Arai’s \(\text{AI}^-_\xi\). (English) Zbl 0925.03213 RIMS Kokyuroku 976, 38-54 (1997). MSC: 03F30 03D70 03F05 PDFBibTeX XMLCite \textit{K. Ikeda}, RIMS Kokyuroku 976, 38--54 (1997; Zbl 0925.03213)
Arai, Toshiyasu Consistency proof via pointwise induction. (English) Zbl 0925.03212 RIMS Kokyuroku 976, 125-134 (1997). MSC: 03F30 03F25 PDFBibTeX XMLCite \textit{T. Arai}, RIMS Kokyuroku 976, 125--134 (1997; Zbl 0925.03212)
Heck, Richard G. jun. (ed.) Language, thought, and logic. Essays in honour of Michael Dummett. (English) Zbl 0930.03005 Oxford: Oxford University Press. viii, 309 p. (1997). Reviewer: Heinrich Wansing (Dresden) MSC: 03A05 00A30 03-06 00B15 03F30 PDFBibTeX XMLCite \textit{R. G. Heck jun.} (ed.), Language, thought, and logic. Essays in honour of Michael Dummett. Oxford: Oxford University Press (1997; Zbl 0930.03005)
Tada, Mitsuru Division in the theory \(S_{2+}^0\) of bounded arithmetic. (English) Zbl 0921.03053 Interdiscip. Inf. Sci. 3, No. 2, 81-86 (1997). MSC: 03F30 PDFBibTeX XMLCite \textit{M. Tada}, Interdiscip. Inf. Sci. 3, No. 2, 81--86 (1997; Zbl 0921.03053) Full Text: DOI
Murzin, F. A. The Paris-Kirby construction and complexity problems. (English) Zbl 0914.03048 Chuvakov, V. P. (ed.), Current problems of modern mathematics. Collection of scientific works. Vol. 3. Novosibirsk: NII MIOO NGU. 125-130 (1997). Reviewer: A.N.Ryaskin (Novosibirsk) MSC: 03D15 03F30 03C13 68Q15 PDFBibTeX XMLCite \textit{F. A. Murzin}, in: Актуальные проблемы современной математики. Сборник научных трудов. Том 3. Novosibirsk: NII MIOO NGU. 125--130 (1997; Zbl 0914.03048)
Serebryanyj, A. I. Definability of the set of all true propositions of arithmetic by passage to the limit. (English. Russian original) Zbl 0920.03059 Russ. Math. Surv. 52, No. 2, 422-423 (1997); translation from Usp. Mat. Nauk 52, No. 2, 185-186 (1997). Reviewer: R.Kossak (New York) MSC: 03F30 03D20 PDFBibTeX XMLCite \textit{A. I. Serebryanyj}, Russ. Math. Surv. 52, No. 2, 422--423 (1997; Zbl 0920.03059); translation from Usp. Mat. Nauk 52, No. 2, 185--186 (1997) Full Text: DOI
Weispfenning, Volker Complexity and uniformity of elimination in Presburger arithmetic. (English) Zbl 0915.03032 Küchlin, Wolfgang W. (ed.), Proceedings of the 1997 international symposium on symbolic and algebraic computation, ISSAC ’97, Maui, HI, USA, July 21–23, 1997. New York, NY: ACM Press. 48-53 (1997). MSC: 03C10 03D15 03F30 03B25 68Q25 12L05 PDFBibTeX XMLCite \textit{V. Weispfenning}, in: Proceedings of the 1997 international symposium on symbolic and algebraic computation, ISSAC '97, Maui, HI, USA, July 21--23, 1997. New York, NY: ACM Press. 48--53 (1997; Zbl 0915.03032)
Plisko, V. E. Modified realizability and predicate logic. (English. Russian original) Zbl 0912.03027 Math. Notes 61, No. 2, 212-220 (1997); translation from Mat. Zametki 61, No. 2, 259-269 (1997). MSC: 03F30 03C62 03F50 PDFBibTeX XMLCite \textit{V. E. Plisko}, Math. Notes 61, No. 2, 212--220 (1997; Zbl 0912.03027); translation from Mat. Zametki 61, No. 2, 259--269 (1997) Full Text: DOI
Zhang, Dongmo; Shi, Qingsheng; Jiang, Ninggen; Zhu, Wujia Natural number system in MS. (Chinese. English summary) Zbl 0908.03046 J. Nanjing Univ. Aeronaut. Astronaut. 29, No. 2, 179-184 (1997). MSC: 03E72 03B52 03F30 03B20 PDFBibTeX XMLCite \textit{D. Zhang} et al., J. Nanjing Univ. Aeronaut. Astronaut. 29, No. 2, 179--184 (1997; Zbl 0908.03046)
Takaki, Osamu Strong normalization theorem for a constructive arithmetic with definition by transfinite recursion and bar induction. (English) Zbl 0937.03067 Notre Dame J. Formal Logic 38, No. 3, 350-373 (1997). Reviewer: S.V.Solov’ev (Durham) MSC: 03F30 03F05 03F50 PDFBibTeX XMLCite \textit{O. Takaki}, Notre Dame J. Formal Logic 38, No. 3, 350--373 (1997; Zbl 0937.03067) Full Text: DOI
Ammon, Kurt An automatic proof of Gödel’s incompleteness theorem. (English) Zbl 0900.68388 Artif. Intell. 95, No. 1, 203-207 (1997). MSC: 68T27 03F30 PDFBibTeX XMLCite \textit{K. Ammon}, Artif. Intell. 95, No. 1, 203--207 (1997; Zbl 0900.68388) Full Text: DOI
Aoyama, Kiwamu; Fukuzaki, Kenji Equivalence of the induction schema and the least number principle for open formulas. (English) Zbl 0902.03037 SUT J. Math. 33, No. 2, 149-162 (1997). Reviewer: R.Kossak (New York) MSC: 03F30 PDFBibTeX XMLCite \textit{K. Aoyama} and \textit{K. Fukuzaki}, SUT J. Math. 33, No. 2, 149--162 (1997; Zbl 0902.03037)
Tada, Mitsuru; Tatsuta, Makoto The function \(\lfloor a/m\rfloor\) in sharply bounded arithmetic. (English) Zbl 0894.03035 Arch. Math. Logic 37, No. 1, 51-57 (1997). Reviewer: M.Tada (Kawauchi) MSC: 03F30 PDFBibTeX XMLCite \textit{M. Tada} and \textit{M. Tatsuta}, Arch. Math. Logic 37, No. 1, 51--57 (1997; Zbl 0894.03035) Full Text: DOI
Maliaukienė, L. The constructive provability of a restricted axiom of double induction in the free variable additive arithmetic. (English) Zbl 0891.03031 Lith. Math. J. 37, No. 1, 46-53 (1997) and Liet. Mat. Rink. 37, No. 1, 61-70 (1997). MSC: 03F30 PDFBibTeX XMLCite \textit{L. Maliaukienė}, Lith. Math. J. 37, No. 1, 46--53 (1997) and Liet. Mat. Rink 37, No. 1, 61--70 (1997; Zbl 0891.03031) Full Text: DOI
Yavorsky, Rostislav E. Logical schemes for first order theories. (English) Zbl 0888.03018 Adian, S. (ed.) et al., Logical foundations of computer science. 4th international symposium, LFCS ’97, Yaroslavl, Russia, July 6–12, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1234, 410-418 (1997). MSC: 03C07 03B25 03F30 PDFBibTeX XMLCite \textit{R. E. Yavorsky}, Lect. Notes Comput. Sci. 1234, 410--418 (1997; Zbl 0888.03018)
Sidon, Tatiana Provability logic with operations on proofs. (English) Zbl 0888.03009 Adian, S. (ed.) et al., Logical foundations of computer science. 4th international symposium, LFCS ’97, Yaroslavl, Russia, July 6–12, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1234, 342-353 (1997). MSC: 03B45 03F30 PDFBibTeX XMLCite \textit{T. Sidon}, Lect. Notes Comput. Sci. 1234, 342--353 (1997; Zbl 0888.03009)
Krupski, Vladimir N. Operational logic of proofs with functionality condition on proof predicate. (English) Zbl 0888.03008 Adian, S. (ed.) et al., Logical foundations of computer science. 4th international symposium, LFCS ’97, Yaroslavl, Russia, July 6–12, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1234, 167-177 (1997). MSC: 03B45 03F30 03F05 PDFBibTeX XMLCite \textit{V. N. Krupski}, Lect. Notes Comput. Sci. 1234, 167--177 (1997; Zbl 0888.03008)
Bès, Alexis On Pascal triangles modulo a prime power. (English) Zbl 0889.11008 Ann. Pure Appl. Logic 89, No. 1, 17-35 (1997). Reviewer: D.Busneag (Craiova) MSC: 11B65 03B25 11U05 03F30 PDFBibTeX XMLCite \textit{A. Bès}, Ann. Pure Appl. Logic 89, No. 1, 17--35 (1997; Zbl 0889.11008) Full Text: DOI
Beltiukov, Anatoly Petrovich Intuitionistic formal theories with realizability in subrecursive classes. (English) Zbl 0895.03017 Ann. Pure Appl. Logic 89, No. 1, 3-15 (1997). Reviewer: J.S.Ullian (St.Louis) MSC: 03D20 03F30 03D15 68Q15 PDFBibTeX XMLCite \textit{A. P. Beltiukov}, Ann. Pure Appl. Logic 89, No. 1, 3--15 (1997; Zbl 0895.03017) Full Text: DOI
Bloch, Stephen On parallel hierarchies and \(R_k^i\). (English) Zbl 0892.03015 Ann. Pure Appl. Logic 89, No. 2-3, 231-273 (1997). Reviewer: M.Tetruašvili (Tbilisi) MSC: 03D15 03D55 03F30 PDFBibTeX XMLCite \textit{S. Bloch}, Ann. Pure Appl. Logic 89, No. 2--3, 231--273 (1997; Zbl 0892.03015) Full Text: DOI
Riis, Søren \(\text{Count}(q)\) does not imply \(\text{Count}(p)\). (English) Zbl 0891.03030 Ann. Pure Appl. Logic 90, No. 1-3, 1-56 (1997). Reviewer: R.Kossak (New York) MSC: 03F30 03F20 03D15 PDFBibTeX XMLCite \textit{S. Riis}, Ann. Pure Appl. Logic 90, No. 1--3, 1--56 (1997; Zbl 0891.03030) Full Text: DOI
D’Aquino, Paola Toward the limits of the Tennenbaum phenomenon. (English) Zbl 0889.03052 Notre Dame J. Formal Logic 38, No. 1, 81-92 (1997). Reviewer: R.Kossak (New York) MSC: 03F30 03H15 03C57 PDFBibTeX XMLCite \textit{P. D'Aquino}, Notre Dame J. Formal Logic 38, No. 1, 81--92 (1997; Zbl 0889.03052) Full Text: DOI
Sato, Masahiko Classical Brouwer-Heyting-Kolmogorov interpretation. (English) Zbl 0889.03051 Li, Ming (ed.) et al., Algorithmic learning theory. 8th international workshop, ALT ’97, Sendai, Japan, October 6–8, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1316, 176-196 (1997). MSC: 03F25 03F30 03F03 PDFBibTeX XMLCite \textit{M. Sato}, Lect. Notes Comput. Sci. 1316, 176--196 (1997; Zbl 0889.03051)
Ikeda, Kazuma A normal form for arithmetical derivations implying the \(\omega\)-consistency of arithmetic. (English) Zbl 0895.03024 Tsukuba J. Math. 21, No. 2, 285-304 (1997). Reviewer: G.Mints (Stanford) MSC: 03F30 03F05 PDFBibTeX XMLCite \textit{K. Ikeda}, Tsukuba J. Math. 21, No. 2, 285--304 (1997; Zbl 0895.03024) Full Text: DOI
Plisko, V. Two semantics and logics based on the Gödel interpretation. (English) Zbl 0893.03021 Gottlob, Georg (ed.) et al., Computational logic and proof theory. 5th Kurt Gödel Colloquium, KGC ’97. Vienna, Austria. August 25–29, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1289, 233-240 (1997). Reviewer: F.G.Asenjo (Pittsburgh) MSC: 03F50 03F30 03F55 PDFBibTeX XMLCite \textit{V. Plisko}, Lect. Notes Comput. Sci. 1289, 233--240 (1997; Zbl 0893.03021)
Lifsches, Shmuel; Shelah, Saharon Peano arithmetic may not be interpretable in the monadic theory of linear orders. (English) Zbl 0888.03033 J. Symb. Log. 62, No. 3, 848-872 (1997). Reviewer: J.M.Plotkin (East Lansing) MSC: 03E35 03F25 03F30 03C85 PDFBibTeX XMLCite \textit{S. Lifsches} and \textit{S. Shelah}, J. Symb. Log. 62, No. 3, 848--872 (1997; Zbl 0888.03033) Full Text: DOI arXiv
Strannegård, Claes Arithmetical realizations of modal formulas. (English) Zbl 0881.03011 Acta Philosophica Gothoburgensia. 5. Göteborg: Univ. Göteborg. 91 p. (1997). MSC: 03B45 03F30 PDFBibTeX XMLCite \textit{C. Strannegård}, Arithmetical realizations of modal formulas. Göteborg: Univ. Göteborg (1997; Zbl 0881.03011)
Weiermann, Andreas A proof of strongly uniform termination for Gödel’s \(T\) by methods from local predicativity. (English) Zbl 0889.03049 Arch. Math. Logic 36, No. 6, 445-460 (1997). Reviewer: H.Schwichtenberg (München) MSC: 03F10 03F20 03F30 03D15 03D20 PDFBibTeX XMLCite \textit{A. Weiermann}, Arch. Math. Logic 36, No. 6, 445--460 (1997; Zbl 0889.03049) Full Text: DOI
Kikuchi, Makoto Kolmogorov complexity and the second incompleteness theorem. (English) Zbl 0883.03042 Arch. Math. Logic 36, No. 6, 437-443 (1997). MSC: 03F30 68Q30 PDFBibTeX XMLCite \textit{M. Kikuchi}, Arch. Math. Logic 36, No. 6, 437--443 (1997; Zbl 0883.03042) Full Text: DOI
Willard, Dan E. The tangibility reflection principle for self-verifying axiom systems. (English) Zbl 0884.03056 Gottlob, Georg (ed.) et al., Computational logic and proof theory. 5th Kurt Gödel Colloquium, KGC ’97. Vienna, Austria. August 25–29, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1289, 319-334 (1997). MSC: 03F30 PDFBibTeX XMLCite \textit{D. E. Willard}, Lect. Notes Comput. Sci. 1289, 319--334 (1997; Zbl 0884.03056)
Beklemishev, Lev D. Parameter free induction and reflection. (English) Zbl 0892.03023 Gottlob, Georg (ed.) et al., Computational logic and proof theory. 5th Kurt Gödel Colloquium, KGC ’97. Vienna, Austria. August 25–29, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1289, 103-113 (1997). Reviewer: M.Tetruašvili (Tbilisi) MSC: 03F30 03D20 PDFBibTeX XMLCite \textit{L. D. Beklemishev}, Lect. Notes Comput. Sci. 1289, 103--113 (1997; Zbl 0892.03023)
Barbanera, Franco; Berardi, Stefano; Schivalocchi, Massimo “Classical” programming-with-proofs in \(\lambda_{\text{PA}}^{\text{Sym}}\): An analysis of non-confluence. (English) Zbl 0885.03029 Abadi, Martín (ed.) et al., Theoretical aspects of computer software. 3rd international symposium, TACS ’97. Sendai, Japan, September 23–26, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1281, 365-390 (1997). MSC: 03B70 03F30 03B40 68Q60 PDFBibTeX XMLCite \textit{F. Barbanera} et al., Lect. Notes Comput. Sci. 1281, 365--390 (1997; Zbl 0885.03029)
Horsten, Leon Provability in principle and controversial constructivistic principles. (English) Zbl 0883.03011 J. Philos. Log. 26, No. 6, 635-660 (1997). Reviewer: Leon Horsten (Leuven) MSC: 03B45 03F50 03F30 03F55 PDFBibTeX XMLCite \textit{L. Horsten}, J. Philos. Log. 26, No. 6, 635--660 (1997; Zbl 0883.03011) Full Text: DOI
Chong, C. T.; Yang, Yue \(\Sigma_ 2\) induction and infinite injury priority arguments. II. Tame \(\Sigma_ 2\) coding and the jump operator. (English) Zbl 0881.03023 Ann. Pure Appl. Logic 87, No. 2, 103-116 (1997). Reviewer: L.Harkleroad (Ithaca) MSC: 03D25 03C62 03F30 PDFBibTeX XMLCite \textit{C. T. Chong} and \textit{Y. Yang}, Ann. Pure Appl. Logic 87, No. 2, 103--116 (1997; Zbl 0881.03023) Full Text: DOI
Strahm, Thomas Polynomial time operations in explicit mathematics. (English) Zbl 0891.03023 J. Symb. Log. 62, No. 2, 575-594 (1997). Reviewer: M.Yasuhara (Princeton) MSC: 03F03 03D15 68Q15 03F30 PDFBibTeX XMLCite \textit{T. Strahm}, J. Symb. Log. 62, No. 2, 575--594 (1997; Zbl 0891.03023) Full Text: DOI
Krajíček, Jan Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic. (English) Zbl 0891.03029 J. Symb. Log. 62, No. 2, 457-486 (1997). Reviewer: M.Yasuhara (Princeton) MSC: 03F20 03F30 03B05 03D15 68Q15 PDFBibTeX XMLCite \textit{J. Krajíček}, J. Symb. Log. 62, No. 2, 457--486 (1997; Zbl 0891.03029) Full Text: DOI
Lindström, Per Aspects of incompleteness. (English) Zbl 0882.03054 Lecture Notes in Logic. 10. Berlin: Springer. x, 132 p. (1997). Reviewer: F.G.Asenjo (Pittsburgh) MSC: 03F30 03F40 03-02 PDFBibTeX XMLCite \textit{P. Lindström}, Aspects of incompleteness. Berlin: Springer (1997; Zbl 0882.03054)
Kashima, Ryo; Yamaguchi, Takeshi On the difficulty of writing out formal proofs in arithmetic. (English) Zbl 0880.03031 Math. Log. Q. 43, No. 3, 328-332 (1997). Reviewer: R.Kossak (New York) MSC: 03F30 03D25 PDFBibTeX XMLCite \textit{R. Kashima} and \textit{T. Yamaguchi}, Math. Log. Q. 43, No. 3, 328--332 (1997; Zbl 0880.03031) Full Text: DOI
Christian, C. C. An equivalent to the first incompleteness theorem. (Ein Äquivalent zum 1. Unvollständigkeitssatz.) (German) Zbl 0882.03053 Sitzungsber., Abt. II, Österr. Akad. Wiss., Math.-Naturwiss. Kl. 205(1996), 35-55 (1997). Reviewer: A.Cantini (Firenze) MSC: 03F30 03D35 PDFBibTeX XMLCite \textit{C. C. Christian}, Sitzungsber., Abt. II, Österr. Akad. Wiss., Math.-Naturwiss. Kl. 205, 35--55 (1997; Zbl 0882.03053)
Di Paola, Robert A.; Montagna, Franco Progressions of theories of bounded arithmetic. (English) Zbl 0881.03029 Sorbi, Andrea (ed.), Complexity, logic, and recursion theory. New York, NY: Marcel Dekker. Lect. Notes Pure Appl. Math. 187, 123-156 (1997). Reviewer: R.Kossak (New York) MSC: 03F30 03F15 68Q15 PDFBibTeX XMLCite \textit{R. A. Di Paola} and \textit{F. Montagna}, Lect. Notes Pure Appl. Math. 187, 123--156 (1997; Zbl 0881.03029)
Shavrukov, V. Yu. Interpreting reflexive theories in finitely many axioms. (English) Zbl 0874.03066 Fundam. Math. 152, No. 2, 99-116 (1997). MSC: 03F25 03F30 PDFBibTeX XMLCite \textit{V. Yu. Shavrukov}, Fundam. Math. 152, No. 2, 99--116 (1997; Zbl 0874.03066) Full Text: EuDML
Priest, Graham Inconsistent models of arithmetic. I: Finite models. (English) Zbl 0878.03017 J. Philos. Log. 26, No. 2, 223-235 (1997). Reviewer: J.Mackenzie (Sydney) MSC: 03B53 PDFBibTeX XMLCite \textit{G. Priest}, J. Philos. Log. 26, No. 2, 223--235 (1997; Zbl 0878.03017) Full Text: DOI
Damnjanovic, Zlatan Elementary realizability. (English) Zbl 0874.03067 J. Philos. Log. 26, No. 3, 311-339 (1997). MSC: 03F30 03F65 03D20 PDFBibTeX XMLCite \textit{Z. Damnjanovic}, J. Philos. Log. 26, No. 3, 311--339 (1997; Zbl 0874.03067) Full Text: DOI
Beklemishev, Lev D. Induction rules, reflection principles, and provably recursive functions. (English) Zbl 0882.03055 Ann. Pure Appl. Logic 85, No. 3, 193-242 (1997). Reviewer: M.Yasuhara (Princeton) MSC: 03F30 03D20 PDFBibTeX XMLCite \textit{L. D. Beklemishev}, Ann. Pure Appl. Logic 85, No. 3, 193--242 (1997; Zbl 0882.03055) Full Text: DOI
Riis, Søren Count\((q)\) versus the pigeon-hole principle. (English) Zbl 0884.03055 Arch. Math. Logic 36, No. 3, 157-188 (1997). Reviewer: P.Jančar (Ostrava) MSC: 03F30 03D15 68Q15 03C25 03B05 PDFBibTeX XMLCite \textit{S. Riis}, Arch. Math. Logic 36, No. 3, 157--188 (1997; Zbl 0884.03055) Full Text: DOI
Avigad, Jeremy; Sommer, Richard A model-theoretic approach to ordinal analysis. (English) Zbl 0874.03068 Bull. Symb. Log. 3, No. 1, 17-52 (1997). Reviewer: M.Yasuhara (Princeton) MSC: 03F35 03F30 03F15 03C62 03H15 PDFBibTeX XMLCite \textit{J. Avigad} and \textit{R. Sommer}, Bull. Symb. Log. 3, No. 1, 17--52 (1997; Zbl 0874.03068) Full Text: DOI Link Backlinks: MO