The so-called ‘possibility proof’ in Kant's pre-CriticalBeweisgrundhas been widely discussed in the literature, and it is a common view that he never really abandoned it. As I shall argue, this reading is mistaken. I aim to show that the natural illusion in theCritique of Pure Reason, which is usually taken to be the possibility proof turned into a transcendental illusion, has both a different conclusion and a different argument than the possibility proof. Rather, what (...) remains fromBeweisgrundis what I will call the ‘proofa posteriori’, which theCritiqueturns into a transcendental illusion that is of regulative use for reason. (shrink)

This chapter discusses Kant's 1763 "possibility proof" for the existence of God. I first provide a reconstruction of the proof in its two stages, and then revisit my earlier argument according to which the being the proof delivers threatens to be a Spinozistic-panentheistic God—a being whose properties include the entire spatio-temporal universe—rather than the traditional, ontologically distinct God of biblical monotheism. I go on to evaluate some recent alternative readings that have sought to avoid this result (...) by arguing that the relevant facts about real modality can be ultimately grounded in God’s powers or thoughts – or that Kant just leaves the grounding relations mysterious. I argue that the textual and philosophical costs of each of these alternative readings are formidable. The chapter concludes with a discussion of the fate of the proof in the critical period. Some commentators think that it disappears altogether, or that it is downgraded such that it produces a mere regulative idea of God as the most real being. I suggest that the proof survives but that the mode of assent it licenses towards its conclusion changes from knowledge to a certain kind of Belief (Glaube). (shrink)

one important product of kant's pre-critical metaphysics is the proof of God's existence that he presented in The Only Possible Argument of 1763.1 Kant's proof moves from what I will call here the 'actualist principle', every real possibility must be grounded in actuality, to the conclusion that there exists a unique necessary being, i.e. an ens realissimum, which grounds all real possibility. The pre-critical proof deserves interest in its own right, for not only does it (...) have an intriguing logical structure, but it also allows us to observe Kant's first elaborate discussion of modal concepts. However, what has attracted particular scholarly attention in the last few decades is the perplexing attitude... (shrink)

This paper provides two brief proofs of Arrow’s general possibility theorem. The second one is simple and short. Our proofs are inspired by the pioneering work by Inada (Ann. Inst. Stat. Math. 6:115–122, 1954).

In the tech report Artemov and Yavorskaya [4] an elegant formulation of the first-order logic of proofs was given, FOLP. This logic plays a fundamental role in providing an arithmetic semantics for first-order intuitionistic logic, as was shown. In particular, the tech report proved an arithmetic completeness theorem, and a realization theorem for FOLP. In this paper we provide a possible-world semantics for FOLP, based on the propositional semantics of Fitting [5]. We also give an Mkrtychev semantics. Motivation and intuition (...) for FOLP can be found in Artemov and Yavorskaya [4], and are not fully discussed here.This paper is dedicated to Sergei Artemov, an honored colleague and friend, who has made wonderful things for the rest of us to play with. (shrink)

In Prior Analytics 1.15 Aristotle undertakes to establish certain modal syllogisms of the form XQM. Although these syllogisms are central to his modal system, the proofs he offers for them are problematic. The precise structure of these proofs is disputed, and it is often thought that they are invalid. We propose an interpretation which resolves the main difficulties with them: the proofs are valid given a small number of intrinsically plausible assumptions, although they are in tension with some claims found (...) elsewhere in Aristotle’s modal syllogistic. The proofs make use of a rule of propositional modal logic which we call the possibility rule. We investigate how this rule interacts and coheres with the core elements of the modal syllogistic. (shrink)

The present paper aims to show that the reconstruction of the formal framework of the proofs in Pr. An. 1.15, as proposed by Malink and Rosen 2013 (‘Proof by Assumption of the Possible in Prior Analytics 1.15’, Mind, 122, 953-85) is due to affront a double impasse. Malink and Rosen argue convincingly that Aristotle operates with two different modal frameworks, one as found in the system of modal logic presented in Prior Analytics 1.3 and 8-22, and one occurring in (...) many of Aristotle’s works, such as the Physics, De Caelo and the Metaphysics. However, they misconstrue the latter framework. More precisely, they misconstrue the domain of significance of what they call the ‘Principle of Necessitation’. As a consequence, bringing the two frameworks into one results into a contradictory modal logic. On the other hand, if the Principle of Necessitation is rectified, the proofs put forward by Malink and Rosen in the same paper are no longer available. (shrink)

In this paper, we explore the possibility of applying traditional and modern aesthetical theories to logical and mathematical proofs, with the goal of better understanding the intuitive concept of mathematical beauty. This informal concept takes a central role in the work of logicians and mathematicians and can be thought of as their main motivation. In the present paper, we try to define concepts connected to mathematical beauty or beauty in mathematical proofs, so that we may lay the foundations for (...) a more precise definition of mathematical beauty which would be obtained through a detailed survey among logicians and mathematicians, presented in a future paper. The present paper brings crucial results to be used for constructing the survey. (shrink)

Kurt Gödel’s version of the Ontological Proof derives rather than assumes the crucial Possibility Claim: the claim that it is possible that something God-like exists. Gödel’s derivation starts off with a proof of the Possible Instantiation of the Positive: the principle that, if a property is positive, it is possible that there exists something that has that property. I argue that Gödel’s proof of this principle relies on some implausible axiological assumptions but it can be patched (...) so that it only relies on plausible principles. But Gödel’s derivation of the Possibility Claim also needs a substantial axiological assumption, which is still open to doubt. (shrink)

In this paper, an argument of Alvin Plantinga's for the existence of abstract possible worlds is shown to be unsound. The argument is based on a principle Plantinga calls "Quasicompactness", due to its structural similarity to the notion of compactness in first-order logic. The principle is shown to be false.

Condorcet’s voting paradox shows that pairwise majority voting may lead to cyclical majority preferences. In a famous paper, Sen identified a general condition on a profile of individual preference orderings, called triplewise value-restriction, which is sufficient for the avoidance of such cycles. This note aims to make Sen’s result easily accessible. We provide an elementary proof of Sen's possibility theorem and a simple reformulation of Sen’s condition. We discuss how Sen’s condition is logically related to a number of (...) precursors. Finally, we state a necessary and sufficient condition for the avoidance of cycles, and suggest that, although there is still some logical space between that condition and Sen’s sufficient condition, Sen’s condition cannot be further generalized in an appealing way. (shrink)

This article builds on Humberstone’s idea of defining models of propositional modal logic where total possible worlds are replaced by partial possibilities. We follow a suggestion of Humberstone by introducing possibility models for quantified modal logic. We show that a simple quantified modal logic is sound and complete for our semantics. Although Holliday showed that for many propositional modal logics, it is possible to give a completeness proof using a canonical model construction where every possibility consists of (...) finitely many formulas, we show that this is impossible to do in the first-order case. However, one can still construct a canonical model where every possibility consists of a computable set of formulas and thus still of finitely much information. (shrink)

This paper discusses critically what simulation models of the evolution ofcooperation can possibly prove by examining Axelrod’s “Evolution of Cooperation” and the modeling tradition it has inspired. Hardly any of the many simulation models of the evolution of cooperation in this tradition have been applicable empirically. Axelrod’s role model suggested a research design that seemingly allowed to draw general conclusions from simulation models even if the mechanisms that drive the simulation could not be identified empirically. But this research design was (...) fundamentally flawed, because it is not possible to draw general empirical conclusions from theoretical simulations. At best such simulations can claim to prove logical possibilities, i.e. they prove that certain phenomena are possible as the consequence of the modeling assumptions built into the simulation, but not that they are possible or can be expected to occur in reality I suggest several requirements under which proofs of logical possibilities can nevertheless be considered useful. Sadly, most Axelrod-style simulations do not meet these requirements. I contrast this with Schelling’s neighborhood segregation model, thecore mechanism of which can be retraced empirically. (shrink)

This book is designed to explain the technical ideas that are taken for granted in much contemporary philosophical writing. Notions like "denumerability," "modal scope distinction," "Bayesian conditionalization," and "logical completeness" are usually only elucidated deep within difficult specialist texts. By offering simple explanations that by-pass much irrelevant and boring detail, Philosophical Devices is able to cover a wealth of material that is normally only available to specialists. The book contains four sections, each of three chapters. The first section is about (...) sets and numbers, starting with the membership relation and ending with the generalized continuum hypothesis. The second is about analyticity, a prioricity, and necessity. The third is about probability, outlining the difference between objective and subjective probability and exploring aspects of conditionalization and correlation. The fourth deals with metalogic, focusing on the contrast between syntax and semantics, and finishing with a sketch of Godel's theorem. Philosophical Devices will be useful for university students who have got past the foothills of philosophy and are starting to read more widely, but it does not assume any prior expertise. All the issues discussed are intrinsically interesting, and often downright fascinating. It can be read with pleasure and profit by anybody who is curious about the technical infrastructure of contemporary philosophy."--p. 4 of cover. (shrink)

This paper discusses critically what simulation models of the evolution of cooperation can possibly prove by examining Axelrod’s “Evolution of Cooperation” (1984) and the modeling tradition it has inspired. Hardly any of the many simulation models in this tradition have been applicable empirically. Axelrod’s role model suggested a research design that seemingly allowed to draw general conclusions from simulation models even if the mechanisms that drive the simulation could not be identified empirically. But this research design was fundamentally flawed. At (...) best such simulations can claim to prove logical possibilities, i.e. they prove that certain phenomena are possible as the consequence of the modeling assumptions built into the simulation, but not that they are possible or can be expected to occur in reality. I suggest several requirements under which proofs of logical possibilities can nevertheless be considered useful. Sadly, most Axelrod-style simulations do not meet these requirements. It would be better not to use this kind of simulations at all. (shrink)

Philosophers have devoted a great deal of discussion to the question of whether an inverted spectrum thought experiment refutes functionalism. (For a review of the inverted spectrum and its many philosophical applications, see Byrne, 2004.) If Ho?man is correct the matter can be swiftly and conclusively settled, without appeal to any empirical data about color vision (or anything else). Assuming only that color experiences and functional relations can be mathematically represented, a simple mathematical result.

Proofs and countermodels are the two sides of completeness proofs, but, in general, failure to find one does not automatically give the other. The limitation is encountered also for decidable non-classical logics in traditional completeness proofs based on Henkin’s method of maximal consistent sets of formulas. A method is presented that makes it possible to establish completeness in a direct way: For any given sequent either a proof in the given logical system or a countermodel in the corresponding frame (...) class is found. The method is a synthesis of a generation of calculi with internalized relational semantics, a Tait–Schütte–Takeuti style completeness proof, and procedures to finitize the countermodel construction. Finitizations for intuitionistic propositional logic are obtained through the search for a minimal derivation, through pruning of infinite branches in search trees by means of a suitable syntactic counterpart of semantic filtration, or through a proof-theoretic embedding into an appropriate provability logic. A number of examples illustrates the method, its subtleties, challenges, and present scope. (shrink)

The possibility of spectrum inversion has been debated since it was raised by Locke and is still discussed because of its implications for functionalist theories of conscious experience . This paper provides a mathematical formulation of the question of spectrum inversion and proves that such inversions, and indeed bijective scramblings of color in general, are logically possible. Symmetries in the structure of color space are, for purposes of the proof, irrelevant. The proof entails that conscious experiences are (...) not identical with functional relations. It leaves open the empirical possibility that functional relations might, at least in part, be causally responsible for generating conscious experiences. Functionalists can propose causal accounts that meet the normal standards for scientific theories, including numerical precision and novel prediction; they cannot, however, claim that, because functional relationships and conscious experiences are identical, any attempt to construct such causal theories entails a category error. (shrink)

We present a setting in which the search for a proof of B or a refutation of B can be carried out simultaneously: in contrast, the usual approach in automated deduction views proving B or proving ¬B as two, possibly unrelated, activities. Our approach to proof and refutation is described as a two-player game in which each player follows the same rules. A winning strategy translates to a proof of the formula and a counter-winning strategy translates to (...) a refutation of the formula. The game is described for multiplicative and additive linear logic . A game theoretic treatment of the multiplicative connectives is intricate and our approach to it involves two important ingredients. First, labeled graph structures are used to represent positions in a game and, second, the game playing must deal with the failure of a given player and with an appropriate resumption of play. This latter ingredient accounts for the fact that neither player might win. (shrink)

Since Kenneth Arrow showed the general possibility theorem, a number of social choice theorists have provided alternative proofs of it. In a recent article, Geanakoplos (Econ Theory 26:211–215, 2005) has constructed a new proof of the theorem. The present article provides alternative proofs of various Arrovian impossibility results from the 1960s to the 1970s by utilizing Geanakoplos’s method. We prove semi-order impossibility theorems, the quasi-transitive veto theorem, the quasi-transitive dictatorship theorem, the triple acyclic veto theorem, and the impossibility (...) theorem without the Pareto principle. (shrink)

A classicist, philosopher, and poet, Poul Martin Møller was an important figure in the Danish Golden Age. The traumatic event of the death of his wife led him to think more profoundly about the question of the immortality of the soul. In 1837 he published his most important philosophical treatise, "Thoughts on the Possibility of Proofs of Human Immortality," presented here in English for the first time. It was read and commented upon by the leading figures of the Golden (...) Age, such as Søren Kierkegaard. It proved to be the last important work that Møller wrote before his death in March of 1838 at the age of 43. (shrink)

I focus on three preoccupations of recent writings on proof. -/- I. The role and possible effects of empirical reasoning in mathematics. Do recent developments (specifically, the computer-assisted proof of the 4CT) point to something essentially new as regards the need for and/or effects of using broadly empirical and inductive reasoning in mathematics? In particular, should we see such things as the computer-assisted proof of the 4CT as pointing to the existence of mathematical truths of which we (...) cannot have a priori knowledge? -/- 2. The role of formalization in proof. What are the patterns ofinference according to which mathematical reasoning naturally proceeds? Are they of 'local' character (i.e. sensitive to the subject-matter of the reasoning concerned) or 'global' character (i.e. invariant across all subject-matters)? Finally, what if any relationship is there (a) between the patterns of inference manifest in a proof and its explanatory capacity and (b) between explanatory capacity and rigor? -/- 3. Diagrams and their role in mathematical reasoning. What essentially is diagrammatic reasoning, and what is the nature and basis of its usefulness? Can it play a justificative role in the development of mathematical knowledge and, more particularly, in genuine proof? Finally, does the use of diagrammatic reasoning force an adjustment either in our conception of rigor or in our view of its importance? (shrink)

Proof Theory of Modal Logic is devoted to a thorough study of proof systems for modal logics, that is, logics of necessity, possibility, knowledge, belief, time, computations etc. It contains many new technical results and presentations of novel proof procedures. The volume is of immense importance for the interdisciplinary fields of logic, knowledge representation, and automated deduction.

In his Philosophical Theology James Ross claims to have uncovered an assumption essential to the proof of God's existence advanced by Duns Scotus: the equivalence of logical and real possibility. Ross argues that the omission is reparable, and that Scotus's proof is ultimately satisfactory. In this paper I examine his claim and determine that while Scotus may have believed there to be a significant connection between these two concepts, his proof of God does not depend on (...) it. Ross's attempt to rework the Scotist demonstration merits consideration on its own terms, however. In calling attention to the relation between real and metaphysical possibility, Ross has hit on a way of circumventing one of the major impediments to the acceptability of Scotus's original proof: the infinite regress of causes. Since Scotus argues against the possibility of the infinite regress in copious detail, we must wonder whether he could have countenanced the alternate route suggested by Ross. While I shall argue that indeed Ross's gambit is flawed in a way that Scotus may have foreseen, his proof nevertheless deserves recognition as an original and noteworthy contribution to the literature. (shrink)

Kurt Gödel wrote (1964, p. 272), after he had read Husserl, that the notion of objectivity raises a question: “the question of the objective existence of the objects of mathematical intuition (which, incidentally, is an exact replica of the question of the objective existence of the outer world)”. This “exact replica” brings to mind the close analogy Husserl saw between our intuition of essences in Wesensschau and of physical objects in perception. What is it like to experience a mathematical proving (...) process? What is the ontological status of a mathematical proof? Can computer assisted provers output a proof? Taking a naturalized world account, I will assess the relationship between mathematics, the physical world and consciousness by introducing a significant conceptual distinction between proving and proof. I will propose that proving is a phenomenological conscious experience. This experience involves a combination of what Kurt Gödel called intuition, and what Husserl called intentionality. In contrast, proof is a function of that process — the mathematical phenomenon — that objectively self-presents a property in the world, and that results from a spatiotemporal unity being subject to the exact laws of nature. In this essay, I apply phenomenology to mathematical proving as a performance of consciousness, that is, a lived experience expressed and formalized in language, in which there is the possibility of formulating intersubjectively shareable meanings. (shrink)

This paper presents proof that Buss's S22 can prove the consistency of a fragment of Cook and Urquhart's PV from which induction has been removed but substitution has been retained. This result improves Beckmann's result, which proves the consistency of such a system without substitution in bounded arithmetic S12. Our proof relies on the notion of "computation" of the terms of PV. In our work, we first prove that, in the system under consideration, if an equation is proved (...) and either its left- or right-hand side is computed, then there is a corresponding computation for its right- or left-hand side, respectively. By carefully computing the bound of the size of the computation, the proof of this theorem inside a bounded arithmetic is obtained, from which the consistency of the system is readily proven. This result apparently implies the separation of bounded arithmetic because Buss and Ignjatović stated that it is not possible to prove the consistency of a fragment of PV without induction but with substitution in Buss's S12. However, their proof actually shows that it is not possible to prove the consistency of the system, which is obtained by the addition of propositional logic and other axioms to a system such as ours. On the other hand, the system that we have considered is strictly equational, which is a property on which our proof relies. (shrink)

Most human actions are complex, but some of them are basic. Which are these? In this paper, I address this question by invoking slips, a common kind of mistake. The proposal is this: an action is basic if and only if it is not possible to slip in performing it. The argument discusses some well-established results from the psychology of language production in the context of a philosophical theory of action. In the end, the proposed criterion is applied to discuss (...) some well-known theories of basic actions. (shrink)

A proof is given that there does not exist an event, that is not already in the past for some possible distant observer at the (our) moment that the latter is "now" for us. Such event is as "legally" past for that distant observer as is the moment five minutes ago on the sun for us (irrespective of the circumstance that the light of the sun cannot reach us in a period of five minutes). Only an extreme positivism: "that (...) which cannot yet be observed does not yet exist", can possibly withstand the conclusion concerned. Therefore, there is determinism, also in micro-physics. (shrink)

The essay examines Mill's proof of the utilitarian principle in Utilitarianism and attempts to articulate what Mill himself would have regarded as the proof. It is suggested that the easiest construction of the proof would involve Mill in conflating the proof with the sanction for the principle. Other possibilities--including, in the end, the possibility which this essay favors--require that important steps in the proof be regarded as immediate or intuitive, rather than supported by reasons. (...) Questions are raised concerning what Mill is trying to prove, what "the utilitarian principle" is which functions in the proof, and what the relation is between duty and sanction. (shrink)

Proof complexity is a rich subject drawing on methods from logic, combinatorics, algebra and computer science. This self-contained book presents the basic concepts, classical results, current state of the art and possible future directions in the field. It stresses a view of proof complexity as a whole entity rather than a collection of various topics held together loosely by a few notions, and it favors more generalizable statements. Lower bounds for lengths of proofs, often regarded as the key (...) issue in proof complexity, are of course covered in detail. However, upper bounds are not neglected: this book also explores the relations between bounded arithmetic theories and proof systems and how they can be used to prove upper bounds on lengths of proofs and simulations among proof systems. It goes on to discuss topics that transcend specific proof systems, allowing for deeper understanding of the fundamental problems of the subject. (shrink)

Truth-maker analyses construe truth as existence of proof, a well-known example being that offered by Wittgenstein in theTractatus. The paper subsumes the intuitionistic view of truth as existence of proof under the general truth-maker scheme. Two generic constraints on truth-maker analysis are noted and positioned with respect to the writings of Michael Dummett and theTractatus. Examination of the writings of Brouwer, Heyting and Weyl indicates the specific notions of truth-maker and existence that are at issue in the intuitionistic (...) truth-maker analysis, namely that of proof in the sense of proof-object (Brouwer, Heyting) and existence in the nonpropositional sense of a judgement abstract (Weyl). Furthermore, possible anticipations in the writings of Schlick and Pfänder are noted. (shrink)

Classical proof forests are a proof formalism for first-order classical logic based on Herbrand’s Theorem and backtracking games in the style of Coquand. First described by Miller in a cut-free setting as an economical representation of first-order and higher-order classical proof, defining features of the forests are a strict focus on witnessing terms for quantifiers and the absence of inessential structure, or ‘bureaucracy’.This paper presents classical proof forests as a graphical proof formalism and investigates the (...) possibility of composing forests by cut-elimination. Cut-reduction steps take the form of a local rewrite relation that arises from the structure of the forests in a natural way. Yet reductions, which are significantly different from those of the sequent calculus, are combinatorially intricate and do not exclude the possibility of infinite reduction traces, of which an example is given.Cut-elimination, in the form of a weak normalisation theorem, is obtained using a modified version of the rewrite relation inspired by the game-theoretic interpretation of the forests. It is conjectured that the modified reduction relation is, in fact, strongly normalising. (shrink)

A proof P of a theorem T is transferable when a typical expert can become convinced of T solely on the basis of their prior knowledge and the information contained in P. Easwaran has argued that transferability is a constraint on acceptable proof. Meanwhile, a proof P is fixable when it’s possible for other experts to correct any mistakes P contains without having to develop significant new mathematics. Habgood-Coote and Tanswell have observed that some acceptable proofs are (...) both fixable and in need of fixing, in the sense that they contain nontrivial mistakes. The claim that acceptable proofs must be transferable seems quite plausible. The claim that some acceptable proofs need fixing seems plausible too. Unfortunately, these attractive suggestions stand in tension with one another. I argue that the transferability requirement is the problem. Acceptable proofs need only satisfy a weaker requirement I call “corrigibility”. I explain why, despite appearances, the corrigibility standard is preferable to stricter alternatives. (shrink)

In the first chapter, we discuss Dummett’s idea that the notion of truth arises from the one of the correctness of an assertion. We argue that, in a first-order language, the need of defining truth in terms of the notion of satisfaction, which is yielded by the presence of quantifiers, is structurally analogous to the need of a notion of truth as distinct from the one of correctness of an assertion. In the light of the analogy between predicates in Frege (...) and open formulas in Tarksi, we concentrate on the semantic status of predicates. We register a dual attitude of Dummett towards Frege’s ascription of reference to predicates. On the one it is needed to endow quantifiers with their appropriate meaning. On the other hand, the introduction of concepts, as semantic correlate of predicates, smuggles a realist flavor in the overall semantic picture. In concluding the excursus (and with it the chapter), we stress Dummett’s will of developing a semantic picture free from this realist trait. In the second chapter, we present the idea of a proof-theoretic semantics. As for Frege true sentences denotes the truth-value True, so here closed' (i.e. categorical) valid argumentations denotes proofs. If a language contains implication-like operators, in order to characterize the condition of validity of a closed argumentation one has to introduce a notion of validity applying to ‘open’ (i.e. hypothetical) argumentations. We argue that this problem is analogous to the one posed by quantifiers in Frege-Tarksi’s style semantics. That is, implication forces one to introduce notion of validity for argumentations, which is more substantial than the correctness of the assertion of their conclusions. As we saw, the corresponding claim in the truth-based approach—that quantifiers require one to introduce a notion of truth, which is more substantial than the one of an assertion being correct—was the source of realism. Hence, Dummett proposes to reduce the semantic contribution of open argumentations to the one of their ‘closed instances’. In the truth-based perspective, this would correspond to the denial of the need of introducing concepts as the semantic correlates of predicates. We argue that Dummett’s fear, that an irreducible notion of function (represented by the need of ascribing validity to open argumentations) would lead to realism, turns out to be ill-founded. In the third chapter, we discuss the role played by the notion of truth in the anti-realist account. The notion of truth is what the anti-realist needs to cope with the so-called paradox of deduction. The analysis of the paradox yields to distinguishing between the truth of a sentence and the truth of a sentence being recognized. In terms of these conceptual couple, we reconsider the relationship between truth and assertion in an anti-realist perspective. Grounds are provided for a thesis (which was already advanced in chapter two), according to which the notion of the assertion of a sentence being correct is primarily connected only with the canonical means of establishing a sentence. The possibility of establishing a sentence by indirect means is conceptually dependent on the practice of establishing logical relationship of dependence among sentences. That is, the notion of a closed valid non-canonical argumentation is of any theoretical relevance only in presence of a notion of validity applying to open argumentations. In the fourth chapter, we discuss the possibility of characterizing in the proof-theoretic-semantics a notion of refutation. We develop an original characterization of refutations starting from an informal inductive specification of the condition of refutations of logically complex sentences. A sub-structural logic, called dual-intuitionistic logic, stands to this notion in the same relationship in which intuitionistic logic stands to the notion of proof so far consdered. All notions developed in chapter 2 have their corresponding (dual) ones in the framework developed. In particular, the distinctions canonical/non-canonical and closed/open argumentations. In the refutation based perspective, elimination rules have priority over introductions and the (only) assumption over the (many) conclusions. In the conclusions, we indicate the ingredients that an anti-realist approach to meaning should incorporate, in order to avoid the difficulties we registered. The core of an alternative view is a different conception of the relationship between categorical and hypothetical notions, in which the validity of open argumentations is not reduced to that of their instances, but rather it is directly defined. As a limit case, one would get a notion of validity applying to closed argumentations. (shrink)