Philosophical Papers, Volume 40, Issue 3, Page 421-438, November 2011.

What formulas are tense-logically valid depends on the structure of time, for example on whether it has a beginning. Logicians have investigated what formulas correspond to what physical hypotheses about time. Analogously, we can investigate what formulas of modal logic correspond to what metaphysical hypotheses about necessity. It is widely held that physical hypotheses about time may be contingent. If so, tense-logical validity may be contingent. In contrast, validity in modal logic is typically taken to be non-contingent, as reflected by (...) the general acceptance of the so-called “rule of necessitation.” But as has been argued by various authors in recent years, metaphysical hypotheses may likewise be contingent. If, in particular, hypotheses about the extent of possibility are contingent, we should expect modal-logical validity to be contingent too. Let “contingentism” be the view that everything that is not ruled out by logic is possible. I shall investigate what the right system of modal logic is, if contingentism is true. Given plausible assumptions, the system contains the McKinsey principle, and is thus not even contained in S5. It also contains simple and elegant iteration principles for the contingency operator: something is contingent if and only if it is contingently contingent. (shrink)

The aim of the paper is to present a typology of argument schemes. In first place, we found it helpful to define what an argument scheme is. Since many argument schemes found in contemporary theories stem from the ancient tradition, we took in consideration classical and medieval dialectical studies and their relation with argumentation theory. This overview on the main works on topics and schemes provides a summary of the main principles of classification. In the second section, Walton’s theory is (...) briefly explained to introduce the schemes classification and its different levels. At least, the final part shows the main application of the schemes in computing and AI. -/- . (shrink)