Can a language have indenumerably many expressions?

History and Philosophy of Logic 4 (1-2):73-82 (1983)
A common assumption among philosophers is that every language has at most denumerably many expressions. This assumption plays a prominent role in many philosophical arguments. Recently formal systems with indenumerably many elements have been developed. These systems are similar to the more familiar denumerable first-order languages. This similarity makes it appear that the assumption is false. We argue that the assumption is true
Keywords denumerably many expressions  indenumerably many expressions
Categories (categorize this paper)
DOI 10.1080/01445348308837046
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history
Request removal from index
Download options
Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 28,777
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA
Logic, Semantics, Metamathematics.Alfred Tarski - 1956 - Oxford, Clarendon Press.
String Theory.John Corcoran, William Frank & Michael Maloney - 1974 - Journal of Symbolic Logic 39 (4):625-637.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

18 ( #273,548 of 2,177,988 )

Recent downloads (6 months)

1 ( #317,698 of 2,177,988 )

How can I increase my downloads?

My notes
Sign in to use this feature

There  are no threads in this forum
Nothing in this forum yet.

Other forums