§1. Introduction. I dedicate this essay to the two-dozen-odd people whose refutations of Cantor's diagonal argument have come to me either as referee or as editor in the last twenty years or so. Sadly these submissions were all quite unpublishable; I sent them back with what I hope were helpful comments. A few years ago it occurred to me to wonder why so many people devote so much energy to refuting this harmless little argument—what had it done to make them (...) angry with it? So I started to keep notes of these papers, in the hope that some pattern would emerge.These pages report the results. They might be useful for editors faced with similar problem papers, or even for the authors of the papers themselves. But the main message to reach me is that there are several points of basic elementary logic that we usually teach and explain very badly, or not at all.In 1995 an engineer named William Dilworth, who had published a refutation of Cantor's argument in the Transactions of the Wisconsin Academy of Sciences, Arts and Letters, sued for libel a mathematician named Underwood Dudley who had called him a crank. (shrink)

It has been known for some time that there is a primitive recursive permutation of the nonnegative integers whose inverse is recursive but not primitive recursive. For example one has this result apparently for the first time in Kuznecov [1] and implicitly in Kent [2] or J. Robinson [3], who shows that every singularly recursive function ƒ is representable aswhere A, B, C are primitive recursive and B is a permutation.

The form of nominalism known as 'mathematical fictionalism' is examined and found wanting, mainly on grounds that go back to an early antinominalist work of Rudolf Carnap that has unfortunately not been paid sufficient attention by more recent writers.

A myth has arisen concerning Turing's paper of 1936, namely that Turing set forth a fundamental principle concerning the limits of what can be computed by machine - a myth that has passed into cognitive science and the philosophy of mind, to wide and pernicious effect. This supposed principle, sometimes incorrectly termed the 'Church-Turing thesis', is the claim that the class of functions that can be computed by machines is identical to the class of functions that can be computed by (...) Turing machines. In point of fact Turing himself nowhere endorses, nor even states, this claim (nor does Church). I describe a number of notional machines, both analogue and digital, that can compute more than a universal Turing machine. These machines are exemplars of the class of _nonclassical_ computing machines. Nothing known at present rules out the possibility that machines in this class will one day be built, nor that the brain itself is such a machine. These theoretical considerations undercut a number of foundational arguments that are commonly rehearsed in cognitive science, and gesture towards a new class of cognitive models. (shrink)

In this paper, we use a ‘normality operator’ in order to generate logics of formal inconsistency and logics of formal undeterminedness from any subclassical many-valued logic that enjoys a truth-functional semantics. Normality operators express, in any many-valued logic, that a given formula has a classical truth value. In the first part of the paper we provide some setup and focus on many-valued logics that satisfy some of the three properties, namely subclassicality and two properties that we call fixed-point negation property (...) and conservativeness. In the second part of the paper, we introduce normality operators and explore their formal behaviour. In the third and final part of the paper, we establish a number of classical recapture results for systems of formal inconsistency and formal undeterminedness that satisfy some or all the properties above. These are the main formal results of the paper. Also, we illustrate concrete cases of recapture by discussing the logics $\mathsf{K}^{\circledast }_{3}$, $\mathsf{LP}^{\circledast }$, $\mathsf{K}^{w\circledast }_{3}$, $\mathsf{PWK}^{\circledast }$ and $\mathsf{E_{fde}}^{\circledast }$, that are in turn extensions of $\mathsf{{K}_{3}}$, $\mathsf{LP}$, $\mathsf{K}^{w}_{3}$, $\mathsf{PWK}$ and $\mathsf{E_{fde}}$, respectively. (shrink)

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.

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)

This paper presents a semantical analysis of the Weak Kleene Logics Kw3 and PWK from the tradition of Bochvar and Halldén. These are three-valued logics in which a formula takes the third value if at least one of its components does. The paper establishes two main results: a characterisation result for the relation of logical con- sequence in PWK – that is, we individuate necessary and sufficient conditions for a set.

Intra-theoretical logical pluralism is a form of meaning-invariant pluralism about logic, articulated recently by Hjortland :355–373, 2013). This version of pluralism relies on it being possible to define several distinct notions of provability relative to the same logical calculus. The present paper picks up and explores this theme: How can a single logical calculus express several different consequence relations? The main hypothesis articulated here is that the divide between the internal and external consequence relations in Gentzen systems generates a form (...) of intra-theoretical logical pluralism. (shrink)

The focus of the paper is a sophism based on the proposition ‘This is Socrates’ found in a short treatise on obligational casus attributed to William Heytesbury. First, the background to the puzzle in Walter Burley’s traditional account of obligations (the responsio antiqua), and the objections and revisions made by Richard Kilvington and Roger Swyneshed, are presented. All six types of obligations described by Burley are outlined, including sit verum, the type used in the sophism. Kilvington and Swyneshed disliked the (...) dynamic nature of the responsio antiqua, and Kilvington proposed a revision to the rules for irrelevant propositions. This allowed him to use a form of reasoning, the “disputational meta-argument”, which is incompatible with Burley’s rules. Heytesbury explicitly rejected Kilvington’s revision and the associated meta-argument. Swyneshed also revised Burley’s account of obligations, formulating the so-called responsio nova, characterised by the apparently surprising thesis that a conjunction can be denied both of whose conjuncts are granted. On closer inspection, however, his account is found to be less radical than first appears. (shrink)

Two recent and influential papers, van Rooij 2007 and Lassiter 2012, propose solutions to the proviso problem that make central use of related notions of independence—qualitative in the first case, probabilistic in the second. We argue here that, if these solutions are to work, they must incorporate an implicit assumption about presupposition accommodation, namely that accommodation does not interfere with existing qualitative or probabilistic independencies. We show, however, that this assumption is implausible, as updating beliefs with conditional information does not (...) in general preserve independencies. We conclude that the approach taken by van Rooij and Lassiter does not succeed in resolving the proviso problem. (shrink)

We establish a duality between the category of involutive bisemilattices and the category of semilattice inverse systems of Stone spaces, using Stone duality from one side and the representation of involutive bisemilattices as Płonka sum of Boolean algebras, from the other. Furthermore, we show that the dual space of an involutive bisemilattice can be viewed as a GR space with involution, a generalization of the spaces introduced by Gierz and Romanowska equipped with an involution as additional operation.

C.H. Waddington’s concepts of ‘chreods’ (canalized paths of development) and ‘homeorhesis’ (the tendency to return to a path), each associated with ‘morphogenetic fields’, were conceived by him as a contribution to complexity theory. Subsequent developments in complexity theory have largely ignored Waddington’s work and efforts to advance it. Waddington explained the development of the concept of chreod as the influence on his work of Alfred North Whitehead’s process philosophy, notably, the concept of concrescence as a self-causing process. Processes were recognized (...) as having their own dynamics, rather than being explicable through their components or external agents. Whitehead recognized the tendency to think only in terms of such ‘substances’ as a bias of European thought, claiming in his own philosophy ‘to approximate more to some strains of Indian, or Chinese, thought, than to western Asiatic, or European, thought.’ Significantly, the theoretical biologist who comes closest to advancing Waddington’s research program, also marginalized, is Mae-Wan Ho. Noting this bias, and embracing Whitehead’s and Waddington’s efforts to free biology from assumptions dominating Western thought to advance an ontology of creative causal processes, I will show how later developments of complexity theory, most importantly, Goodwin’s work on oscillations, temporality and morphogenesis, Vitiello’s dissipative quantum brain dynamics, Salthe’s work on hierarchy theory, biosemiotics inspired by Peirce and von Uexküll, Robert Rosen’s work on anticipatory systems, together with category theory and biomathics, can augment while being augmented by Waddington’s work, while further advancing Mae-Wan Ho’s radical research program with its quest to understand the reality of consciousness. (shrink)

In this article I am going to argue for the possibility of a transcendental source of logic based on a phenomenologically motivated approach. My aim will be essentially carried out in two succeeding steps of reduction: the first one will be the indication of existence of an inherent temporal factor conditioning formal predicative discourse and the second one, based on a supplementary reduction of objective temporality, will be a recourse to a time-constituting origin which has to be assumed as a (...) non-temporal, transcendental subjectivity and for that reason as possibly the ultimate transcendental root of pure logic. In the development of the argumentation and taking into account W.V. Quine’s views in his well-known Word and Object, a special emphasis will be given to the fundamentally temporal character of universal and existential predicative forms, to their status in logical theories in general, and to their underlying role in generating an inherently non-finitistic character reflected, for instance, in the undecidability of certain infinity statements in formal mathematical theories. This is shown also to concern metatheorems of such vital importance as Gödel’s incompleteness theorems in mathematical foundations. Moreover in the course of the discussion the quest for the ultimate limits of predication will lead to the notions of separation and intentional correlation between an ‘observing’ subject and the object of ‘observation’ as well as to the notion of syntactical individuals taken as the irreducible non-analytic nuclei-forms within analytical discourse. (shrink)

The deviation of mathematical proof—proof in mathematical practice—from the ideal of formal proof—proof in formal logic—has led many philosophers of mathematics to reconsider the commonly accepted view according to which the notion of formal proof provides an accurate descriptive account of mathematical proof. This, in turn, has motivated a search for alternative accounts of mathematical proof purporting to be more faithful to the reality of mathematical practice. Yet, in order to develop and evaluate such alternative accounts, it appears as a (...) necessary prerequisite to first possess a clear picture of what the deviation of mathematical proof from formal proof consists in. The present work aims to contribute building such a picture by investigating the relation between the elementary steps of deduction constituting the two types of proofs—mathematical inference and logical inference. Many claims have been made in the literature regarding the relation between mathematical inference and logical inference, most of them stating that the former is lacking properties that are constitutive of the latter. Such differentiating claims are, however, usually put forward without a clear conception of the properties occurring in them, and are generally considered to be immediately justified by our direct acquaintance, or phenomenological experience, with the two types of inferences. The present study purports to advance our understanding of the relation between mathematical inference and logical inference by developing a detailed philosophical analysis of the differentiating claims, that is, an analysis of the meaning of the differentiating claims—through the properties that occur in them—as well as the reasons that support them. To this end, we provide at the outset a representative list of the different properties of logical inference that have occurred in the differentiating claims, and we notice that they all boil down to the three properties of formality, generality, and mechanicality. For each one of these properties, our analysis proceeds in two steps: we first provide precise conceptual characterizations of the different ways logical inference has been said to be formal, general, and mechanical, in the philosophical and logical literature on formal proof; we then examine why mathematical inference does not appear to be formal, general, and mechanical, for the different variations of these notions identified. Our study results in a precise conceptual apparatus for expressing and discussing the properties differentiating mathematical inference from logical inference, and provides a first inventory of the various reasons supporting the observations of those differences. The differentiating claims constitute thus a set of data that any philosophical account of mathematical inference and proof purporting to be more faithful to mathematical practice ought to be able to accommodate and explain. (shrink)

Although Kurt Gödel does not figure prominently in the history of computabilty theory, he exerted a significant influence on some of the founders of the field, both through his published work and through personal interaction. In particular, Gödel’s 1931 paper on incompleteness and the methods developed therein were important for the early development of recursive function theory and the lambda calculus at the hands of Church, Kleene, and Rosser. Church and his students studied Gödel 1931, and Gödel taught a seminar (...) at Princeton in 1934. Seen in the historical context, Gödel was an important catalyst for the emergence of computability theory in the mid 1930s. (shrink)

The aim of this paper is to explore the peculiar case of infectious logics, a group of systems obtained generalizing the semantic behavior characteristic of the -fragment of the logics of nonsense, such as the ones due to Bochvar and Halldén, among others. Here, we extend these logics with classical negations, and we furthermore show that some of these extended systems can be properly regarded as logics of formal inconsistency and logics of formal undeterminedness.

This book concerns the foundations of epistemic modality and hyperintensionality and their applications to the philosophy of mathematics. David Elohim examines the nature of epistemic modality, when the modal operator is interpreted as concerning both apriority and conceivability, as well as states of knowledge and belief. The book demonstrates how epistemic modality and hyperintensionality relate to the computational theory of mind; metaphysical modality and hyperintensionality; the types of mathematical modality and hyperintensionality; to the epistemic status of large cardinal axioms, undecidable (...) propositions, and abstraction principles in the philosophy of mathematics; to the modal and hyperintensional profiles of the logic of rational intuition; and to the types of intention, when the latter is interpreted as a hyperintensional mental state. Chapter \textbf{2} argues for a novel type of expressivism based on the duality between the categories of coalgebras and algebras, and argues that the duality permits of the reconciliation between modal and hyperintensional cognitivism and modal and hyperintensional expressivism. Elohim develops a novel, topic-sensitive truthmaker semantics for dynamic epistemic logic, and develops a novel, dynamic two-dimensional semantics grounded in two-dimensional hyperintensional Turing machines. Chapter \textbf{3} provides an abstraction principle for two-dimensional (hyper-)intensions. Chapter \textbf{4} advances a topic-sensitive two-dimensional truthmaker semantics, and provides three novel interpretations of the framework along with the epistemic and metasemantic. Chapter \textbf{5} applies the fixed points of the modal $\mu$-calculus in order to account for the iteration of epistemic states in a single agent, by contrast to availing of modal axiom 4 (i.e. the KK principle). The fixed point operators in the modal $\mu$-calculus are rendered hyperintensional, which yields the first hyperintensional construal of the modal $\mu$-calculus in the literature and the first application of the calculus to the iteration of epistemic states in a single agent instead of the common knowledge of a group of agents. Chapter \textbf{6} advances a solution to the Julius Caesar problem based on Fine's `criterial' identity conditions which incorporate conditions on essentiality and grounding. Chapter \textbf{7} provides a ground-theoretic regimentation of the proposals in the metaphysics of consciousness and examines its bearing on the two-dimensional conceivability argument against physicalism. The topic-sensitive epistemic two-dimensional truthmaker semantics developed in chapters \textbf{2} and \textbf{4} is availed of in order for epistemic states to be a guide to metaphysical states in the hyperintensional setting. -/- Chapters \textbf{8-12} provide cases demonstrating how the two-dimensional hyperintensions of hyperintensional, i.e. topic-sensitive epistemic two-dimensional truthmaker, semantics, solve the access problem in the epistemology of mathematics. Chapter \textbf{8} examines the interaction between Elohim's hyperintensional semantics and the axioms of epistemic set theory, large cardinal axioms, the Epistemic Church-Turing Thesis, the modal axioms governing the modal profile of $\Omega$-logic, Orey sentences such as the Generalized Continuum Hypothesis, and absolute decidability. These results yield inter alia the first hyperintensional Epistemic Church-Turing Thesis and hyperintensional epistemic set theories in the literature. Chapter \textbf{9} examines the modal and hyperintensional commitments of abstractionism, in particular necessitism, and epistemic hyperintensionality, epistemic utility theory, and the epistemology of abstraction. Elohim countenances a hyperintensional semantics for novel epistemic abstractionist modalities. Elohim suggests, too, that higher observational type theory can be applied to first-order abstraction principles in order to make first-order abstraction principles recursively enumerable, i.e. Turing machine computable, and that the truth of the first-order abstraction principle for two-dimensional hyperintensions is grounded in its being possibly recursively enumerable and the machine being physically implementable. Chapter \textbf{10} examines the philosophical significance of hyperintensional $\Omega$-logic in set theory and discusses the hyperintensionality of metamathematics. Chapter \textbf{11} provides a modal logic for rational intuition and provides a hyperintensional semantics. Chapter \textbf{12} avails of modal coalgebras to interpret the defining properties of indefinite extensibility, and avails of hyperintensional epistemic two-dimensional semantics in order to account for the interaction between interpretational and objective modalities and the truthmakers thereof. This yields the first hyperintensional category theory in the literature. Elohim invents a new mathematical trick in which first-order structures are treated as categories, and Vopenka's principle can be satisfied because of the elementary embeddings between the categories and generate Vopenka cardinals in the category of Set in category theory. Chapter \textbf{13} examines modal responses to the alethic paradoxes. Elohim provides a counter-example to epistemic closure for logical deduction. Chapter \textbf{14} examines, finally, the modal and hyperintensional semantics for the different types of intention and the relation of the latter to evidential decision theory. (shrink)

Building on recent work, I present sequent systems for the non-classical logics LP, K3, and FDE with two main virtues. First, derivations closely resemble those in standard Gentzen-style systems. Second, the systems can be obtained by reformulating a classical system using nonstandard sequent structure and simply removing certain structural rules (relatives of exchange and contraction). I clarify two senses in which these logics count as “substructural.”.

I propose a new theory of semantic presupposition, which I call dissatisfaction theory. I first briefly review a cluster of problems − known collectively as the proviso problem − for most extant theories of presupposition, arguing that the main pragmatic response to them faces a serious challenge. I avoid these problems by adopting two changes in perspective on presupposition. First, I propose a theory of projection according to which presuppositions project unless they are locally entailed. Second, I reject the standard (...) assumption that presuppositions are contents which must be entailed by the input context; instead, I propose that presuppositions are contents which are marked as backgrounded. I show that, together, these commitments allow us to avoid the proviso problem altogether, and generally make plausible predictions about presupposition projection out of connectives and attitude predicates. I close by sketching a two-dimensional implementation of my theory which allows us to make further welcome predictions about attitude predicates and quantifiers. (shrink)

Mathematics textbooks teach logical reasoning by example, a practice started by Euclid; while logic textbooks treat logic as a subject in its own right without practical application to mathematics. Stuck in the middle are students seeking mathematical proficiency and educators seeking to provide it. To assist them, the article explains in practical detail how to teach logic-based skills such as: making mathematical reasoning fully explicit; moving from step to step in a mathematical proof in logically correct ways; and checking to (...) make sure inferences are logically correct. The methodology can easily be extended beyond the four examples analyzed. (shrink)

This article deals with a question of a most general, comprehensive and profound content as it is the nature of mathematical–logical objects insofar as these are considered objects of knowledge and more specifically objects of formal mathematical theories. As objects of formal theories they are dealt with in the sense they have acquired primarily from the beginnings of the systematic study of mathematical foundations in connection with logic dating from the works of G. Cantor and G. Frege in the last (...) decades of the nineteenth century. Largely motivated by a phenomenologically founded view of mathematical objects/states-of-affairs, I try to consistently argue for their character as objects shaped to a certain extent by intentional forms exhibited by consciousness and the modes of constitution of inner temporality and at the same time as constrained in the form of immanent ‘appearances’ by what stands as their non-eliminable reference, that is, the world as primitive soil of experience and the mathematical intuitions developed in relations of reciprocity within-the-world. In this perspective and relative to my intentions I enter, in the last section, into a brief review of certain positions of G. Sher’s foundational holism and R. Tieszen’s constituted platonism, among others, respectively presented in Sher and Tieszen. (shrink)

The contribution of the body to cognition and control in natural and artificial agents is increasingly described as “off-loading computation from the brain to the body”, where the body is said to perform “morphological computation”. Our investigation of four characteristic cases of morphological computation in animals and robots shows that the ‘off-loading’ perspective is misleading. Actually, the contribution of body morphology to cognition and control is rarely computational, in any useful sense of the word. We thus distinguish (1) morphology that (...) facilitates control, (2) morphology that facilitates perception and the rare cases of (3) morphological computation proper, such as ‘reservoir computing.’ where the body is actually used for computation. This result contributes to the understanding of the relation between embodiment and computation: The question for robot design and cognitive science is not whether computation is offloaded to the body, but to what extent the body facilitates cognition and control – how it contributes to the overall ‘orchestration’ of intelligent behaviour. (shrink)

This article discusses rationality gaps triggered by self-referential/cyclic choice, the latter being understood as choosing according to a norm that refers to the choosing itself. The Crocodile Paradox is reformulated and analyzed as a game—named CP—whose Nash equilibrium is shown to trigger a cyclic choice and to invite a rationality gap. It is shown that choosing the Nash equilibrium of CP conforms to the principles Wolfgang Spohn and Haim Gaifman introduced to, allegedly, guarantee acyclicity but, in fact, does not prevent (...) self-referential/cyclic choice and rationality gaps. It is shown that CP is a counter-example to Gaifman's solution of the rationality gaps problem. (shrink)

The study is focused on the relation between theology and mathematics in the situation of increasing secularization. My main concern in the second part of this paper is the early-twentieth-century foundational crisis of mathematics. The hypothesis that pure mathematics partially fulfilled the functions of theology at that time is tested on the views of the leading figures of the three main foundationalist programs: Russell, Hilbert and Brouwer.

What sort of logic do we get if we adopt a supervaluational semantics for vagueness? As it turns out, the answer depends crucially on how the standard notion of validity as truth preservation is recasted. There are several ways of doing that within a supervaluational framework, the main alternative being between “global” construals (e.g., an argument is valid iff it preserves truth-under-all-precisifications) and “local” construals (an argument is valid iff, under all precisifications, it preserves truth). The former alternative is by (...) far more popular, but I argue in favor of the latter, for (i) it does not suffer from a number of serious objections, and (ii) it makes it possible to restore global validity as a defined notion. (shrink)

Formal approaches that aim at representing human reasoning should be evaluated based on how humans actually reason. One way of doing so is to investigate whether psychological findings of human reasoning patterns are represented in the theoretical model. The computational logic approach discussed here is the so-called weak completion semantics which is based on the three-valued ᴌukasiewicz logic. We explain how this approach adequately models Byrne’s suppression task, a psychological study where the experimental results show that participants’ conclusions systematically deviate (...) from the classical logically correct answers. As weak completion semantics is a novel technique in the field of computational logic, it is important to examine how it corresponds to other already established non-monotonic approaches. For this purpose we investigate the relation of weak completion with respect to completion and three-valued stable model semantics. In particular, we show that well-founded semantics, a widely accepted approach in the field of non-monotonic reasoning, corresponds to weak completion semantics for a specific class of modified programs. (shrink)

In its first meaning, a logic is a collection of closely related artificial languages. There are certain languages called first‐order languages, and together they form first‐order logic. In the same spirit, there are several closely related languages called modal languages, and together they form modal logic. Likewise second‐order logic, deontic logic and so forth.

In diesem Aufsatz wird ein neues Paradoxon vorgestellt, der Super-Lügner. Er ist stärker als alle bekannten Lügner-Sätze, nicht mehr eindeutig selbstreferentiell und läßt sich darüber hinaus in eindeutig in die Tarski-Hierarchie einordnen. Eine unendlich große Familie von Super-Lügnern auf Metaebenen ist konstruierbar. Schließlich widersetzt sich der Super-Lügner der Auflösung durch die neue vielversprechende Reflexionslogik LR von U. Blau.

If complexity is a necessary but not sufficient premise for the existence and expression of the living, anticipation is the distinguishing characteristic of what is alive. Anticipation is at work even at levels of existence where we cannot refer to intelligence. The prospect of artificially generating aesthetic artifacts and ethical constructs of relevance to a world in which the natural and the artificial are coexistent cannot be subsumed as yet another product of scientific and technological advancement. Beyond the artificial, the (...) synthetic conjures the understanding of aesthetics and ethics no longer from the perspective of the How? type of question, but rather the Why? Given the current infatuation with synthetic biology (i.e., making life from non-life), there is a practical consequence to such considerations. Synthetic life, as any other form of life, implies the possibility of evolution. Anticipation, which is the underlying factor of evolution, is thus expected. At the level of human existence, anticipation is expressed, for instance (but not exclusively), in aesthetic forms and ethical values. This translates, in turn, into an argument for the role aesthetics and ethics play in the process. Consequently, to qualify as life, the synthesis of the physical and the living will have to efficiently handle ambiguity. Current computational facilities, regardless of their nature or performance, operate exclusively in the semiotic domain of the well defined non-ambiguous. (shrink)

For over a decade, the hypercomputation movement has produced computational models that in theory solve the algorithmically unsolvable, but they are not physically realizable according to currently accepted physical theories. While opponents to the hypercomputation movement provide arguments against the physical realizability of specific models in order to demonstrate this, these arguments lack the generality to be a satisfactory justification against the construction of any information-processing machine that computes beyond the universal Turing machine. To this end, I present a more (...) mathematically concrete challenge to hypercomputability, and will show that one is immediately led into physical impossibilities, thereby demonstrating the infeasibility of hypercomputers more generally. This gives impetus to propose and justify a more plausible starting point for an extension to the classical paradigm that is physically possible, at least in principle. Instead of attempting to rely on infinities such as idealized limits of infinite time or numerical precision, or some other physically unattainable source, one should focus on extending the classical paradigm to better encapsulate modern computational problems that are not well-expressed/modeled by the closed-system paradigm of the Turing machine. I present the first steps toward this goal by considering contemporary computational problems dealing with intractability and issues surrounding cyber-physical systems, and argue that a reasonable extension to the classical paradigm should focus on these issues in order to be practically viable. (shrink)

We look at extensions (i.e., stronger logics in the same language) of the Belnap–Dunn four-valued logic. We prove the existence of a countable chain of logics that extend the Belnap–Dunn and do not coincide with any of the known extensions (Kleene’s logics, Priest’s logic of paradox). We characterise the reduced algebraic models of these new logics and prove a completeness result for the first and last element of the chain stating that both logics are determined by a single finite logical (...) matrix. We show that the last logic of the chain is not finitely axiomatisable. (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)

the world of phenomena is immensely large this means we can perceive only part of the world. We see, feel and hear parts of reality, not the whole of it, and it seems that a sentence containing a verb of perception like 'John sees a house burn' is most naturally treated as saying that the subject sees an incomplete world in which the embedded sentence is true (see Barwise (1981) for this analysis). But if we want to analyse perception verbs (...) thus, we must introduce some form of incompleteness into our formal system, the.. (shrink)

Pour le philosophe intéressé aux structures et aux fondements du savoir théorétique, à la constitution d'une « méta-théorétique «, θεωρíα., qui, mieux que les « Wissenschaftslehre » fichtéenne ou husserlienne et par-delà les débris de la métaphysique, veut dans une intention nouvelle faire la synthèse du « théorétique », la logique mathématique se révèle un objet privilégié.

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)

Natural deduction is the type of logic most familiar to current philosophers, and indeed is all that many modern philosophers know about logic. Yet natural deduction is a fairly recent innovation in logic, dating from Gentzen and Jaśkowski in 1934. This article traces the development of natural deduction from the view that these founders embraced to the widespread acceptance of the method in the 1960s. I focus especially on the different choices made by writers of elementary textbooks—the standard conduits of (...) the method to a generation of philosophers—with an eye to determining what the ‘essential characteristics’ of natural deduction are. (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)

By language we understand a lower predicate calculus with identity and (perhaps) relation and function symbols. It is convenient to allow for more than one sort of variable. Now each individual constant (if there are any) is of a specified sort, the formal expressions R(t1, … tn), f(t1,…, tn) are well formed only if the terms t1, …, tn are of specified sorts determined by the relation symbol R and the function symbol f, and the term f(t1, …, tn) (if (...) well formed) is of a sort determined by f. We admit s = t as well formed, no matter what the sorts of s and t. (shrink)

A new method of "minimal" realizability is proposed and applied to show that the definable functions of Heyting arithmetic (HA)--functions f such that HA $\vdash \forall x\exists!yA(x, y)\Rightarrow$ for all m, A(m, f(m)) is true, where A(x, y) may be an arbitrary formula of L(HA) with only x, y free--are precisely the provably recursive functions of the classical Peano arithmetic (PA), i.e., the $ -recursive functions. It is proved that, for prenex sentences provable in HA, Skolem functions may always be (...) chosen to be $ -recursive. The method is extended to intuitionistic finite-type arithmetic, HA ω 0 , and elementary analysis. Generalized forms of Kreisel's characterization of the provably recursive functions of PA and of the no-counterexample-interpretation for PA are consequently derived. (shrink)

Arguments to the effect that Church's thesis is intrinsically unprovable because proof cannot relate an informal, intuitive concept to a mathematically defined one are unconvincing, since other 'theses' of this kind have indeed been proved, and Church's thesis has been proved in one direction. However, though evidence for the truth of the thesis in the other direction is overwhelming, it does not yet amount to proof.

The standard natural deduction rules for the identity predicate have seemed to some not to be harmonious. Stephen Read has suggested an alternative introduction rule that restores harmony but presupposes second-order logic. Here it will be shown that the standard rules are in fact harmonious. To this end, natural deduction will be enriched with a theory of definitional identity. This leads to a novel conception of canonical derivation, on the basis of which the identity elimination rule can be justified in (...) a proof-theoretical manner. (shrink)

Infectious logics are systems that have a truth-value that is assigned to a compound formula whenever it is assigned to one of its components. This paper studies four-valued infectious logics as the basis of transparent theories of truth. This take is motivated as a way to treat different pathological sentences differently, namely, by allowing some of them to be truth-value gluts and some others to be truth-value gaps and as a way to treat the semantic pathology suffered by at least (...) some of these sentences as infectious. This leads us to consider four distinct four-valued logics: one where truth-value gaps are infectious, but gluts are not; one where truth-value gluts are infectious, but gaps are not; and two logics where both gluts and gaps are infectious, in some sense. Additionally, we focus on the proof theory of these systems, by offering a discussion of two related topics. On the one hand, we prove some limitations regarding the possibility of providing standard Gentzen sequent calculi for these systems, by dualizing and extending some recent results for infectious logics. On the other hand, we provide sound and complete four-sided sequent calculi, arguing that the most important technical and philosophical features taken into account to usually prefer standard calculi are, indeed, enjoyed by the four-sided systems. (shrink)