On the reducibility of relations: Variations on a theme of Peirce

: The paper presents some mathematical aspects of the question of reducibility of relations. After giving a formal definition of reducibility we present the basic result (due to Herzberger) to the effect that relations of valency at least 3 are always reducible if the cardinality of the relation is at most equal to the cardinality of the underlying set (which is automatically the case if this set is infinite). In contrast to this, if the term "reduction" is given a practicable form, relations on finite sets are "generically" irreducible, as is shown by a simple counting argument. Next we discuss the question of an "intrinsic" criterion for reducibility. Finally we propose a scheme for the graphic representation of reductions
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1353/csp.2007.0034
 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: 16,667
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

Monthly downloads

Added to index


Total downloads

3 ( #483,044 of 1,726,249 )

Recent downloads (6 months)

1 ( #369,877 of 1,726,249 )

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.