A New Proof of a Theorem of Dienes

&
Journal of Symbolic Logic 16 (4):276 (1951)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2267922

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

Rose Alan. A new proof of a theorem of Dienes. Norsk matematish tidsskrift, vol. 33 , pp. 27–29.Nicholas Rescher - 1951 - Journal of Symbolic Logic 16 (4):276-276.
Gleason's theorem has a constructive proof.Fred Richman - 2000 - Journal of Philosophical Logic 29 (4):425-431.
Tait's conservative extension theorem revisited.Ryota Akiyoshi - 2010 - Journal of Symbolic Logic 75 (1):155-167.
A proof of the normal form theorem for the closed terms of Girard's system F by means of computability.Silvio Valentini - 1993 - Mathematical Logic Quarterly 39 (1):539-544.
Kleene's proof of g¨odel's theorem.Peter Smith - unknown
Proof-theoretic investigations on Kruskal's theorem.Michael Rathjen & Andreas Weiermann - 1993 - Annals of Pure and Applied Logic 60 (1):49-88.
The Intimate Relationship Between the McNaughton and the Chinese Remainder Theorems for MV-algebras.Eduardo J. Dubuc & Yuri Poveda - 2013 - Studia Logica 101 (3):483-485.
Other Proofs of Old Results.Henryk Kotlarski - 1998 - Mathematical Logic Quarterly 44 (4):474-480.
A short proof of reny's existence theorem for payoff secure games.Pavlo Prokopovych - unknown
A Negation-free Proof of Cantor's Theorem.N. Raja - 2005 - Notre Dame Journal of Formal Logic 46 (2):231-233.
A simpler proof of Jensen's coding theorem.Sy D. Friedman - 1994 - Annals of Pure and Applied Logic 70 (1):1-16.
An intuitionistic version of zermelo's proof that every choice set can be well-ordered.J. Todd Wilson - 2001 - Journal of Symbolic Logic 66 (3):1121-1126.
On the proof of Solovay's theorem.Dick de Jongh, Marc Jumelet & Franco Montagna - 1991 - Studia Logica 50 (1):51-69.
The four-color theorem and mathematical proof.Michael Detlefsen & Mark Luker - 1980 - Journal of Philosophy 77 (12):803-820.
A proof of axiomatizability of łukasiewicz’s three-valued implicational propositional calculus.T. Prucnal - 1967 - Studia Logica 20 (1):144-144.

Analytics

Added to PP
2013-11-22

Downloads
3 (#1,686,544)

6 months
1 (#1,510,037)

Historical graph of downloads

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

Author's Profile

Nicholas Rescher
University of Pittsburgh

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references