I distinguish paradoxes and hypodoxes among the conundrums of time travel. I introduce ‘hypodoxes’ as a term for seemingly consistent conundrums that seem to be related to various paradoxes, as the Truth-teller is related to the Liar. In this article, I briefly compare paradoxes and hypodoxes of time travel with Liar paradoxes and Truth-teller hypodoxes. I also discuss Lewis’ treatment of time travel paradoxes, which I characterise as a Laissez Faire theory of time travel. Time travel paradoxes are impossible according (...) to Laissez Faire theories, while it seems hypodoxes are possible. (shrink)

Bayesian reasoning has been applied formally to statistical inference, machine learning and analysing scientific method. Here I apply it informally to more common forms of inference, namely natural language arguments. I analyse a variety of traditional fallacies, deductive, inductive and causal, and find more merit in them than is generally acknowledged. Bayesian principles provide a framework for understanding ordinary arguments which is well worth developing.

W artykule proponuje się aksjomatyzację fragmentu klasycznej logiki zdań, który zostaje nazwany logiką niesymplifikacyjną. Nazwa pochodzi stąd, że unika się w nim, jak przypuszcza pewna ilość badaczy – wskazanych w tekście – paradoksalnych własności klasycznej implikacji i równoważności. Twierdzenie o niewyprowadzalności tez paradoksalnych nie jest jeszcze definitywnie udowodnione. Ale cały bieg myśli wydaje się interesujący z filozoficznego punktu widzenia ze względu na możliwość odróżnienia kilku rodzajów implikacji i równoważności.

Following the speech act theory, we take hypotheses and assertions as linguistic acts with different illocutionary forces. We assume that a hypothesis is justified if there is at least a scintilla of evidence for the truth of its propositional content, while an assertion is justified when there is conclusive evidence that its propositional content is true. Here we extend the logical treatment for assertions given by Dalla Pozza and Garola (1995, Erkenntnis, 43, 81–109) by outlining a pragmatic logic for assertions (...) and hypotheses. On the basis of this extension we analyse the standard logical opposition relations for assertions and hypotheses. We formulate a pragmatic square of oppositions for assertions and a hexagon of oppositions for hypotheses. Finally, we give a mixed hexagon of oppositions to point out the opposition relations for assertions and hypotheses. (shrink)

To be presented at an International Conference on Law, Language, and Interpretation, at the University of Akureyri, Akureyri, Iceland, April 1-2, 2007.

We show by way of example how one can provide in a lot of cases simple modular semantics for rules of inference, so that the semantics of a system is obtained by joining the semantics of its rules in the most straightforward way. Our main tool for this task is the use of finite Nmatrices, which are multi-valued structures in which the value assigned by a valuation to a complex formula can be chosen non-deterministically out of a certain nonempty set (...) of options. The method is applied in the area of logics with a formal consistency operator (known as LFIs), allowing us to provide in a modular way effective, finite semantics for thousands of different LFIs. (shrink)