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

Abstract : 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
Options
 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: 5,865
External links
  • Through your library Configure

    Similar books and articles

    Analytics

    Monthly downloads

    Added to index

    2009-01-28

    Total downloads

    2 ( #234,562 of 556,747 )

    Recent downloads (6 months)

    1 ( #64,754 of 556,747 )

    How can I increase my downloads?


    My notes
    Sign in to use this feature


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

    Other forums