In this paper we present a Gentzen system for reasoning with contrary-to-duty obligations. The intuition behind the system is that a contrary-to-duty is a special kind of normative exception. The logical machinery to formalise this idea is taken from substructural logics and it is based on the definition of a new non-classical connective capturing the notion of reparational obligation. Then the system is tested against well-known contrary-to-duty paradoxes.

Backwards induction is an intriguing form of argument. It is used in a number of different contexts. One of these is the surprise exam paradox. Another is game theory. But its use is problematic, at least sometimes. The purpose of this paper is to determine what, exactly, backwards induction is, and hence to evaluate it. Let us start by rehearsing informally some of its problematic applications.

In this paper we show that the Hilbert system of agency and ability presented by Dag Elgesem is incomplete with respect to the intended semantics. We argue that completeness result may be easily regained. Finally, we shortly discuss some issues related to the philosophical intuition behind his approach. This is done by examining Elgesem's modal logic of agency and ability using semantics with different flavours.

Consider the following denumerably infinite sequence of sentences: (s1) For all k > 1, sk is not true. (s2) For all k > 2, sk is not true. (s3) For all k > 3, sk is not true.

It is claimed that unacceptable constraints on initial data are imposed by certain responses to paradoxes that threaten time travel, closed timelike curves (CTCs) and other backwards causation hypotheses. In this paper I argue against the following claims: to say “contradictions are impossible so something must prevent the paradox” commits in general to constraints on initial data, that for fixed point dynamics so-called grey state solutions explain why contradictions do not arise, and the latter have been proved to avoid constraints (...) on initial data. †To contact the author, please write to: Philosophy, University of Queensland, Brisbane, Queensland 4072, Australia; e-mail: [email protected]. (shrink)

The blame for the semantic and set-theoretic paradoxes is often placed on self-reference and circularity. Some years ago, Yablo [1985; 1993] challenged this diagnosis, by producing a paradox that's liar-like but does not seem to involve circularity. But is Yablo's paradox really non-circular? In a recent paper, Beall [2001] has suggested that there are no means available to refer to Yablo's paradox without invoking descriptions, and since Priest [1997] has shown that any such description is circular, Beall concludes that Yablo's (...) paradox itself is circular. In this paper, we argue that Beall's conclusion is unwarranted, given that (1) descriptions are not the only way to refer to Yablo's paradox, and (ii) we have no reason to believe that because the description involves self-reference, the denotation of the description is also circular. As a result, for all that's been said so far, we have no reason to believe that Yablo's paradox is circular. (shrink)

This paper is concerned with a natural deduction system for First Degree Entailment (FDE). First, we exhibit a brief history of FDE and of combined systems whose underlying idea is used in developing the natural deduction system. Then, after presenting the language and a semantics of FDE, we develop a natural deduction system for FDE. We then prove soundness and completeness of the system with respect to the semantics. The system neatly represents the four-valued semantics for FDE.

I read Stefan Collini’s What are Universities For? last week with very mixed feelings. In the past, I’ve much admired his polemical essays on the REF, “impact”, the Browne Report, etc. in the London Review of Books and elsewhere: they speak to my heart. If you don’t know those essays, you can get some of their flavour from his latest article in the Guardian yesterday. But I found the book a disappointment. Perhaps the trouble is that Collini is too decent, (...) too high-minded, has too unrealistically exalted a view about what actually happens in universities which is too coloured by attitudes appropriate to the traditional humanities. And he is optimistic to the point of fantasy if he thinks that people are so susceptible to “the romance of ideas and the power of beauty” that they will want, or can be brought to want, lots and lots of universities in order to promote the ideas (as if they would suppose that the task of “conserving, understanding, extending and handing on to subsequent generations the intellectual, scientific, and artistic heritage of mankind” was clearly ill-served when there were only forty universities in England, as opposed to a hundred and whatever). (shrink)

The Editors express their gratitude and appreciation to the indi-viduals listed below who served as referees for Informal Logic for Volumes 31 (2011) and 32 (2012).

A common reaction to Hegel’s suggestion that we collapse Kant’s distinction between form and content is that, since such a move would also deprive us of any way of distinguishing the merely logical from the real possibility of our concepts, it is incoherent and ought to be rejected. It is true that these two distinctions are intimately related in Kant, such that if one goes, the other does as well. But it is less obvious that giving them up as Kant (...) conceives them is as incoherent a proposal as many of Hegel’s critics think. It has been the point of a recent account of Hegel’s idealism to demonstrate that his critique of Kant’s dichotomy between form and content or concept and intuition does not commit him to the view that human cognition is materially creative of its content in the manner of a God-like or intuitive intellect—does not, in other words, signify a return to a pre-Critical metaphysics. This is the interpretative stance I adopt here as well, in hope of giving defenders of Kant reasons for taking Hegel more seriously. (shrink)

The Joint International Conference on Logic Programming, sponsored by the Association for Logic Programming, is a major forum for presentations of research, applications, and implementations in this important area of computer science. Logic programming is one of the most promising steps toward declarative programming and forms the theoretical basis of the programming language Prolog and its various extensions. Logic programming is also fundamental to work in artificial intelligence, where it has been used for nonmonotonic and commonsense (...) reasoning, expert systems implementation, deductive databases, and applications such as computer-aided manufacturing. Krzysztof R. Apt is project leader at the Centre for Mathematics and Computer Science in Amsterdam and part-time Professor in Computer Science at the University of Amsterdam. Topics covered: Theory Foundations. Programming Languages. Implementation. Programming Methodologies and Tools. Applications. Deductive Databases. Artificial Intelligence. Parallelism. (shrink)

The First International Workshop brings together researchers from the theoretical ends of the logic programming and artificial intelligence communities to discuss their mutual interests. Logic programming deals with the use of models of mathematical logic as a way of programming computers, where theoretical AI deals with abstract issues in modeling and representing human knowledge and beliefs. One common ground is nonmonotonic reasoning, a family of logics that includes room for the kinds of variations that can be found (...) in human reasoning. Topics covered: Stable Semantics. Default Logic. AutoEpistemic Logic. Truth Maintenance Systems. Implementation Issues. Diagnosis. Applications. Inheritance Reasoning. Logics of Belief. Inconsistency and Non-Monotonicity. (shrink)

Reviews the scope, nature, and applications of the philosophical discipline, focusing on methods for distinguishing between valid and fallacious arguments and inferences.

This book constitutes the strictly refereed post-workshop proceedings of the 11th International Workshop on Computer Science Logic, CSL '97, held as the 1997 Annual Conference of the European Association on Computer Science Logic, EACSL, in Aarhus, Denmark, in August 1997. The volume presents 26 revised full papers selected after two rounds of refereeing from initially 92 submissions; also included are four invited papers. The book addresses all current aspects of computer science logics and its applications and thus presents (...) the state of the art in the area. (shrink)

The paper is a critique of the widespread conception of logic as a neutral arbiter between metaphysical theories, one that makes no `substantive’ claims of its own (David Kaplan and John Etchemendy are two recent examples). A familiar observation is that virtually every putatively fundamental principle of logic has been challenged over the last century on broadly metaphysical grounds (however mistaken), with a consequent proliferation of alternative logics. However, this apparent contentiousness of logic is often treated as (...) though it were neutralized by the possibility of studying all these alternative logics within an agreed metalogical framework, typically that of first-order logic with set theory. In effect, metalogic is given the role of neutral arbiter. The paper will consider a variety of examples in which deep logical disputes re-emerge at the meta-level. One case is quantified modal logic, where some varieties of actualism require a modal meta-language (as opposed to the usual non-modal language of possible worlds model theory) in order not to make their denial of the Barcan formula self-defeating. Similarly, on some views the intended model theory for second-order logic can only be given in a second-order metalanguage—this may be needed to avoid versions of Russell’s paradox when the first-order quantifiers are read as absolutely unrestricted. It can be shown that the phenomenon of higher-order vagueness eventually forces fuzzy logical treatments of vagueness to use a fuzzy metalanguage, with consequent repercussions for what first-order principles are validated. The difficulty of proving the completeness of first-order intuitionistic logic on its intended interpretation by intuitionistically rather than just classically valid means is a more familiar example. These case studies will be discussed in some detail to reveal a variety of ways in which even metalogic is metaphysically contested, substantial and non-neutral. (shrink)

Many books explain what is known about the universe. This book investigates what cannot be known. Rather than exploring the amazing facts that science, mathematics, and reason have revealed to us, this work studies what science, mathematics, and reason tell us cannot be revealed. In The Outer Limits of Reason, Noson Yanofsky considers what cannot be predicted, described, or known, and what will never be understood. He discusses the limitations of computers, physics, logic, and our own thought processes. Yanofsky (...) describes simple tasks that would take computers trillions of centuries to complete and other problems that computers can never solve; perfectly formed English sentences that make no sense; different levels of infinity; the bizarre world of the quantum; the relevance of relativity theory; the causes of chaos theory; math problems that cannot be solved by normal means; and statements that are true but cannot be proven. He explains the limitations of our intuitions about the world -- our ideas about space, time, and motion, and the complex relationship between the knower and the known. Moving from the concrete to the abstract, from problems of everyday language to straightforward philosophical questions to the formalities of physics and mathematics, Yanofsky demonstrates a myriad of unsolvable problems and paradoxes. Exploring the various limitations of our knowledge, he shows that many of these limitations have a similar pattern and that by investigating these patterns, we can better understand the structure and limitations of reason itself. Yanofsky even attempts to look beyond the borders of reason to see what, if anything, is out there. (shrink)