
25Knot is not that nastySynthese 198 (S22): 55335554. 2019.In this paper, we evaluate Button’s claim that knot is a nasty connective. Knot’s nastiness is due to the fact that, when one extends the set \ with knot, the connective provides counterexamples to a number of classically valid operational rules in a sequent calculus proof system. We show that just as going nontransitive diminishes tonk’s nastiness, knot’s nastiness can also be reduced by dropping Reflexivity, a different structural rule. Since doing so restores all other rules in the system as…Read more

21A Bit of Connexivity Around the Field of Ordinary ConditionalsAustralasian Philosophical Review 4 (2): 156161. 2020.ABSTRACT In this brief note we explore a couple of features of the semantics for indicative conditionals provided by Field. Those features strikingly resemble some controversial principles in connexive logic. We will show that although Field’s semantics has the technical means to stand to the mentioned features, more work is needed to make some of its outcomes less unintuitive.

7Episodes in ModelTheoretic Xenology: Rationals as Positive Integers in R#Australasian Journal of Logic 18 (5): 428446. 2021.Meyer and Mortensen’s Alien Intruder Theorem includes the extraor dinary observation that the rationals can be extended to a model of the relevant arithmetic R♯, thereby serving as integers themselves. Al though the mysteriousness of this observation is acknowledged, little is done to explain why such rationalsasintegers exist or how they operate. In this paper, we show that Meyer and Mortensen’s models can be identified with a class of ultraproducts of finite models of R♯, providing insight…Read more

65Deep STJournal of Philosophical Logic 51 (6): 12611293. 2021.Many analyses of notion of _metainferences_ in the nontransitive logic ST have tackled the question of whether ST can be identified with classical logic. In this paper, we argue that the primary analyses are overly restrictive of the notion of metainference. We offer a more elegant and tractable semantics for the stricttolerant hierarchy based on the threevalued function for the LP material conditional. This semantics can be shown to easily handle the introduction of _mixed_ inferences, _i.e.…Read more

14Nonconditional Contracting ConnectivesIn Mojtaba Mojtahedi, Shahid Rahman & MohammadSaleh Zarepour (eds.), Mathematics, Logic, and their Philosophies: Essays in Honour of Mohammad Ardeshir, Springer. pp. 349364. 2021.It has been claimed that contracting connectivesContracting connective are conditionalsConditional. Our modest aim here is to show that the conditionallike features of a contracting connectiveContracting connective depend on the defining features of the conditionalConditional in a particular logic, yes, but they also depend on the underlying notion of logical consequence and the structure of the collection of truth values. More concretely, we will show that under PconsequencePconsequence and …Read more

Mayz Vallenilla, E.: "fenomenología Del Conocimiento. El Problema De La Constitución Del Objeto En La Filosofía De Husserl"Revista de Filosofía (Madrid) 19 (73/74): 284. 1960.

Gurr, S. J., John Edwin: "the Principle Of Sufficient Reason In Some Scholastic Systems "Revista de Filosofía (Madrid) 20 (76): 107. 1961.

63A Nelsonian Response to ‘the Most Embarrassing of All Twelfthcentury Arguments’History and Philosophy of Logic 41 (2): 101113. 2019.Alberic of Paris put forward an argument, ‘the most embarrassing of all twelfthcentury arguments’ according to Christopher Martin, which shows that the connexive principles contradict some other logical principles that have become deeply entrenched in our most widely accepted logical theories. Building upon some of Everett Nelson’s ideas, we will show that the steps in Alberic of Paris’ argument that should be rejected are precisely the ones that presuppose the validity of schemas that are nowa…Read more

34Bayesian confirmation, connexivism and an unkindness of ravensAustralasian Journal of Logic 15 (2): 449475. 2018.Bayesian confirmation theories might be the best standing theories of confirmation to date, but they are certainly not paradoxfree. 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…Read more

18Evolutionary Multiresolution Filtering to Forecast Nonlinear Time SeriesJournal of Intelligent Systems 14 (23): 157192. 2005.
Areas of Specialization
Logic and Philosophy of Logic 
Philosophy of Computing and Information 