Countable valued fields in weak subsystems of second-order arithmetic

&
Annals of Pure and Applied Logic 41 (1):27-32 (1989)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/0168-0072(89)90006-7

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,069

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Review: Stephen G. Simpson, Subsystems of Second Order Arithmetic. [REVIEW]Peter Cholak - 1999 - Journal of Symbolic Logic 64 (3):1356-1357.
Review: Stephen G. Simpson, Friedman's Research on Subsystems of Second Order Arithmetic. [REVIEW]Wilfried Sieg - 1990 - Journal of Symbolic Logic 55 (2):870-874.
Harvey M. Friedman, Stephen G. Simpson, and Rick L. Smith. Countable algebra and set existence axioms. Annals of pure and applied logic, vol. 25 , pp. 141–181. - Harvey M. Friedman, Stephen G. Simpson, and Rick L. Smith. Addendum to “Countable algebra and set existence axioms.” Annals of pure and applied logic, vol. 28 , pp. 319–320. [REVIEW]Peter G. Clote - 1987 - Journal of Symbolic Logic 52 (1):276-278.
Stephen G. Simpson subsystems of second-order arithmetic.Jeffrey Ketland - 2001 - British Journal for the Philosophy of Science 52 (1):191-195.
Logic and computation, Proceedings of a workshop held at Carnegie Mellon University, June 30–July 2, 1987, edited by Wilfried Sieg, Contemporary Mathematics, vol. 106, American Mathematical Society, Providence1990, xiv + 297 pp. - Douglas K. Brown. Notions of closed subsets of a complete separable metric space in weak subsystems of second order arithmetic. Pp. 39–50. - Kostas Hatzikiriakou and Stephen G. Simpson. WKL0 and orderings of countable abelian groups. Pp. 177–180. - Jeffry L. Hirst. Marriage theorems and reverse mathematics. Pp. 181–196. - Xiaokang Yu. Radon–Nikodym theorem is equivalent to arithmetical comprehension. Pp. 289–297. - Fernando Ferreira. Polynomial time computable arithmetic. Pp. 137–156. - Wilfried Buchholz and Wilfried Sieg. A note on polynomial time computable arithmetic. Pp. 51–55. - Samuel R. Buss. Axiomatizations and conservation results for fragments of bounded arithmetic. Pp. 57–84. - Gaisi Takeuti. Sharply bounded arithmetic and the function a – 1. Pp. 2. [REVIEW]Jörg Hudelmaier - 1996 - Journal of Symbolic Logic 61 (2):697-699.
Stephen G. Simpson. Subsystems of second order arithmetic. Perspectives in mathematical logic. Springer, Berlin, Heidelberg, New York, etc., 1999, xiv + 445 pp. [REVIEW]Peter Cholak - 1999 - Journal of Symbolic Logic 64 (3):1356-1357.
Formalizing forcing arguments in subsystems of second-order arithmetic.Jeremy Avigad - 1996 - Annals of Pure and Applied Logic 82 (2):165-191.
Fixed point theory in weak second-order arithmetic.Naoki Shioji & Kazuyuki Tanaka - 1990 - Annals of Pure and Applied Logic 47 (2):167-188.
Jeremy Avigad. Formalizing forcing arguments in subsystems of second-order arithmetic. Annals of pure and applied logic, vol. 82 , pp. 165–191. [REVIEW]Alberto Marcone - 2001 - Bulletin of Symbolic Logic 7 (3):390-391.
Stephen G. Simpson. Friedman's research on subsystems of second order arithmetic. Harvey Friedman's research on the foundations of mathematics, edited by L. A. Harrington, M. D. Morley, A. S̆c̆edrov, and S. G. Simpson, Studies in logic and the foundations of mathematics, vol. 117, North-Holland, Amsterdam, New York, and Oxford, 1985, pp. 137–159. [REVIEW]Wilfried Sieg - 1990 - Journal of Symbolic Logic 55 (2):870-874.

Analytics

Added to PP
2014-01-16

Downloads
18 (#859,297)

6 months
3 (#1,046,495)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Structure of semisimple rings in reverse and computable mathematics.Huishan Wu - 2023 - Archive for Mathematical Logic 62 (7):1083-1100.

Add more citations

References found in this work

Ordinal numbers and the Hilbert basis theorem.Stephen G. Simpson - 1988 - Journal of Symbolic Logic 53 (3):961-974.
Countable algebra and set existence axioms.Harvey M. Friedman - 1983 - Annals of Pure and Applied Logic 25 (2):141.
Factorization of polynomials and °1 induction.S. G. Simpson - 1986 - Annals of Pure and Applied Logic 31:289.

Add more references