We give some simple examples of applying the well-known elementary probability theory inequalities and properties in field logical argumentation. A probabilistic version hypothetical syllogism inference rule is as follows: if propositions A, B, C, A→B, B→C have probabilities a, b, c, r, s, respectively, then for p A→C, we f(a,b,c,r,s)≤p≤g(a,b,c,r,s), functions f g given parameters. In this pape...

The overlap function, a particular kind of binary aggregate has been extensively utilized in decision-making, image manipulation, classification, and other fields. With regard to function theory, many scholars have also obtained achievements, such as pseudo-overlap quasi-overlap semi-overlap etc. above generalized functions contain commutativity continuity, which makes them some limitations pra...

Epistemic modals in consequent place of indicative conditionals give rise to apparent counterexamples to Modus Ponens and Modus Tollens. Familiar assumptions of familiar truth conditional theories of modality facilitate a prima facie explanation—viz., that the target cases harbor epistemic modal equivocations. However, these explanations go too far. For they foster other predictions of equivoca...

Mental model theory (Johnson-Laird & Byrne, 1991) is a dominant theory in human deductive reasoning studies. There are two other classes of theories that deal with human deduction: formal rules theories and content-specific rules theories. This paper begins with a few basic assumptions of the mental model theory, especially those according to which difficulty of inference is proportional to the...

Human conditional reasoning is defeasible: people withdraw logically valid conclusions if they are aware of situations (i.e., exceptions) that prevent the consequent of the rule to happen although the antecedent is given. In this paper we investigate defeasible reasoning with quantified rules. In two experiments we rephrased conditionals from the literature (Experiment 1) and rules from penal c...

An artificially designed Turing Machine algorithm Mo generates the instances of the satisfiability problem, and check their satisfiability. Under the assumption P = NP , we show that Mo has a certain property, which, without the assumption, Mo does not have. This leads to P 6= NP by

Quasi-classical logic (QC logic) allows the derivation of non-trivial classical inferences from inconsistent information. A paraconsis-tent, or non-trivializable, logic is, by necessity, a compromise, or weakening , of classical logic. The compromises on QC logic seem to be more appropriate than other paraconsistent logics for applications in computing. In particular, the connectives behave in ...

The past ten years have shown a great variety of approaches for formal argumentation. An interesting question is to which extent these various formalisms correspond to the different application domains. That is, does the appropriate argumentation formalism depend on the particular domain of application, or does “one size fits all”. In this paper, we study this question from the perspective of o...

Due to their properties, silver nanoparticles (AgNPs) are widely used in consumer products. The widespread use of these products leads the release such into environment, during manufacturing, use, and disposal stages. Currently there is a high margin uncertainty about impacts nano on environment human health. Therefore, different approaches including life cycle assessment (LCA) being evaluate e...