A direct proof of Wiener's theorem

&
In S. Barry Cooper (ed.), How the World Computes. pp. 293--302 (2012)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Links

PhilArchive



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

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

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.
Weak König's Lemma Implies Brouwer's Fan Theorem: A Direct Proof.Hajime Ishihara - 2006 - Notre Dame Journal of Formal Logic 47 (2):249-252.
A proofless proof of the Barwise compactness theorem.Mark Howard - 1988 - Journal of Symbolic Logic 53 (2):597-602.
Kleene's proof of g¨odel's theorem.Peter Smith - unknown
Some applications of computable one-one numberings.Martin Kummer - 1990 - Archive for Mathematical Logic 30 (4):219-230.
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 new proof that analytic sets are Ramsey.Erik Ellentuck - 1974 - Journal of Symbolic Logic 39 (1):163-165.
A proof-theoretic analysis of collection.Lev D. Beklemishev - 1998 - Archive for Mathematical Logic 37 (5-6):275-296.
Generalizations of Kochen and Specker's theorem and the effectiveness of Gleason's theorem.Itamar Pitowsky - 2003 - Studies in History and Philosophy of Science Part B: Studies in History and Philosophy of Modern Physics 35 (2):177-194.
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.
Proof-theoretic modal PA-Completeness III: The syntactic proof.Paolo Gentilini - 1999 - Studia Logica 63 (3):301-310.
A short proof of reny's existence theorem for payoff secure games.Pavlo Prokopovych - unknown
A direct proof of the finite developments theorem.Roel de Vrijer - 1985 - Journal of Symbolic Logic 50 (2):339-343.

Analytics

Added to PP
2014-01-28

Downloads
9 (#1,154,504)

6 months
4 (#573,918)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Peter Schuster
University of Leeds

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references