Analogy and Balancing: The Partial Reducibility Thesis and Its Problems

Revus 25:141-154 (2015)
  Copy   BIBTEX

Abstract

With an analysis of the structure and the sequence of analogy, the paper is mainly a critique to the partial reducibility thesis: a thesis sustaining that analogy, besides a strictly analogical step, is in the remaining part reducible to balancing. Thus, the paper points out some problems raised by the partial reducibility thesis, such as the contingency of reducibility or the fact that a proper analogy is done under the cover of a balancing. The main point is, however, the claim that analogy and balancing have opposite normative conditions, being this premise the reason to a structural explanation for the unacceptability of the reducibility enterprise

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,873

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

On Nondeterminism, Enumeration Reducibility and Polynomial Bounds.Kate Copestake - 1997 - Mathematical Logic Quarterly 43 (3):287-310.
Strong reducibility of partial numberings.Dieter Spreen - 2005 - Archive for Mathematical Logic 44 (2):209-217.
Effective embeddings into strong degree structures.Timothy H. McNicholl - 2003 - Mathematical Logic Quarterly 49 (3):219.
Strong Enumeration Reducibilities.Roland Sh Omanadze & Andrea Sorbi - 2006 - Archive for Mathematical Logic 45 (7):869-912.
Coloring linear orders with Rado's partial order.Riccardo Camerlo & Alberto Marcone - 2007 - Mathematical Logic Quarterly 53 (3):301-305.
Prinzipien, ideales Sollen und normative Argumente.Jan Sieckmann - 2011 - Archiv für Rechts- und Sozialphilosophie 97 (2):178-197.
The Construction of Constitutional Rights.Robert Alexy - 2010 - Law and Ethics of Human Rights 4 (1):21-32.
A New Reducibility between Turing‐ and wtt‐Reducibility.Sui Yuefei - 1994 - Mathematical Logic Quarterly 40 (1):106-110.
Bounded enumeration reducibility and its degree structure.Daniele Marsibilio & Andrea Sorbi - 2012 - Archive for Mathematical Logic 51 (1-2):163-186.
Embeddings in the Strong Reducibilities Between 1 and npm.Phil Watson - 1997 - Mathematical Logic Quarterly 43 (4):559-568.
On the Structure of Legal Principles.Robert Alexy - 2000 - Ratio Juris 13 (3):294-304.

Analytics

Added to PP
2015-03-18

Downloads
12 (#1,109,823)

6 months
4 (#854,689)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references