Embedding If and Only If

Journal of Philosophical Logic 41 (2):449-460 (2012)

Authors
Adam Sennet
University of California, Davis
Jonathan Weisberg
University of Toronto at Mississauga
Abstract
Some left-nested indicative conditionals are hard to interpret while others seem fine. Some proponents of the view that indicative conditionals have No Truth Values (NTV) use their view to explain why some left-nestings are hard to interpret: the embedded conditional does not express the truth conditions needed by the embedding conditional. Left-nestings that seem fine are then explained away as cases of ad hoc, pragmatic interpretation. We challenge this explanation. The standard reasons for NTV about indicative conditionals (triviality results, Gibbardian standoffs, etc.) extend naturally to NTV about biconditionals. So NTVers about conditionals should also be NTVers about biconditionals. But biconditionals embed much more freely than conditionals. If NTV explains why some left-nested conditionals are hard to interpret, why do biconditionals embed successfully in the very contexts where conditionals do not embed?
Keywords Conditionals  Triviality results
Categories (categorize this paper)
ISBN(s)
DOI 10.1007/s10992-011-9170-x
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 47,350
Through your library

References found in this work BETA

The Language Instinct.Steven Pinker - 1994/2007 - Harper Perennial.
On Conditionals.Dorothy Edgington - 1995 - Mind 104 (414):235-329.
A Philosophical Guide to Conditionals.Jonathan Bennett - 2003 - Tijdschrift Voor Filosofie 66 (2):379-380.

View all 10 references / Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Embeddings of Computable Structures.Asher M. Kach, Oscar Levin & Reed Solomon - 2010 - Notre Dame Journal of Formal Logic 51 (1):55-68.
Lifting Elementary Embeddings J: V Λ → V Λ. [REVIEW]Paul Corazza - 2007 - Archive for Mathematical Logic 46 (2):61-72.
On the Representation of Modality.Evelyn N. Ransom - 1977 - Linguistics and Philosophy 1 (3):357 - 379.
Can the Embedding Problem Be Generalized?Caj Strandberg - 2015 - Acta Analytica 30 (1):1-15.
Computable Embeddings and Strongly Minimal Theories.J. Chisholm, J. F. Knight & S. Miller - 2007 - Journal of Symbolic Logic 72 (3):1031 - 1040.
Linearizing Intuitionistic Implication.Patrick Lincoln, Andre Scedrov & Natarajan Shankar - 1993 - Annals of Pure and Applied Logic 60 (2):151-177.
Turing Computable Embeddings.F. Knight Julia, Miller Sara & M. Vanden Boom - 2007 - Journal of Symbolic Logic 72 (3):901-918.
Embedding and Coding Below a 1-Generic Degree.Noam Greenberg & Antonio Montalbán - 2003 - Notre Dame Journal of Formal Logic 44 (4):200-216.
Nice Embedding in Classical Logic.Peter Verdée & Diderik Batens - 2016 - Studia Logica 104 (1):47-78.
Introduction: Embedding Ethics.P. J. Pels - 2005 - In Lynn Meskell & Peter Pels (eds.), Embedding Ethics. Berg. pp. 1.
The Joint Embedding Property in Normal Open Induction.Margarita Otero - 1993 - Annals of Pure and Applied Logic 60 (3):275-290.

Analytics

Added to PP index
2010-12-12

Total views
337 ( #18,800 of 2,291,079 )

Recent downloads (6 months)
14 ( #56,122 of 2,291,079 )

How can I increase my downloads?

Downloads

My notes

Sign in to use this feature