Review of Symbolic Logic 4 (1):130-149 (2011)

Authors
Robert Williams
University of Leeds
Abstract
Supervaluationism is often described as the most popular semantic treatment of indeterminacy. There???s little consensus, however, about how to fill out the bare-bones idea to include a characterization of logical consequence. The paper explores one methodology for choosing between the logics: pick a logic that norms belief as classical consequence is standardly thought to do. The main focus of the paper considers a variant of standard supervaluational, on which we can characterize degrees of determinacy. It applies the methodology above to focus on degree logic. This is developed first in a basic, single-premise case; and then extended to the multipremise case, and to allow degrees of consequence. The metatheoretic properties of degree logic are set out. On the positive side, the logic is supraclassical???all classical valid sequents are degree logic valid. Strikingly, metarules such as cut and conjunction introduction fail.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
Reprint years 2011
DOI 10.1017/s1755020310000237
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

References found in this work BETA

Vagueness.Timothy Williamson - 1994 - Routledge.
Vagueness, Truth and Logic.Kit Fine - 1975 - Synthese 30 (3-4):265-300.
General Semantics.David K. Lewis - 1970 - Synthese 22 (1-2):18--67.
Putnam’s Paradox.David Lewis - 1984 - Australasian Journal of Philosophy 62 (3):221 – 236.
A Nonpragmatic Vindication of Probabilism.James M. Joyce - 1998 - Philosophy of Science 65 (4):575-603.

View all 29 references / Add more references

Citations of this work BETA

Gradational Accuracy and Nonclassical Semantics.J. Robert G. Williams - 2012 - Review of Symbolic Logic 5 (4):513-537.
Nonclassical Minds and Indeterminate Survival.J. Robert G. Williams - 2014 - Philosophical Review 123 (4):379-428.
Must Good Reasoning Satisfy Cumulative Transitivity?Shyam Nair - 2019 - Philosophy and Phenomenological Research 98 (1):123-146.

View all 8 citations / Add more citations

Similar books and articles

Bounding Computably Enumerable Degrees in the Ershov Hierarchy.Angsheng Li, Guohua Wu & Yue Yang - 2006 - Annals of Pure and Applied Logic 141 (1):79-88.
Intervals Containing Exactly One C.E. Degree.Guohua Wu - 2007 - Annals of Pure and Applied Logic 146 (1):91-102.
Fuzzy Horn Logic I.Radim Bělohlávek & Vilém Vychodil - 2006 - Archive for Mathematical Logic 45 (1):3-51.
Degrees Joining to 0'. [REVIEW]David B. Posner & Robert W. Robinson - 1981 - Journal of Symbolic Logic 46 (4):714 - 722.
Q 1-Degrees of C.E. Sets.R. Sh Omanadze & Irakli O. Chitaia - 2012 - Archive for Mathematical Logic 51 (5-6):503-515.
Supervaluationism and Its Logics.Achille C. Varzi - 2007 - Mind 116 (463):633-676.
Supervaluationism and Logical Revisionism.J. R. G. Williams - 2008 - Journal of Philosophy 105 (4):192-212.
Nonisolated Degrees and the Jump Operator.Guohua Wu - 2002 - Annals of Pure and Applied Logic 117 (1-3):209-221.
An Almost-Universal Cupping Degree.Jiang Liu & Guohua Wu - 2011 - Journal of Symbolic Logic 76 (4):1137-1152.
Non‐Isolated Quasi‐Degrees.Ilnur I. Batyrshin - 2009 - Mathematical Logic Quarterly 55 (6):587-597.

Analytics

Added to PP index
2009-06-06

Total views
392 ( #20,107 of 2,427,860 )

Recent downloads (6 months)
42 ( #19,248 of 2,427,860 )

How can I increase my downloads?

Downloads

My notes