Can There Be A Proof That Some Unprovable Arithmetic Sentence Is True?

Dialectica 43 (3):289-292 (1989)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



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

External links

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

Through your library

Analytics

Added to PP
2014-04-08

Downloads
11 (#1,147,580)

6 months
4 (#1,005,419)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

Philip Hugly
University of California, Berkeley (PhD)
Charles Sayward
University of Nebraska, Lincoln

Citations of this work

No citations found.

Add more citations

References found in this work

Elementary logic.Benson Mates - 1972 - New York,: Oxford University Press.
Formal logic: its scope and limits.Richard C. Jeffrey - 1967 - Indianapolis, IN: Hackett.
Sets, Logic, and Axiomatic Theories.Alfons Borgers - 2003 - San Francisco, CA, USA: W.H. Freeman.
Introduction to symbolic logic.John L. Pollock - 1969 - New York,: Holt, Rinehart and Winston.
Understanding symbolic logic.Gerald J. Massey - 1970 - New York,: Harper & Row.

Add more references