Semantic closure, descriptions and non-triviality

Journal of Philosophical Logic 28 (6):549--558 (1999)
It is known that a semantically closed theory with description may well be trivial if the principles concerning denotation and descriptions are formulated in certain ways, even if the underlying logic is paraconsistent. This paper establishes the nontriviality of a semantically closed theory with a natural, but non-extensional, description operator
Keywords denotation  descriptions  non-extensionality  non-triviality  paraconsistency  semantic closure
Categories (categorize this paper)
DOI 10.1023/A:1004608013532
 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
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 23,674
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

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles
Robert J. Stainton (1998). Unembedded Definite Descriptions and Relevance. Revista Alicantina de Estudios Ingleses 11:231-239.
Richard Brown (2008). Language, Thought, Logic, and Existence. CALIPSO (Conference Addresses of the Long Island Philosophical Society Online) 1 (2):
Graham Priest (1991). Minimally Inconsistent LP. Studia Logica 50 (2):321 - 331.
Graham Priest (1984). Semantic Closure. Studia Logica 43 (1-2):117 - 129.

Monthly downloads

Added to index


Total downloads

31 ( #153,701 of 1,903,046 )

Recent downloads (6 months)

2 ( #324,600 of 1,903,046 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.