Wang Hao. Arithmetic translations of axiom systems. Transactions of the American Mathematical Society, vol. 71 , pp. 283–293 [Book Review]

Journal of Symbolic Logic 21 (4):402-403 (1956)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2268417

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

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: Hao Wang, Arithmetic Translations of Axiom Systems. [REVIEW]Richard Montague - 1956 - Journal of Symbolic Logic 21 (4):402-403.
Alan Rose and J. Barkley Rosser. Fragments of many-valued statement calculi. Transactions of the American Mathematical Society, vol. 87 , pp. 1–53. - C. A. Meredith. The dependence of an axiom of Łukasiewicz. Transactions of the American Mathematical Society, vol. 87 , p. 54. - C. C. Chang. Proof of an axiom of Łukasiewicz. Transactions of the American Mathematical Society, vol. 87 , pp. 55–56. [REVIEW]Atwell R. Turquette - 1959 - Journal of Symbolic Logic 24 (3):248-249.
Arithmetic Translations of Axiom Systems.Hao Wang - 1956 - Journal of Symbolic Logic 21 (4):402-403.
Wang Hao. Truth definitions and consistency proofs. Transactions of the American Mathematical Society, vol. 73 , pp. 243–275. [REVIEW]Richard Montague - 1957 - Journal of Symbolic Logic 22 (4):365-367.
Finite reverse mathematics.Harvey Friedman - manuscript
Halpern J. D. and Läuchli H.. A partition theorem. Transactions of the American Mathematical Society, vol. 124 , pp. 360–367.Halpern J. D. and Lévy A.. The Boolean prime ideal theorem does not imply the axiom of choice. Axiomatic set theory, Proceedings of symposia in pure mathematics, vol. 13 part 1, American Mathematical Society, Providence, Rhode Island, 1971, pp. 83–134. [REVIEW]David Pincus - 1974 - Journal of Symbolic Logic 39 (1):181-182.
Wang Hao. The mechanization of mathematical arguments. Experimental arithmetic, high speed computing and mathematics, Proceedings of symposia in applied mathematics, vol. 15, American Mathematical Society, Providence 1963, pp. 31–40. [REVIEW]David C. Cooper - 1967 - Journal of Symbolic Logic 32 (1):120-120.
Maximum Schemes in Arithmetic.A. Fernández-Margarit & M. J. Pérez-Jiménez - 1994 - Mathematical Logic Quarterly 40 (3):425-430.
On the correspondence between arithmetic theories and propositional proof systems – a survey.Olaf Beyersdorff - 2009 - Mathematical Logic Quarterly 55 (2):116-137.
Equivalence of F with a sub-theory of peano arithmetic.Andrew Boucher - manuscript
The development of arithmetic in Frege's Grundgesetze der Arithmetik.Richard Heck - 1993 - Journal of Symbolic Logic 58 (2):579-601.
The strength of nonstandard methods in arithmetic.C. Ward Henson, Matt Kaufmann & H. Jerome Keisler - 1984 - Journal of Symbolic Logic 49 (4):1039-1058.
Self-verifying axiom systems, the incompleteness theorem and related reflection principles.Dan Willard - 2001 - Journal of Symbolic Logic 66 (2):536-596.
An algebraic treatment of quantifier-free systems of arithmetic.Franco Montagna - 1996 - Archive for Mathematical Logic 35 (4):209-224.
How to extend the semantic tableaux and cut-free versions of the second incompleteness theorem almost to Robinson's arithmetic Q.Dan E. Willard - 2002 - Journal of Symbolic Logic 67 (1):465-496.

Analytics

Added to PP
2016-06-30

Downloads
1 (#1,889,095)

6 months
1 (#1,516,429)

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references