Symmetric propositions and logical quantifiers

Journal of Philosophical Logic 37 (6):575 - 591 (2008)
Symmetric propositions over domain and signature are characterized following Zermelo, and a correlation of such propositions with logical type- quantifiers over is described. Boolean algebras of symmetric propositions over and Σ are shown to be isomorphic to algebras of logical type- quantifiers over . This last result may provide empirical support for Tarski’s claim that logical terms over fixed domain are all and only those invariant under domain permutations.
Keywords generalized quantifier  logical notion  symmetric proposition
Categories (categorize this paper)
 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,217
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

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

20 ( #232,507 of 1,939,385 )

Recent downloads (6 months)

4 ( #225,908 of 1,939,385 )

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.