Transactions of the Charles S. Peirce Society 43 (3):509 - 520 (2007)
|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)|
|Through your library||Configure|
Similar books and articles
E. Hermann (1992). 1-Reducibility Inside an M-Degree with Maximal Set. Journal of Symbolic Logic 57 (3):1046-1056.
John Bacon (1986). Supervenience, Necessary Coextensions, and Reducibility. Philosophical Studies 49 (March):163-76.
Andrea Sorbi (1982). ∑0n-Equivalence Relations. Studia Logica 41 (4):351-358.
Samuel Coskey & Joel David Hamkins (2010). Infinite Time Decidable Equivalence Relation Theory. Notre Dame Journal of Formal Logic 52 (2):203-228.
Alessio Moneta (2005). Causality in Macroeconometrics: Some Considerations About Reductionism and Realism. Journal of Economic Methodology 12 (3):433-453.
Karl-Georg Niebergall (2000). On the Logic of Reducibility: Axioms and Examples. Erkenntnis 53 (1-2):27-61.
Douglas Cenzer (1984). Monotone Reducibility and the Family of Infinite Sets. Journal of Symbolic Logic 49 (3):774-782.
Claudio Bernardi & Andrea Sorbi (1983). Classifying Positive Equivalence Relations. Journal of Symbolic Logic 48 (3):529-538.
Added to index2009-01-28
Total downloads2 ( #234,562 of 556,747 )
Recent downloads (6 months)1 ( #64,754 of 556,747 )
How can I increase my downloads?