In this paper we discuss the difference between (...) proliferations of logic systems, the questions of relativity and universality of logic and the position and interaction of logic with regards to other sciences such as physics, biology, mathematics and computer science. (shrink)

Summary This paper is intended to discuss the problems occurring in the relation between the notion of truth and the question of self-reference. To do this, we shall review Tarski's (T) convention and its related terminology. We shall clarify the relation between truth and extension in order to lead into the question of semantic paradoxes appearing in the theoretical models concerned with truth. Subsequently, we shall review the logical system which develops in the reformulation of the modal proposal of the (...) (T) convention. In closing, we shall critically examine Kripke's interpretation from the proposals made by Tarski. (shrink)

I have argued that argumentation theorists should concern themselves with scientific argument as a source for images of epistemic virtue in argument. In this paper I will contrast the lessons learned from this endeavour with their counterpart in the evaluation of political arguments. Despite obvious differences, fundamental symmetries between the two argumentation cultures point to the need for a more serious engagement with rigorous disciplinary arguments in argument theory.

Thought: A Journal of Philosophy, EarlyView.

This article investigates the proof theory of the Quantified Argument Calculus as developed and systematically studied by Hanoch Ben-Yami [3, 4]. Ben-Yami makes use of natural deduction, we, however, have chosen a sequent calculus presentation, which allows for the proofs of a multitude of significant meta-theoretic results with minor modifications to the Gentzen’s original framework, i.e., LK. As will be made clear in course of the article LK-Quarc will enjoy cut elimination and its corollaries.

In this paper we present a new hierarchy of analytical tableaux systems TNDC n, 1≤n<ω, for da Costa's hierarchy of propositional paraconsistent logics Cn, 1≤n<ω. In our tableaux formulation, we introduce da Costa's “ball” operator “o”, the generalized operators “k” and “(k)”, for 1≤k, and the negations “~k”, for k≥1, as primitive operators, differently to what has been done in the literature, where these operators are usually defined operators. We prove a version of Cut Rule for the TNDC n, 1≤n<ω, (...) and also prove that these systems are logically equivalent to the corresponding systems Cn, 1≤n<ω. The systems TNDC n constitute completely automated theorem proving systems for the systems of da Costa's hierarchy Cn, 1≤n<ω. (shrink)

We consider the logics determined by the set of all natural implicative expansions of Kleene’s strong 3-valued matrix and select the class of all logics functionally equivalent to Łukasiewicz’s 3-valued logic Ł3. The concept of a “natural implicative matrix” is based upon the notion of a “natural conditional” defined in Tomova.

This paper makes an independent start with formalizing the rules for the argumentation stage of critical discussions. It does not deal with the well-known code of conduct consisting of ten rules but with the system consisting of fifteen rules on which the code of conduct is based. The rules of this system are scrutinized and problems they raise are discussed. Then a formal dialectical system is defined that reflects most of the contents of these rules. The aim is to elucidate (...) the way the rules work and to show how a formal approach can be useful to achieve this. It is also shown how the present method can be used to study the nature of circular argumentation. While, generally, the formalization follows closely the original rules for the argumentation stage of critical discussions, there will also be proposed some modifications of the original protocol. (shrink)

We prove in recursive analysis an existence theorem for computable minimizers of convex computable continuous real-valued functions, and a computable separation theorem for convex sets in ℝm.

ABSTRACTIn this paper, we present a generalisation of proof simulation procedures for Frege systems by Bonet and Buss to some logics for which the deduction theorem does not hold. In particular, we study the case of finite-valued Łukasiewicz logics. To this end, we provide proof systems and which augment Avron's Frege system HŁuk with nested and general versions of the disjunction elimination rule, respectively. For these systems, we provide upper bounds on speed-ups w.r.t. both the number of steps in proofs (...) and the length of proofs. We also consider Tamminga's natural deduction and Avron's hypersequent calculus GŁuk for 3-valued Łukasiewicz logic and generalise our results considering the disjunction elimination rule to all finite-valued Łukasiewicz logics. (shrink)