Physical superpositions exist both in classical and in quantum physics. However, what is exactly meant by ‘superposition’ in each case is extremely different. In this paper we discuss some of the multiple interpretations which exist in the literature regarding superpositions in quantum mechanics. We argue that all these interpretations have something in common: they all attempt to avoid ‘contradiction’. We argue in this paper, in favor of the importance of developing a new interpretation of superpositions which takes into account contradiction, (...) as a key element of the formal structure of the theory, “right from the start”. In order to show the feasibility of our interpretational project we present an outline of a paraconsistent approach to quantum superpositions which attempts to account for the contradictory properties present in general within quantum superpositions. This approach must not be understood as a closed formal and conceptual scheme but rather as a first step towards a different type of understanding regarding quantum superpositions. (shrink)

(2012). Reasoning without believing: on the mechanisation of presuppositions and partiality. Journal of Applied Non-Classical Logics: Vol. 22, No. 4, pp. 295-317. doi: 10.1080/11663081.2012.705962.

Various sources in the literature claim that the deduction theorem does not hold for normal modal or epistemic logic, whereas others present versions of the deduction theorem for several normal modal systems. It is shown here that the apparent problem arises from an objectionable notion of derivability from assumptions in an axiomatic system. When a traditional Hilbert-type system of axiomatic logic is generalized into a system for derivations from assumptions, the necessitation rule has to be modified in a way that (...) restricts its use to cases in which the premiss does not depend on assumptions. This restriction is entirely analogous to the restriction of the rule of universal generalization of first-order logic. A necessitation rule with this restriction permits a proof of the deduction theorem in its usual formulation. Other suggestions presented in the literature to deal with the problem are reviewed, and the present solution is argued to be preferable to the other alternatives. A contraction-and cut-free sequent calculus equivalent to the Hubert system for basic modal logic shows the standard failure argument untenable by proving the underivability of DA from A. (shrink)

In this reply to James H. Fetzer’s “Minds and Machines: Limits to Simulations of Thought and Action”, I argue that computationalism should not be the view that (human) cognition is computation, but that it should be the view that cognition (simpliciter) is computable. It follows that computationalism can be true even if (human) cognition is not the result of computations in the brain. I also argue that, if semiotic systems are systems that interpret signs, then both humans and computers are (...) semiotic systems. Finally, I suggest that minds can be considered as virtual machines implemented in certain semiotic systems, primarily the brain, but also AI computers. In doing so, I take issue with Fetzer’s arguments to the contrary. (shrink)

What does it mean to say that logic is formal? The short answer is: it means (or can mean) several different things. In this paper, I argue that there are (at least) eight main variations of the notion of the formal that are relevant for current discussions in philosophy and logic, and that they are structured in two main clusters, namely the formal as pertaining to forms, and the formal as pertaining to rules. To the first cluster belong the formal (...) as schematic; the formal as indifference to particulars; the formal as topic-neutrality; the formal as abstraction from intentional content; the formal as de-semantification. To the second cluster belong the formal as computable; the formal as pertaining to regulative rules; the formal as pertaining to constitutive rules. I analyze each of these eight variations, providing their historical background and raising related philosophical questions. The significance of this work of ?conceptual archeology? is that it may enhance clarity in debates where the notion of the formal plays a prominent role (such as debates where it is expected to play a demarcating role), but where it is oftentimes used equivocally and/or imprecisely. (shrink)

Although arguments for and against competing theories of vagueness often appeal to claims about the use of vague predicates by ordinary speakers, such claims are rarely tested. An exception is Bonini et al. (1999), who report empirical results on the use of vague predicates by Italian speakers, and take the results to count in favor of epistemicism. Yet several methodological difficulties mar their experiments; we outline these problems and devise revised experiments that do not show the same results. We then (...) describe three additional empirical studies that investigate further claims in the literature on vagueness: the hypothesis that speakers confuse ‘P’ with ‘definitely P’, the relative persuasiveness of different formulations of the inductive premise of the Sorites, and the interaction of vague predicates with three different forms of negation. (shrink)

MICHAEL DUMMETT, Elements of intuitionism. With the assistance of Robert Minio. Oxford: Oxford University Press, 1977. xii + 466 pp. No price stated.

Though regarded today as one of the most important results in logic, the compactness theorem was largely ignored until nearly two decades after its discovery. This paper describes the vicissitudes of its evolution and transformation during the period 1930-1970, with special attention to the roles of Kurt Gödel, A. I. Maltsev, Leon Henkin, Abraham Robinson, and Alfred Tarski.

Papineau has suggested that the Principle of Non-Contradiction is a logical law that ?verificationists? are not entitled to claim as a prioritrue. The Principle, like that of Excluded Middle, is not sufficiently grounded in the ?miserly? epistemology of verificationism to be proven in ?verificationist logic?. We examine who might be challenged by this claim: who are the ?verificationists?? We defend our candidates against Papineau's criticisms and other attacks, but this leaves the verificationist open to a different criticism.

Each science has its own domain of investigation, but one and the same science can be formalized in different languages with different universes of discourse. The concept of the domain of a science and the concept of the universe of discourse of a formalization of a science are distinct, although they often coincide in extension. In order to analyse the presuppositions and implications of choices of domain and universe, this article discusses the treatment of omega arguments in three very different (...) formalizations of arithmetic. In Peano's formalization the domain is a restricted class of individuals, while the universe of discourse is the unrestricted class of all individuals. In Gödel's formalization the domain is a restricted class of individuals as in Peano's formalization, but the universe of discourse coincides with the domain. In Whitehead-Russell's formalization the domain is a class of logical notions in Tarski's sense, that are necessarily not individuals, whereas the universe of discourse is the unrestricted class of individuals as in Peano's formalization. The present approach emphasizes the viewpoint that the universe of discourse of a given discourse is important in determining which propositions are expressed by which sentences. (shrink)

After a short preface, the first of the three sections of this paper is devoted to historical and philosophic aspects of categoricity. The second section is a self-contained exposition, including detailed definitions, of a proof that every mathematical system whose domain is the closure of its set of distinguished individuals under its distinguished functions is categorically characterized by its induction principle together with its true atoms (atomic sentences and negations of atomic sentences). The third section deals with applications especially those (...) involving the distinction between characterizing a system and axiomatizing the truths of a system. (shrink)

It is argued, by use of specific examples, that mathematical understanding is something which cannot be modelled in terms of entirely computational procedures. Our conception of a natural number (a non-negative integer: 0, 1, 2, 3,…) is something which goes beyond any formulation in terms of computational rules. Our ability to perceive the properties of natural numbers depends upon our awareness, and represents just one of the many ways in which awareness provides an essential ingredient to our ability to understand. (...) There is no bar to the quality of understanding being the result of natural selection, but only so long as the physical laws contain a non-computational ingredient. (shrink)

I had the pleasure of renewing my acquaintance with Per Lindström at the meeting of the Seventh Scandinavian Logic Symposium, held in Uppsala in August 1996. There at lunch one day, Per said he had long been curious about the development of some of the ideas in my paper [1960] on the arithmetization of metamathematics. In particular, I had used the construction of a non-standard definition !* of the set of axioms of P (Peano Arithmetic) to show that P + (...) {¬ Con!} is interpretable in P, where ! is a standard definition of the axioms of P and Con! expresses the consistency of P via that presentation. Per pointed out that there is a simple “two-line” proof of this interpretability result which does not require the use of such formulas as !*, and he wondered whether I had been aware of that. In fact, his proof had never occurred to me, and if it had at the time, it is possible I would never have been led to the use of non-natural definitions. Per regarded this as a happy accident, since subsequent work by him and others on interpretability made essential use of such definitions. In our conversation, I enlarged a bit on the background to my work on arithmetization, and when I was invited to contribute to this special issue of Theoria dedicated to Lindström, it seemed a natural choice to use the occasion to fill out the story. One caveat, though: the following is drawn largely from memory, not always reliable, supplemented by consultation of the 1960 paper and the 1957 dissertation from which it was drawn. (shrink)

The present paper discusses a proposal which says,roughly and with several qualifications, that thecollection of mathematical truths is identical withthe set of theorems of ZFC. It is argued that thisproposal is not as easily dismissed as outright falseor philosophically incoherent as one might think. Some morals of this are drawn for the concept ofmathematical knowledge.

Two slogans define structuralism: contemporary mathematics studies structures; mathematical objects are places in those structures. Shapiro’s version of structuralism posits abstract objects of three sorts. A system is “a collection of objects with certain relations” between these objects. “An extended family is a system of people with blood and marital relationships.” A baseball defense, e.g., the Yankee’s defense in the first game of the 1999 World Series, is a also a system, “a collection of people with on-field spatial and ‘defensive-role’ (...) relations”. “A structure is the abstract form of a system” ; it consists of “a collection of places [sometimes called positions or offices] and a finite collection of functions and relations on these places”. (shrink)

This paper deals with the truth-Conditions and the logic for vague languages. The use of supervaluations and of classical logic is defended; and other approaches are criticized. The truth-Conditions are extended to a language that contains a definitely-Operator and that is subject to higher order vagueness.

There are two different ways to introduce the notion of truthin constructive mathematics. The first one is to use a Tarskian definition of truth in aconstructive (meta)language. According to some authors, (Kreisel, van Dalen, Troelstra ... ),this definition is entirely similar to the Tarskian definition of classical truth (thesis A).The second one, due essentially to Heyting and Kolmogorov, and known as theBrouwer–Heyting–Kolmogorov interpretation, is to explain informally what it means fora mathematical proposition to be constructively proved. According to other authors (...) (Martin-Löfand Shapiro), this interpretation and the Tarskian definition of truth amount to thesame (thesis B). My aim in this paper is to show that thesis A is only reasonable, that thesis Bis false and to answer the following question: what is defined by the Tarskian definition ofconstructive truth? (shrink)

How to accept a conditional? F. P. Ramsey proposed the following test in (Ramsey 1990).(RT) If A, then B must be accepted with respect to the current epistemic state iff the minimal hypothetical change of it needed to accept A also requires accepting B.

This paper presents a new theory of vagueness, which is designed to retain the virtues of the fuzzy theory, while avoiding the problem of higher-order vagueness. The theory presented here accommodates the idea that for any statement S₁ to the effect that 'Bob is bald' is x true, for x in [0, 1], there should be a further statement S₂ which tells us how true S₁ is, and so on - that is, it accommodates higher-order vagueness without resorting to the (...) claim that the metalanguage in which the semantics of vagueness is presented is itself vague, and without requiring us to abandon the idea that the logic - as opposed to the semantics - of vague discourse is classical. I model the extension of a vague predicate P as a blurry set, this being a function which assigns a degree of membership or degree function to each object o, where a degree function in turn assigns an element of [0, 1] to each finite sequence of elements of [0, 1]. The idea is that the assignment to the sequence (0.3, 0.2), for example, represents the degree to which it is true to say that it is 0.2 true that o is P to degree 0.3. The philosophical merits of my theory are discussed in detail, and the theory is compared with other extensions and generalisations of fuzzy logic in the literature. (shrink)

In a recent article, Azzouni has argued in favor of a version of formalism according to which ordinary mathematical proofs indicate mechanically checkable derivations. This is taken to account for the quasi-universal agreement among mathematicians on the validity of their proofs. Here, the author subjects these claims to a critical examination, recalls the technical details about formalization and mechanical checking of proofs, and illustrates the main argument with aanalysis of examples. In the author's view, much of mathematical reasoning presents genuine (...) meaning-dependent mathematical characteristics that cannot be captured by formal calculi. ‘…there is a conflict between mathematical practice and the formalist doctrine.’ [Kreisel, 1969, p. 39]. (shrink)

Russell had two theories of definite descriptions: one for singular descriptions, another for plural descriptions. We chart its development, in which ‘On Denoting’ plays a part but not the part one might expect, before explaining why it eventually fails. We go on to consider many-valued functions, since they too bring in plural terms—terms such as ‘4’ or the descriptive ‘the inhabitants of London’ which, like plain plural descriptions, stand for more than one thing. Logicians need to take plural reference seriously (...) if only because mathematicians take many-valued functions seriously. We assess the objection (by Russell, Frege and others) that many-valued functions are illegitimate because the corresponding terms are ambiguous. We also assess the various methods proposed for getting rid of them. Finding the objection ill-founded and the methods ineffective, we introduce a logical framework that admits plural reference, and use it to answer some earlier questions and to raise some more. (shrink)

This paper presents a formulation and completeness proof of the resolution-type calculi for the first order fragment of Girard's linear logic by a general method which provides the general scheme of transforming a cutfree Gentzen-type system into a resolution type system, preserving the structure of derivations. This is a direct extension of the method introduced by Maslov for classical predicate logic. Ideas of the author and Zamov are used to avoid skolomization. Completeness of strategies is first established for the Gentzen-type (...) system, and then transferred to resolution. The propositional resolution system was implemented by T. Tammet. (shrink)

Following Hartry Field in distinguishing disquotational truth from a conception that grounds truth conditions in a community's usage, it is argued that the notions are materially inequivalent (since the latter allows truth-value gaps) and that both are needed. In addition to allowing blanket endorsements ("Everything the Pope says is true"), disquotational truth facilitates mathematical discovery, as when we establish the Gödel sentence by noting that the theorems are all disquotationally true and the disquotational truths are consistent. We require a more (...) substantial notion, however, if we intend to use truth values and truth conditions in explaining communication by language. (shrink)

We introduce a notion of semantical closure for theories by formalizing Nepeivoda notion of truth. [10]. Tarski theorem on truth definitions is discussed in the light of Kleene's three valued logic (here treated with a formal reinterpretation of logical constants). Connections with Definability Theory are also established.

is a fragment of first-order aritlimetic so weak that it cannot prove the totality of an iterated exponential fimction. Surprisingly, however, the theory is remarkably robust. I will discuss formal results that show that many theorems of number theory and combinatorics are derivable in elementary arithmetic, and try to place these results in a broader philosophical context.

We extend to the predicate frame a previous characterization of the maximal intermediate propositional constructive logics. This provides a technique to get maximal intermediate predicate constructive logics starting from suitable sets of classically valid predicate formulae we call maximal nonstandard predicate constructive logics. As an example of this technique, we exhibit two maximal intermediate predicate constructive logics, yet leaving open the problem of stating whether the two logics are distinct. Further properties of these logics will be also investigated.

In this paper I present two arguments against the thesis that we experience qualia. I argue that if we experienced qualia then these qualia would have to be essentially vague entities. And I then offer two arguments, one a reworking of Gareth Evans' argument against the possibility of vague objects, the other a reworking of the Sorites argument, to show that no such essentially vague entities can exist. I consider various objections but argue that ultimately they all fail. In particular (...) I claim that the stock responses to the Sorites argument fail against my reworking of the argument because they require us to make a distinction between a determinate reality and how that reality appears to us, whereas in the case of qualia we can make no such distinction. I conclude that there can be no such things as qualia. (shrink)

Logic: the Basics is an accessible introduction to the core philosophy topic of standard logic. Focussing on traditional Classical Logic the book deals with topics such as mathematical preliminaries, propositional logic, monadic quantified logic, polyadic quantified logic, and English and standard ‘symbolic transitions’. With exercises and sample answers throughout this thoroughly revised new edition not only comprehensively covers the core topics at introductory level but also gives the reader an idea of how they can take their knowledge further and the (...) philosophical questions around logic. -/- Logic: the Basics is essential reading for first-year undergraduate philosophy students on standard introductory logic courses. (shrink)

This book concerns the nature and the norms of inquiry. It tackles not only philosophical issues regarding what inquiry is, but also issues regarding how it should and should not be executed. Roughly put, inquiry is the activity of searching for the true answers to questions of our interest. But what is the difference between empirical and armchair inquiry? And what are the right and the wrong ways to inquire? Under what conditions should one start inquiring? Which questions are such (...) that one should not inquire into them? The book offers answers to these questions. It argues that competent armchair inquiry only makes explicit what was already implicit--the inquirer already had the answer to her question before inquiring into it, though this was not explicit to her. It also argues that we should avoid inquiring into questions whose answers are unknowable to us, in the instrumental sense of 'should', and that different modes of inquiry are called for, depending on which type of information is available to the subject. These answers are rigorously argued for, and they stem from a unified framework for modeling the activity of inquiry. (shrink)

Logic has pride of place in mathematics and its 20th century offshoot, computer science. Modern symbolic logic was developed, in part, as a way to provide a formal framework for mathematics: Frege, Peano, Whitehead and Russell, as well as Hilbert developed systems of logic to formalize mathematics. These systems were meant to serve either as themselves foundational, or at least as formal analogs of mathematical reasoning amenable to mathematical study, e.g., in Hilbert’s consistency program. Similar efforts continue, but have been (...) expanded by the development of sophisticated methods to study the properties of such systems using proof and model theory. In parallel with this evolution of logical formalisms as tools for articulating mathematical theories (broadly speaking), much progress has been made in the quest for a mechanization of logical inference and the investigation of its theoretical limits, culminating recently in the development of new foundational frameworks for mathematics with sophisticated computer-assisted proof systems. In addition, logical formalisms developed by logicians in mathematical and philosophical contexts have proved immensely useful in describing theories and systems of interest to computer scientists, and to some degree, vice versa. Three examples of the influence of logic in computer science are automated reasoning, computer verification, and type systems for programming languages. (shrink)

A perspective in the philosophy of mathematics is developed from a consideration of the strengths and limitations of both logicism and platonism, with an early focus on Frege’s work. Importantly, although many set-theoretic structures may be developed each of which offers limited isomorphism with the system of natural numbers, no one of them may be identified with it. Furthermore, the timeless, ever present nature of mathematical concepts and results itself offers direct access, in the face of a platonist account which (...) generates a supposed problem of access. Crucially too, pure mathematics has its own distinctive method of confirming or validating results - mathematical proof - which supplies a higher level of confidence and objectivity than that available elsewhere. The dichotomy of invention and discovery is too jejune a framework for analysing creative mathematical activity. The Gödelian platonist perspective is evaluated and queried through scrutiny of the part played by mathematical resources and constraints in relation to human activity. It appears that there can be non-causal mathematical explanations and mathematical constraint on purely natural processes. Valuable implications of Quine’s naturalism are explored, but one must be cautious of his thesis of confirmational holism. The distinction between algebraic and non-algebraic mathematical theories usefully contributes to our understanding of the internally differentiated nature of the subject. (shrink)

This open access book is a superb collection of some fifteen chapters inspired by Schroeder-Heister's groundbreaking work, written by leading experts in the field, plus an extensive autobiography and comments on the various contributions by Schroeder-Heister himself. For several decades, Peter Schroeder-Heister has been a central figure in proof-theoretic semantics, a field of study situated at the interface of logic, theoretical computer science, natural-language semantics, and the philosophy of language. -/- The chapters of which this book is composed discuss the (...) subject from a rich variety of angles, including the history of logic, the proper interpretation of logical validity, natural deduction rules, the notions of harmony and of synonymy, the structure of proofs, the logical status of equality, intentional phenomena, and the proof theory of second-order arithmetic. All chapters relate directly to questions that have driven Schroeder-Heister's own research agenda and to which he has made seminal contributions. The extensive autobiographical chapter not only provides a fascinating overview of Schroeder-Heister's career and the evolution of his academic interests but also constitutes a contribution to the recent history of logic in its own right, painting an intriguing picture of the philosophical, logical, and mathematical institutional landscape in Germany and elsewhere since the early 1970s. The papers collected in this book are illuminatingly put into a unified perspective by Schroeder-Heister's comments at the end of the book. Both graduate students and established researchers in the field will find this book an excellent resource for future work in proof-theoretic semantics and related areas. (shrink)

The PhD thesis advances a new approach to vagueness as dispersion, comparing it with the main philosophical theories of vagueness in the analytic tradition.

Noniterative approaches to the sorites paradox accept single steps of soritical reasoning, but deny that these can be combined into valid chains of soritical reasoning. The distributed sorites is a puzzle designed to undermine noniterative approaches to the sorites paradox, by deriving an inconsistent conclusion using only single steps, but not chains, of soritical reasoning. This paper shows how a dialetheist version of the noniterative approach, the strict-tolerant approach, also solves the distributed sorites paradox, at no further cost, by accepting (...) the inconsistent conclusion. (shrink)

Un libro de texto de lógica, argumentación y razonamiento probabilístico que he estado escribiendo durante los últimos años. Lo he usado para clases en bachillerato, licenciatura y posgrado. Está incompleto todavía, pero las primeras tres partes (argumentación, lógica proposicional, y cuantificación) están completas a un 85%, aproximadamente. Si lo usas, me ayudarías mucho mandándome comentarios, críticas y cualquier sugerencia.