A Purely Recombinatorial Puzzle

Noûs 51 (3):547-564 (2017)
Download Edit this record How to cite View on PhilPapers
A new puzzle of modal recombination is presented which relies purely on resources of first-order modal logic. It shows that naive recombinatorial reasoning, which has previously been shown to be inconsistent with various assumptions concerning propositions, sets and classes, leads to inconsistency by itself. The context sensitivity of modal expressions is suggested as the source of the puzzle, and it is argued that it gives us reason to reconsider the assumption that the notion of metaphysical necessity is in good standing.
No keywords specified (fix it)
Reprint years
PhilPapers/Archive ID
Revision history
Archival date: 2018-01-22
View upload history
References found in this work BETA
.Williamson, Timothy
Counting Incompossibles.Fritz, Peter & Goodman, Jeremy

View all 30 references / Add more references

Citations of this work BETA
Fragmented Truth.Yu, Andy Demfree

Add more citations

Added to PP index

Total views
220 ( #20,006 of 50,415 )

Recent downloads (6 months)
9 ( #42,124 of 50,415 )

How can I increase my downloads?

Downloads since first upload
This graph includes both downloads from PhilArchive and clicks to external links.