Bayesian confirmation, connexivism and an unkindness of ravens

Bayesian confirmation theories (BCTs) might be the best standing theories of confirmation to date, but they are certainly not paradox-free. Here I recognize that BCTs’ appeal mainly comes from the fact that they capture some of our intuitions about confirmation better than those the- ories that came before them and that the superiority of BCTs is suffi- ciently justified by those advantages. Instead, I will focus on Sylvan and Nola’s claim that it is desirable that our best theory of confirmation be as paradox-free as possible. For this reason, I will show that, as they respond to different interests, the project of the BCTs is not incompatible with Sylvan and Nola’s project of a paradox-free confirmation logic. In fact, it will turn out that, provided we are ready to embrace some degree of non-classicality, both projects complement each other nicely

Bayesian confirmation, connexivism and an unkindness of ravens

Bayesian confirmation theories (BCTs) might be the best standing theories of confirmation to date, but they are certainly not paradox-free. Here I recognize that BCTs’ appeal mainly comes from the fact that they capture some of our intuitions about confirmation better than those the- ories that came before them and that the superiority of BCTs is suffi- ciently justified by those advantages. Instead, I will focus on Sylvan and Nola’s claim that it is desirable that our best theory of confirmation be as paradox-free as possible. For this reason, I will show that, as they respond to different interests, the project of the BCTs is not incompatible with Sylvan and Nola’s project of a paradox-free confirmation logic. In fact, it will turn out that, provided we are ready to embrace some degree of non-classicality, both projects complement each other nicely

A semantic analysis of some distributive logics with negation

In this paper we shall study some extensions of the semilattice based deductive systems S (N) and S (N, 1), where N is the variety of bounded distributive lattices with a negation operator. We shall prove that S (N) and S (N, 1) are the deductive systems generated by the local consequence relation and the global consequence relation associated with ¬-frames, respectively. Using algebraic and relational methods we will prove that S (N) and some of its extensions are canonical and frame complete.Fil: Celani, Sergio Arturo. Universidad Nacional del Centro de la Provincia de Buenos Aires.facultad de Ciencias Exactas; Argentin

Introduction. History of Modern Logic in a New Key

"We like to think of the aim of the book as doing for modern logic what John Corcoran did for the work of George Boole, namely to make sense of and do justice to the idea that Aristotelian syllogistic logic contributed to its creation. More specifically, the chapters show that the period between the nineteenth and early twentieth century saw a parallel development of modern logicians reshaping syllogism and reflections on syllogism shaping modern logic. This might sound odd as it stands in striking contrast to the standard narrative about the history of modern logic, which says that its creation and development happened in spite of, or in direct opposition to, the old logic. W. V. Quine, for one, wrote that Aristotelian logic is to modern logic what the ‘arithmetic of primitive tribes’ is to modern mathematics: not even a scientific predecessor but a ‘pre-scientific fragment’.", p. 1

A Semantic Analysis of some Distributive Logics with Negation

In this paper we shall study some extensions of the semilattice based deductive systems S (N) and S (N, 1), where N is the variety of bounded distributive lattices with a negation operator. We shall prove that S (N) and S (N, 1) are the deductive systems generated by the local consequence relation and the global consequence relation associated with ¬-frames, respectively. Using algebraic and relational methods we will prove that S (N) and some of its extensions are canonical and frame complete

Towards automating duality

Dualities between different theories occur frequently in mathematics and logic --- between syntax and semantics of a logic, between structures and power structures, between relations and relational algebras, to name just a few. In this paper we show for the case of structures and power structures how corresponding properties of the two related structures can be computed fully automatically by means of quantifier elimination algorithms and predicate logic theorem provers. We illustrate the method with a large number of examples and we give enough technical hints to enable the reader who has access to the {\sc Otter} theorem prover to experiment herself

Audience, words, and art: studies in seventeenth-century French rhetoric

(print) x, 189 p. ; 24 cmI: Problem and Solutions (I) 3 -- II: Problem and Solutions (II) 27 -- III: Port-Royal: Logic vs. Rhetoric (I) 57 -- IV: Port-Royal: Logic vs. Rhetoric (II) 87 -- V: Pascal's Two Arts of Persuasion 109 -- VI: Three Conceptions of the Audience 141 -- VII: Conclusions and Implications 169 -- A Selected Bibliography 179 -- Index 18