Abstract
In this paper we use fixed-point modal logic to study the logical properties of justified norms in Scanlonian contractualism. We show a natural connection between Scanlon’s test for justifiability and the computation of the smallest fixed point; we rebut a common charge of vacuity based on the recursive character of the proposal; we show that the resulting justification operator is not a normal modality, and we explore the epistemic component often left implicit in the justification procedure. Given that such procedural justifications have so far not been investigated using modern logical tools, this paper contributes both to deontic logic and to the literature on contractualism in ethics.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Barry, B.M.: Justice as impartiality. Oxford UP (1995)
Fontaine, G.M.M.: Modal fixpoint logic: some model theoretic questions. Ph.D. thesis, Institute for Logic, Language and Computation (2010)
Menzies, P.: Counterfactual theories of causation. In: Zalta, E.N. (ed.) The Stanford Encyclopedia of Philosophy, Spring 2014 edn. (2014)
Pogge, T.W.: What we can reasonably reject. Nous 35(s1), 118–147 (2001)
Scanlon, T.: What we owe to each other. Harvard University Press (1998)
Smith, M.: The moral problem (1994)
Tarski, A., et al.: A lattice-theoretical fixpoint theorem and its applications. Pacific Journal of Mathematics 5(2), 285–309 (1955)
Venema, Y.: Lectures on the modal μ-calculus (2008) (manuscript)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Rechenauer, M., Roy, O. (2014). The Logical Structure of Scanlon’s Contractualism. In: Cariani, F., Grossi, D., Meheus, J., Parent, X. (eds) Deontic Logic and Normative Systems. DEON 2014. Lecture Notes in Computer Science(), vol 8554. Springer, Cham. https://doi.org/10.1007/978-3-319-08615-6_13
Download citation
DOI: https://doi.org/10.1007/978-3-319-08615-6_13
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-08614-9
Online ISBN: 978-3-319-08615-6
eBook Packages: Computer ScienceComputer Science (R0)