Switch to: References

Add citations

You must login to add citations.
  1. Are dispositions reducible?George Molnar - 1999 - Philosophical Quarterly 49 (194):1-17.
  • Who’s Afraid of C eteris-Paribus Laws? Or: How I Learned to Stop Worrying and Love Them.Marc Lange - 2002 - Erkenntnis 57 (3):407-423.
    Ceteris-paribus clauses are nothing to worry about; aceteris-paribus qualifier is not poisonously indeterminate in meaning. Ceteris-paribus laws teach us that a law need not be associated straightforwardly with a regularity in the manner demanded by regularity analyses of law and analyses of laws as relations among universals. This lesson enables us to understand the sense in which the laws of nature would have been no different under various counterfactual suppositions — a feature even of those laws that involve no ceteris-paribus (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   74 citations  
  • Towards a General Theory of Reduction. Part III: Cross-Categorical Reduction.C. A. Hooker - 1981 - Dialogue 20 (3):496-529.
    Any theory of reduction that goes only so far as carried in Parts I and II does only half the job. Prima facie at least, there are cases of would-be reduction which seem torn between two conflicting intuitions. On the one side there is a strong intuition that reduction is involved, and a strongly retentive reduction at that. On the other side it seems that the concepts at one level cross-classify those at the other level, so that there is no (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   28 citations  
  • Ought, obligation and duty.Harry Beran - 1972 - Australasian Journal of Philosophy 50 (3):207-221.
  • A conjunctive normal form for S3.5.M. J. Cresswell - 1969 - Journal of Symbolic Logic 34 (2):253-255.
    In this note we sketch a decision procedure for S3.51 based on reduction to conjunctive normal form. Using the following theorem of S3.5: and its dual for M over a conjunction, any formula can be reduced by standard methods (as in S52) to a conjunction of disjunctions of the form where Í is (p ⊃ p), 0 is ∼(p ⊃ p) and α — λ are all PC-wffs (i.e. they contain no modal operators).
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   1 citation