We present a new proof of soundness/completeness of tableaux with respect to dialogical games in Classical First-Order Logic. As far as we know it is the first thorough result for dialogical games where finiteness of plays is guaranteed by means of what we call repetition ranks.

Dialogue semantics for logic are two-player logic games between a Proponent who puts forward a logical formula φ as valid or true and an Opponent who disputes this. An advantage of the dialogical approach is that it is a uniform framework from which different logics can be obtained through only small variations of the basic rules. We introduce the composition problem for dialogue games as the problem of resolving, for a set S of rules for dialogue games, whether the set (...) of S-dialogically valid formulas is closed under modus ponens. Solving the composition problem is fundamental for the dialogical approach to logic; despite its simplicity, it often requires an indirect solution with the help of significant logical machinery such as cut-elimination. Direct solutions to the composition problem can, however, sometimes be had. As an example, we give a set N of dialogue rules which is well-justified from the dialogical point of view, but whose set N of dialogically valid formulas is both non-trivial and non-standard. We prove that the composition problem for N can be solved directly, and introduce a tableaux system for N. (shrink)

Computational dialectics is concerned with the formal representation of argument and dispute. The field emerged from developments in philosophy, artificial intelligence and legal theory. Its goal is to suggestalgorithms, procedures and protocols to investigate the tenability of logical claims, on the basis of information in the form of rules and cases. Currently, the field slowlyconverges to the opinion that dispute is the most fair and effective way to investigate claims. The basic assumption of this field is that dispute is the (...) most fair and effective way to investigate claims. The definition of a formal dispute varies throughout the literature, butis considered not to vary within one and the same logical system. In this paper it is shown that parts of the definition of a dispute may change within one logical system.To this end, the notion of partial protocol specification (PPS) is introduced. A PPS is a part of the definition of the protocol. A modification to the protocol, in the form of a PPS, can be put forward, disputed, established and incorporated as aneffective `point of order. The paper demonstrates the existence of self-undermining PPSs, it discusses the relevance of PPSs for dialectical models of legal argument and concludes with a description of how PPSs can be built into existing argumentation systems. (shrink)

Dispute types can roughly be divided in two classes. One class in whichthe notion of justification is fundamental, and one in which thenotion of opposition is fundamental. Further, for every singledispute type there exist various types of protocols to conduct such adispute. Some protocols permit local search (a process in which oneis allowed to justify claims partially, with the possibility to extendjustifications on request later), while other protocols rely on globalsearch (a process in which only entire arguments count as justifications).This (...) paper integrates the two above-mentioned types of dispute withthe use of a protocol that permits local search. The locality aspect isrelatively new to computer scientists, while the detailed computationalelaboration of the approach is relatively new to philosophical logicians.The proposed protocol is demonstrated with the help of eight benchmarks.These benchmarks are centered around the problem that co-concludingarguments sometimes accrue, and sometimes do not. (shrink)

In this paper, I try to develop an informal model for the analysis and evaluation of argumentative strategies based on active authorities. The explanations necessary to understand the idea of the model and what is modelled are given through the development of the paper. I first give an example of argumentative activities. After that, the main assumption of the model is given. In the third part, the relevant aspects of the argumentative activity are analysed, while the principles of the evaluation (...) are explained in the fourth part. The informal model is presented in the fifth part. In the final remarks, the suggestions for further work are given, as well as a comparison with some related recent works in argumentation theory. (shrink)

The present study explored several dispositional factors associated with individual differences in lay adult’s interpretation of when an arguer is, or is not, committed to a statement. College students were presented with several two-person arguments in which the proponent of a thesis conceded a key point in the last turn. Participants were then asked to indicate the extent to which that concession implied a change in the proponent’s attitude toward any of the previous statements in the argument. Participants designated as (...) ‘liberal’ used the concession to infer substantial change in commitment to earlier statements in the argument. A group designated as ‘conservative’ were reluctant to make any such inferences. A discriminant analysis indicated that variables assessing participants’ attitudes toward argument as well as their cognitive and communication styles jointly predicted their liberal or conservative status. The discriminant function and follow-up group comparisons indicated that liberals were more likely than conservatives to engage in argument. This included a greater tendency to use argument as a source of knowledge. Liberals also employed a more sophisticated message design logic than conservatives on a communication task. The groups did not clearly differ with respect to participants’ implicit theory of argument, though trends were present that merit attention in future research. Implications of these findings for future research on lay interpretations of commitment are discussed. (shrink)

Many of the discussions about conditionals can best be put as follows:can those conditionals that involve an entailment relation be formulatedwithin a formal system? The reasons for the failure of the classical approachto entailment have usually been that they ignore the meaning connectionbetween antecedent and consequent in a valid entailment. One of the firsttheories in the history of logic about meaning connection resulted from thestoic discussions on tightening the relation between the If- and the Then-parts of conditionals, which in this (...) context was called. This theory gave a justification for the validity of what we todayexpress through the formulae ¬ and ¬. Hugh MacColl and, more recently, Storrs McCall searched for a formal system in which the validity ofthese formulae could be expressed. Unfortunately neither of the resulting systems is very satisfactory. In this paper we introduce dialogical games with the help of a new connexive If-Then (), the structural rules of which allow the Proponent to develop winning strategies not only for the above-mentioned connexive theses but also for ¬ and ¬. Further on, we developthe corresponding tableau systems and conclude with some remarks on possibleperspectives and consequences of the dialogical approach to connexivity including the loss of uniform substitution leading to a new concept of logical form. (shrink)

Many of the discussions about conditionals can best be put as follows:can those conditionals that involve an entailment relation be formulatedwithin a formal system? The reasons for the failure of the classical approachto entailment have usually been that they ignore the meaning connectionbetween antecedent and consequent in a valid entailment. One of the firsttheories in the history of logic about meaning connection resulted from thestoic discussions on tightening the relation between the If- and the Then-parts of conditionals, which in this (...) context was called συναρτησις(connection). This theory gave a justification for the validity of what we todayexpress through the formulae ¬(a → ¬ a) and ¬(¬ a → a). Hugh MacColl and, more recently, Storrs McCall (from 1877 to 1906 and from1963 to 1975 respectively) searched for a formal system in which the validity ofthese formulae could be expressed. Unfortunately neither of the resulting systems is very satisfactory. In this paper we introduce dialogical games with the help of a new connexive If-Then (“→”), the structural rules of which allow the Proponent to develop (formal) winning strategies not only for the above-mentioned connexive theses but also for (a → b) → ¬(a → ¬ b) and (a → b) → ¬(¬ a → b). Further on, we developthe corresponding tableau systems and conclude with some remarks on possibleperspectives and consequences of the dialogical approach to connexivity including the loss of uniform substitution leading to a new concept of logical form. (shrink)

An overview of different versions and applications of Lorenzen’s dialogue game approach to the foundations of logic, here largely restricted to the realm of manyvalued logics, is presented. Among the reviewed concepts and results are Giles’s characterization of Łukasiewicz logic and some of its generalizations to other fuzzy logics, including interval based logics, a parallel version of Lorenzen’s game for intuitionistic logic that is adequate for finite- and infinite-valued Gödel logics, and a truth comparison game for infinite-valued Gödel logic.

Written by experts in the field, this volume presents a comprehensive investigation into the relationship between argumentation theory and the philosophy of mathematical practice. Argumentation theory studies reasoning and argument, and especially those aspects not addressed, or not addressed well, by formal deduction. The philosophy of mathematical practice diverges from mainstream philosophy of mathematics in the emphasis it places on what the majority of working mathematicians actually do, rather than on mathematical foundations. -/- The book begins by first challenging the (...) assumption that there is no role for informal logic in mathematics. Next, it details the usefulness of argumentation theory in the understanding of mathematical practice, offering an impressively diverse set of examples, covering the history of mathematics, mathematics education and, perhaps surprisingly, formal proof verification. From there, the book demonstrates that mathematics also offers a valuable testbed for argumentation theory. Coverage concludes by defending attention to mathematical argumentation as the basis for new perspectives on the philosophy of mathematics. ​. (shrink)

Mathematicians often speak of conjectures, yet unproved, as probable or well-confirmed by evidence. The Riemann Hypothesis, for example, is widely believed to be almost certainly true. There seems no initial reason to distinguish such probability from the same notion in empirical science. Yet it is hard to see how there could be probabilistic relations between the necessary truths of pure mathematics. The existence of such logical relations, short of certainty, is defended using the theory of logical probability (or objective Bayesianism (...) or non-deductive logic), and some detailed examples of its use in mathematics surveyed. Examples of inductive reasoning in experimental mathematics are given and it is argued that the problem of induction is best appreciated in the mathematical case. (shrink)

Dialogical logic is a game-theoretical approach to logic. Logic is studied with the help of certain games, which can be thought of as idealized argumentations. Two players, the Proponent, who puts forward the initial thesis and tries to defend it, and the Opponent, who tries to attack the Proponent’s thesis, alternately utter argumentative moves according to certain rules. For a long time the dialogical approach had been worked out only for classical and intuitionistic logic. The seven papers of this dissertation (...) show that this narrowness was uncalled for. The initial paper presents an overview and serves as an introduction to the other papers. Those papers are related by one central theme. As each of them presents dialogical formulations of a different non-classical logic, they show that dialogical logic constitutes a powerful and flexible general framework for the development and study of various logical formalisms and combinations thereof. As such it is especially attractive to logical pluralists that reject the idea of “the single correct logic”. The collection contains treatments of free logic, modal logic, relevance logic, connexive logic, linear logic, and multi-valued logic. (shrink)