Argumentation as the public exchange of reasons is widely thought to enhance deliberative interactions that generate and justify reasonable public policies. Adopting an argumentation-theoretic perspective, we survey the norms that should govern public argumentation and address some of the complexities that scholarly treatments have identified. Our focus is on norms associated with the ideals of correctness and participation as sources of a politically legitimate deliberative outcome. In principle, both ideals are mutually coherent. If the information needed for a correct deliberative (...) outcome is distributed among agents, then maximising participation increases information diversity. But both ideals can also be in tension. If participants lack competence or are prone to biases, a correct deliberative outcome requires limiting participation. The central question for public argumentation, therefore, is how to strike a balance between both ideals. Rather than advocating a preferred normative framework, our main purpose is to illustrate the complexity of this theme. (shrink)

The aim of the article is to develop precise epistemic rules for good public political arguments, by which political measures in the broad sense are justified. By means of a theory of deliberative democracy, it is substantiated that the justification of a political measure consists in showing argumentatively that this measure most promotes the common good or is morally optimal. It is then discussed which argumentation-theoretical approaches are suitable for providing epistemically sound rules for arguments for such theses and for (...) the associated premises, rules whose compliance implies the truth or acceptability of the thesis. Finally, on the basis of the most suitable approach, namely the epistemological one, such systems of rules for the required types of arguments are presented that fulfil the conditions mentioned. (shrink)

According to the argument scheme approach, to evaluate a given scheme-saturating instance completely does entail asking all critical questions relevant to it. Although this is a central task for argumentation theorists, the field currently lacks a method for providing a complete argument evaluation. Approaching this task at the meta-level, we combine a logical with a substantive approach to the argument schemes by starting from Toulmin’s schema: ‘data, warrant, so claim’. For the yet more general schema: ‘premise; if premise, then conclusion; (...) so conclusion’, we forward a meta-level CQ-list that is arguably both complete and applicable. This list should inform ongoing theoretical efforts at generating appropriate object-level CQs for specific argument schemes. (shrink)

Some arguments are good; others are not. How can we tell the difference? This article advances three proposals as a partial answer to this question. The proposals are keyed to arguments conditioned by different degrees of uncertainty: mild, where the argument’s premises are hedged with point-valued probabilities; moderate, where the premises are hedged with interval probabilities; and severe, where the premises are hedged with non-numeric plausibilities such as ‘very likely’ or ‘unconfirmed’. For mild uncertainty, the article proposes to apply a (...) principle referred to as ‘Jeffrey’s rule’, for the principle is a generalization of Jeffrey conditionalization. For moderate uncertainty, the proposal is to extend Jeffrey’s rule for use with probability intervals. For severe uncertainty, the article proposes that even when lack of probabilistic information prevents the application of Jeffrey’s rule, the rule can be adapted to these conditions with the aid of a suitable plausibility measure. Together, the three proposals introduce an approach to argument evaluation that complements established frameworks for evaluating arguments: deductive soundness, informal logic, argumentation schemes, pragma-dialectics, and Bayesian inference. Nevertheless, this approach can be looked at as a generalization of the truth and validity conditions of the classical criterion for sound argumentation. (shrink)

This paper offers a new model of belief by embedding the Peircean account of belief into a formal dialogue system that uses argumentation schemes for practical reasoning and abductive reasoning. A belief is characterised as a stable proposition that is derived abductively by one agent in a dialogue from the commitment set (including commitments derived from actions and goals) of another agent. On the model (to give a rough summary), a belief is defined as a proposition held by an agent (...) that (1) is not easily changed (stable), (2) is a matter of degree (held more or less weakly or strongly), (3) guides the goals and actions of the agent, and (4) is habitually or tenaciously held in a manner that indicates a strong commitment to defend it. It is argued that the new model overcomes the pervasive conflict in artificial intelligence between the belief-desire-intention model of reasoning and the commitment model. (shrink)

This article seeks, first, to show that much of the existing normative work on argument from expert opinion (AEO) is problematic for failing to be properly informed by empirical findings on expert performance. Second, it seeks to show how, with the analytic tool of Bayesian reasoning, the problem diagnosed can be remedied to circumvent some of the problems facing the scheme-based treatment of AEOs. To establish the first contention, we will illustrate how empirical studies on factors conditioning expert reliability can (...) be drawn upon to re-construct. Walton’s critical questions matching the scheme of AEOs. To establish the second contention, we will illustrate how Walton’s re-constructed set of critical questions can be formalized within a Bayesian network. Finally, we will highlight how the specific ways in which the Bayesian framework we propose is both continuous with and distinct from the models of source reliability put forward by theorists like Bovens and Hartmann (2003). (shrink)

According to the Bayesian paradigm in the psychology of reasoning, the norms by which everyday human cognition is best evaluated are probabilistic rather than logical in character. Recently, the Bayesian paradigm has been applied to the domain of argumentation, where the fundamental norms are traditionally assumed to be logical. Here, we present a major generalisation of extant Bayesian approaches to argumentation that utilizes a new class of Bayesian learning methods that are better suited to modelling dynamic and conditional inferences than (...) standard Bayesian conditionalization, is able to characterise the special value of logically valid argument schemes in uncertain reasoning contexts, greatly extends the range of inferences and argumentative phenomena that can be adequately described in a Bayesian framework, and undermines some influential theoretical motivations for dual function models of human cognition. We conclude that the probabilistic norms given by the Bayesian approach to rationality are not necessarily at odds with the norms given by classical logic. Rather, the Bayesian theory of argumentation can be seen as justifying and enriching the argumentative norms of classical logic. (shrink)

Throughout this paper, we are trying to show how and why our Mathematical frame-work seems inappropriate to solve problems in Theory of Computation. More exactly, the concept of turning back in time in paradoxes causes inconsistency in modeling of the concept of Time in some semantic situations. As we see in the first chapter, by introducing a version of “Unexpected Hanging Paradox”,first we attempt to open a new explanation for some paradoxes. In the second step, by applying this paradox, it (...) is demonstrated that any formalized system for the Theory of Computation based on Classical Logic and Turing Model of Computation leads us to a contradiction. We conclude that our mathematical frame work is inappropriate for Theory of Computation. Furthermore, the result provides us a reason that many problems in Complexity Theory resist to be solved.(This work is completed in 2017 -5- 2, it is in vixra in 2017-5-14, presented in Unilog 2018, Vichy). (shrink)