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)

یکی از چالش‌های حوزۀ زبان دینی به امکانِ جمع میان فرض تعالی و فرض ارجاع متعارف دینی برمی‌گردد. فرض تعالی مدعی است که ساحت الهی/مطلق به طور کامل از ساحت بشری/ممکن منفک است. فرض ارجاع متعارف دینی نیز مدعی است که می‌توان به ساحت الهی/مطلق به شکل متعینی ارجاع داد. تردید در امکان جمعِ میان این دو از آنجا می‌آید که گویا مدعایی در ذهن هست که «اگر ساحتِ الهی/مطلق، به طور کامل از ساحتِ بشری/ممکن منفک باشد، آنگاه نمی‌توان به (...) شکل متعینی به آن ارجاع داد». در این مقاله، با تکیه بر استدلال مدل‌تئورتیک هیلاری پاتنم در حوزۀ متافیزیک، استدلالی به نفع این مدعا ارائه می‌شود که به دنبال آن، تعارض میان فرض تعالی و فرض ارجاع متعارف دینی به یک تعارض جدی تبدیل می‌شود، به گونه‌ای که دیگر نمی‌توان این دو را هم‌زمان و بدون هیچ تعدیلی پذیرفت. در پایان نیز، از باب نمونه، سه راه برون‌رفت از این تعارض ارائه می‌شود. این راه‌ها عبارت‌اند از پلورالیسم درون‌گرا، نوعی الاهیات تنزیهی، و غیربشری دانستنِ زبان. (shrink)

This collection of papers, celebrating the contributions of Swedish logician Dag Prawitz to Proof Theory, has been assembled from those presented at the Natural Deduction conference organized in Rio de Janeiro to honour his seminal research. Dag Prawitz’s work forms the basis of intuitionistic type theory and his inversion principle constitutes the foundation of most modern accounts of proof-theoretic semantics in Logic, Linguistics and Theoretical Computer Science. The range of contributions includes material on the extension of natural deduction with higher-order (...) rules, as opposed to higher-order connectives, and a paper discussing the application of natural deduction rules to dealing with equality in predicate calculus. The volume continues with a key chapter summarizing work on the extension of the Curry-Howard isomorphism, via methods of category theory that have been successfully applied to linear logic, as well as many other contributions from highly regarded authorities. With an illustrious group of contributors addressing a wealth of topics and applications, this volume is a valuable addition to the libraries of academics in the multiple disciplines whose development has been given added scope by the methodologies supplied by natural deduction. The volume is representative of the rich and varied directions that Prawitz work has inspired in the area of natural deduction. (shrink)

The volume analyses and develops David Makinson’s efforts to make classical logic useful outside its most obvious application areas. The book contains chapters that analyse, appraise, or reshape Makinson’s work and chapters that develop themes emerging from his contributions. These are grouped into major areas to which Makinsons has made highly influential contributions and the volume in its entirety is divided into four sections, each devoted to a particular area of logic: belief change, uncertain reasoning, normative systems and the resources (...) of classical logic. Among the contributions included in the volume, one chapter focuses on the “inferential preferential method”, i.e. the combined use of classical logic and mechanisms of preference and choice and provides examples from Makinson’s work in non-monotonic and defeasible reasoning and belief revision. One chapter offers a short autobiography by Makinson which details his discovery of modern logic, his travels across continents and reveals his intellectual encounters and inspirations. The chapter also contains an unusually explicit statement on his views on the role of logic in philosophy. (shrink)

The volume includes twenty-five research papers presented as gifts to John L. Bell to celebrate his 60th birthday by colleagues, former students, friends and admirers. Like Bell’s own work, the contributions cross boundaries into several inter-related fields. The contributions are new work by highly respected figures, several of whom are among the key figures in their fields. Some examples: in foundations of maths and logic ; analytical philosophy, philosophy of science, philosophy of mathematics and decision theory and foundations of economics. (...) Most articles are contributions to current philosophical debates, but contributions also include some new mathematical results, important historical surveys, and a translation by Wilfrid Hodges of a key work of arabic logic. (shrink)

Eight distinct rules for implication in the antecedent for the sequent calculus, one of which being Gentzen’s standard rule, can be derived by successively applying a number of cuts to the logical ground sequent A → B, A ⇒ B. A naive translation into natural deduction collapses four of those rules onto the standard implication elimination rule, and the remaining four rules onto the general elimination rule. This collapse is due to the fact that the difference between a formula occurring (...) in the succedent of a premise of a sequent calculus rule and that formula instead occurring in the antecedent of the conclusion cannot be adequately expressed in the framework of natural deduction. In contrast to this, the difference between a formula occurring in the succedent of the conclusion of a sequent calculus rule and that formula instead occurring in the antecedent of a premise corresponds exactly to the distinction between the standard implication elimination rule and its general counterpart. This incongruity can be remedied by introducing a notational facility that requires of the particular premise of a rule to which it is attached to be an assumption, i.e., to prevent it from being the conclusion of another rule application. Applying this facility to implication elimination results in eight distinct rules that correspond exactly to the eight sequent calculus rules. These eight rules are presented and discussed in detail. It turns out that a natural deduction calculus (for positive implication logic) that employs the rule corresponding to the standard left implication rule of the sequent calculus as well as a rule for explicit substitution can be seen as a natural deduction style sequent calculus. (shrink)

The paper introduces a new type of rules into Natural Deduction, elimination rules by composition. Elimination rules by composition replace usual elimination rules in the style of disjunction elimination and give a more direct treatment of additive disjunction, multiplicative conjunction, existence quantifier and possibility modality. Elimination rules by composition have an enormous impact on proof-structures of deductions: they do not produce segments, deduction trees remain binary branching, there is no vacuous discharge, there is only few need of permutations. This new (...) type of rules fits especially to substructural issues, so it is shown for Lambek Calculus, i.e. intuitionistic non-commutative linear logic and to its extensions by structural rules like permutation, weakening and contraction. Natural deduction formulated with elimination rules by composition from a complexity perspective is superior to other calculi. (shrink)

A first-order language with a defined identity predicate is proposed whose apparatus for atomic predication is sensitive to grammatical categories of natural language. Subatomic natural deduction systems are defined for this naturalistic first-order language. These systems contain subatomic systems which govern the inferential relations which obtain between naturalistic atomic sentences and between their possibly composite components. As a main result it is shown that normal derivations in the defined systems enjoy the subexpression property which subsumes the subformula property with respect (...) to atomic and identity formulae as a special case. The systems admit a proof-theoretic semantics which does not only apply to logically compound but also to atomic and identity formulae—as well as to their components. The potential of the defined systems for a meticulous first-order analysis of natural inferences whose validity crucially depends on expressions of some of the aforementioned categories is demonstrated. (shrink)

This paper develops a (nontrivial) theory of cardinal numbers from a naive set comprehension principle, in a suitable paraconsistent logic. To underwrite cardinal arithmetic, the axiom of choice is proved. A new proof of Cantor’s theorem is provided, as well as a method for demonstrating the existence of large cardinals by way of a reflection theorem.

In this paper, a family of paraconsistent propositional logics with constructive negation, constructive implication, and constructive co-implication is introduced. Although some fragments of these logics are known from the literature and although these logics emerge quite naturally, it seems that none of them has been considered so far. A relational possible worlds semantics as well as sound and complete display sequent calculi for the logics under consideration are presented.

Existence monism (EM) is a metaphysical view asserting the existence of only one concrete object. EM is well known for its radicalness, and encounters difficulty in terms of its prima facie inconsistency with truisms. This paper aims to propose an alternative (and somewhat easy) way to overcome this difficulty and indicate another means by which the possibility of EM can be defended. I will present a package of theses that are intended to be combined with EM, which I call Linguistic (...) Ontology with the One as Semantic Glue (LOOSG). I will show that this package (in combination with EM) provides a systematic explanation as to why truisms hold while only one concrete object actually exists. In other words, I will argue that if an existence monist embraces LOOSG, the desired explanation for truisms is then available to her. In addition, it will also be noted that LOOSG has a theoretical virtue, in that it only presupposes the framework of standard semantics. Based on these discussions, I offer LOOSG as a viable option for existence monism. (shrink)

We extend natural deduction for first-order logic (FOL) by introducing diagrams as components of formal proofs. From the viewpoint of FOL, we regard a diagram as a deductively closed conjunction of certain FOL formulas. On the basis of this observation, we first investigate basic heterogeneous logic (HL) wherein heterogeneous inference rules are defined in the styles of conjunction introduction and elimination rules of FOL. By examining what is a detour in our heterogeneous proofs, we discuss that an elimination-introduction pair of (...) rules constitutes a redex in our HL, which is opposite the usual redex in FOL. In terms of the notion of a redex, we prove the normalization theorem for HL, and we give a characterization of the structure of heterogeneous proofs. Every normal proof in our HL consists of applications of introduction rules followed by applications of elimination rules, which is also opposite the usual form of normal proofs in FOL. Thereafter, we extend the basic HL by extending the heterogeneous rule in the style of general elimination rules to include a wider range of heterogeneous systems. (shrink)

The notion of harmony has played a pivotal role in a number of debates in the philosophy of logic. Yet there is little agreement as to how the requirement of harmony should be spelled out in detail or even what purpose it is to serve. Most, if not all, conceptions of harmony can already be found in Michael Dummett's seminal discussion of the matter in The Logical Basis of Metaphysics. Hence, if we wish to gain a better understanding of the (...) notion of harmony, we do well to start here. Unfortunately, however, Dummett's discussion is not always easy to follow. The following is an attempt to disentangle the main strands of Dummett's treatment of harmony. The different variants of harmony as well as their interrelations are clarified and their individual shortcomings qua interpretations of harmony are demonstrated. Though no attempt is made to give a detailed alternative account of harmony here, it is hoped that our discussion will lay the ground for an adequate rigorous treatment of this central notion. (shrink)

Two common forms of natural deduction proof systems are found in the Gentzen–Prawitz and Jaśkowski–Fitch systems. In this paper, I provide translations between proofs in these systems, pointing out the ways in which the translations highlight the structural rules implicit in the systems. These translations work for classical, intuitionistic, and minimal logic. I then provide translations for classical S4 proofs.

Some authors have claimed that ante rem structuralism has problems with structures that have indiscernible places. In response, I argue that there is no requirement that mathematical objects be individuated in a non-trivial way. Metaphysical principles and intuitions to the contrary do not stand up to ordinary mathematical practice, which presupposes an identity relation that, in a sense, cannot be defined. In complex analysis, the two square roots of –1 are indiscernible: anything true of one of them is true of (...) the other. I suggest that ‘i’ functions like a parameter in natural deduction systems. I gave an early version of this paper at a workshop on structuralism in mathematics and science, held in the Autumn of 2006, at Bristol University. Thanks to the organizers, particularly Hannes Leitgeb, James Ladyman, and Øystein Linnebo, to my commentator Richard Pettigrew, and to the audience there. The paper also benefited considerably from a preliminary session at the Arché Research Centre at the University of St Andrews. I am indebted to my colleagues Craige Roberts, for help with the linguistics literature, and Ben Caplan and Gabriel Uzquiano, for help with the metaphysics. Thanks also to Hannes Leitgeb and Jeffrey Ketland for reading an earlier version of the manuscript and making helpful suggestions. I also benefited from conversations with Richard Heck, John Mayberry, Kevin Scharp, and Jason Stanley. CiteULike Connotea Del.icio.us What's this? (shrink)

There is an interesting logical/semantic issue with some mathematical languages and theories. In the language of (pure) complex analysis, the two square roots of i’ manage to pick out a unique object? This is perhaps the most prominent example of the phenomenon, but there are some others. The issue is related to matters concerning the use of definite descriptions and singular pronouns, such as donkey anaphora and the problem of indistinguishable participants. Taking a cue from some work in linguistics and (...) the philosophy of language, I suggest that i functions like a parameter in natural deduction systems. This may require some rethinking of the role of singular terms, at least in mathematical languages. (shrink)

Kripke’s theory of truth, 690–716; 1975) has been very successful but shows well-known expressive difficulties; recently, Field has proposed to overcome them by adding a new conditional connective to it. In Field’s theories, desirable conditional and truth-theoretic principles are validated that Kripke’s theory does not yield. Some authors, however, are dissatisfied with certain aspects of Field’s theories, in particular the high complexity. I analyze Field’s models and pin down some reasons for discontent with them, focusing on the meaning of the (...) new conditional and on the status of the principles so successfully recovered. Subsequently, I develop a semantics that improves on Kripke’s theory following Field’s program of adding a conditional to it, using some inductive constructions that include Kripke’s one and feature a strong evaluation for conditionals. The new theory overcomes several problems of Kripke’s one and, although weaker than Field’s proposals, it avoids the difficulties that affect them; at the same time, the new theory turns out to be quite simple. Moreover, the new construction can be used to model various conceptions of what a conditional connective is, in ways that are precluded to both Kripke’s and Field’s theories. (shrink)

This paper introduces the logic of evidence and truth \ as an extension of the Belnap–Dunn four-valued logic \. \ is a slightly modified version of the logic \, presented in Carnielli and Rodrigues. While \ is equipped only with a classicality operator \, \ is equipped with a non-classicality operator \ as well, dual to \. Both \ and \ are logics of formal inconsistency and undeterminedness in which the operator \ recovers classical logic for propositions in its scope. (...) Evidence is a notion weaker than truth in the sense that there may be evidence for a proposition \ even if \ is not true. As well as \, \ is able to express preservation of evidence and preservation of truth. The primary aim of this paper is to propose a probabilistic semantics for \ where statements \\) and \\) express, respectively, the amount of evidence available for \ and the degree to which the evidence for \ is expected to behave classically—or non-classically for \ \). A probabilistic scenario is paracomplete when \ + P 1\), and in both cases, \ < 1\). If \ = 1\), or \ = 0\), classical probability is recovered for \. The proposition \, a theorem of \, partitions what we call the information space, and thus allows us to obtain some new versions of known results of standard probability theory. (shrink)

Ce bel ouvrage, clair, aéré et spacieux, se caractérise à la fois par sa volonté de simplicité d’accès, et son ambition, puisqu’on y trouve notamment une démonstration de la complétude d’un certain système déductif S1 pour la logique classique des prédicats, ainsi qu’une version synoptique du théorème de Gödel, selon lequel toute théorie du premier ordre complète axiomatisable est décidable, d’où il s’ensuit que l’arithmétique, c’est-à-dire l’ensemble des énoncés du premier ordre vrais dans, n’est pas axiomatisable; ce qu’on exprime souvent (...) en disant que tout système formel pour l’arithmétique est incomplet, au sens où il y a des énoncés vrais qui ne sont pas des théorèmes du système. (shrink)

In recent philosophy of mathematics avariety of writers have presented ``structuralist''views and arguments. There are, however, a number ofsubstantive differences in what their proponents take``structuralism'' to be. In this paper we make explicitthese differences, as well as some underlyingsimilarities and common roots. We thus identifysystematically and in detail, several main variants ofstructuralism, including some not often recognized assuch. As a result the relations between thesevariants, and between the respective problems theyface, become manifest. Throughout our focus is onsemantic and metaphysical issues, (...) including what is orcould be meant by ``structure'' in this connection. (shrink)

One might poetically muse that computers have the essence both of logic and machines. Through the case of the history of Separation Logic, we explore how this assertion is more than idle poetry. Separation Logic works because it merges the software engineer’s conceptual model of a program’s manipulation of computer memory with the logical model that interprets what sentences in the logic are true, and because it has a proof theory which aids in the crucial problem of scaling the reasoning (...) task. Scalability is a central problem, and some would even say the central problem, in appli- cations of logic in computer science. Separation Logic is an interesting case because of its widespread success in verification tools. For these two senses of model—the engineering/conceptual and the logical—to merge in a genuine sense, each must maintain their norms of use from their home disciplines. When this occurs, both the logic and engineering benefit greatly. Seeking this intersection of two different senses of model provides a strategy for how computer scientists and logicians may be successful. Furthermore, the history of Separation Logic for analysing programs provides a novel case for philosophers of science of how software engineers and computer scientists develop models and the components of such models. We provide three contributions: an exploration of the extent of models merging that is necessary for success in computer science; an introduction to the technical details of Separation Logic, which can be used for reasoning about other exhaustible resources; and an introduction to the problems, process, and results of computer scientists for those outside the field. (shrink)

In Poggiolesi we have introduced a rigorous definition of the notion of complete and immediate formal grounding; in the present paper our aim is to construct a logic for the notion of complete and immediate formal grounding based on that definition. Our logic will have the form of a calculus of natural deduction, will be proved to be sound and complete and will allow us to have fine-grained grounding principles.

The paper provides a preliminary study of algebraic semantics for modal and superintuitionistic non-monotonic logics. The main question answered is: how can non-monotonic inference be understood algebraically?

In this paper, we present a propositional logic (called mixed logic) containing disjoint copies of minimal, intuitionistic and classical logics. We prove a completeness theorem for this logic with respect to a Kripke semantics. We establish some relations between mixed logic and minimal, intuitionistic and classical logics. We present at the end a sequent calculus version for this logic.

This paper is a reflexion on the computability of natural language semantics. It does not contain a new model or new results in the formal semantics of natural language: it is rather a computational analysis, in the context for type-logical grammars, of the logical models and algorithms currently used in natural language semantics, defined as a function from a grammatical sentence to a set of logical formulas—because a statement can be ambiguous, it can correspond to multiple formulas, one for each (...) reading. We argue that as long as we do not explicitly compute the interpretation in terms of possible world models, one can compute the semantic representation of a given statement, including aspects of lexical meaning. This is a very generic process, so the results are, at least in principle, widely applicable. We also discuss the algorithmic complexity of this process. (shrink)

In this paper we define a suitable version of the notion of homomorphism for Kripke models of intuitionistic first-order logic and characterize theories that are preserved under images and also those that are preserved under inverse images of homomorphisms. Moreover, we define a notion of union of chain for Kripke models and define a class of formulas that is preserved in unions of chains. We also define similar classes of formulas and investigate their behavior in Kripke models. An application to (...) intuitionistic first-order arithmetic is also given. (shrink)

Until is a notoriously difficult temporal operator as it is both existential and universal at the same time: A∪B holds at the current time instant w iff either B holds at w or there exists a time instant w' in the future at which B holds and such that A holds in all the time instants between the current one and ẃ. This “ambivalent” nature poses a significant challenge when attempting to give deduction rules for until. In this paper, in (...) contrast, we make explicit this duality of until by introducing a new temporal operator ∇ that allows us to formalize the “history” of until, i.e., the “internal” universal quantification over the time instants between the current one and ẃ. This approach provides the basis for formalizing deduction systems for temporal logics endowed with the until operator. For concreteness, we give here a labeled natural deduction system N(LTL∇) for a linear-time logic LTL∇ endowed with the new history operator. We show that LTL∇ is equivalent to the linear temporal logic LTL with until, which follows by formalizing back and forth translations between the two logics. We also define an indirect translation from LTL∇ into LTL via temporal logics with past operators; such a result provides an upper bound to the problem of satisfiability for LTL∇ formulas. (shrink)

SummaryThe paper presents a paradigmatic part of the logic of magnitudes, an invention of Descartes, different from alethic formal logic, but a proper formal logic sui generis. Descartes' logic consists of corporeal – geometrical and physical – devices that behave like deductive calculi, generating inferences of magnitudes from magnitudes. Its syntactic elements are magnitudes as corporeal entities, whose connections can be characterized by various magnitudinal connectives, distinguished from those of alethic logic. The paper presents two kinds of orthogonal and the (...) congruence connectives applying them to line segments and to physical magnitudes. It describes the value semantics and the interpretative semantics of these connections, the inference rules they take part in, states the conditions for validity and theoremhood, and compares it to model theory. It shows that one of the orthogonal connections displays the ontic and logical properties of Descartes’ideae innatae, whereas the other displays those of Descartes’ideae factae, and shows that the physical law m v =p regarded as an orthogonal connection is an idea innata. (shrink)

In this article my primary intention is to engage in a discussion on the inherent constraints of models, taken as models of theories, that reaches beyond the epistemological level. Naturally the paper takes into account the ongoing debate between proponents of the syntactic and the semantic view of theories and that between proponents of the various versions of scientific realism, reaching down to the most fundamental, subjective level of discourse. In this approach, while allowing for a limited discussion of physical (...) and positive science models, I am primarily focused on the structure and ontology of mathematical models, in particular Cohen’s forcing models and to a lesser extent Gödel’s constructible universe, to the extent that these were designed to answer questions bearing on the scope, the capacity and ultimately the ontology of models themselves, therefore influencing in one or the other way the status of models in general. This status, it is argued, is largely defined by the way models subsume a set-theoretical structure whose constraints, reducible to an extra-linguistic level of discourse, may implicitly condition the epistemic status of models as representations of axiomatic theories. In the last section I deal extensively with the inner constraints of theories as subjectively originated in a less technical philosophically oriented discussion with certain prompts from phenomenology. (shrink)

This is an article whose intended scope is to deal with the question of infinity in formal mathematics, mainly in the context of the theory of large cardinals as it has developed over time since Cantor’s introduction of the theory of transfinite numbers in the late nineteenth century. A special focus has been given to this theory’s interrelation with the forcing theory, introduced by P. Cohen in his lectures of 1963 and further extended and deepened since then, which leads to (...) a development and further refinement of the theory of large cardinals ultimately touching, especially in view of the discussion in the last section, on the metatheoretical nature of infinity. The whole undertaking, which takes into account major stages of the research in large cardinals theory, tries to present a defensible argumentation against an ontology of infinity actually rooted in the notion of subjectivity within the world. This means that rather than talking of a general ontology of infinity in the ideal platonic or in the aristotelian sense of potentiality, even in the alternative sense of an ontology of the event in A. Badiou’s sense, one can argue from a subjective point of view about the impossibility of defining cardinalities greater than the first uncountable one \ that would correspond to a distinct existence in real world terms or would be supported by a mathematical intuition in terms of reciprocity with experience. The argumentation from the particular standpoint includes also certain comments on the delimitative character of Gödel’s constructive universe L and the influence of the constructive approach in narrowing the breadth of an ‘ontology’ of infinity. (shrink)

In this article I intend to show that certain aspects of the axiomatical structure of mathematical theories can be, by a phenomenologically motivated approach, reduced to two distinct types of idealization, the first-level idealization associated with the concrete intuition of the objects of mathematical theories as discrete, finite sign-configurations and the second-level idealization associated with the intuition of infinite mathematical objects as extensions over constituted temporality. This is the main standpoint from which I review Cantor’s conception of infinite cardinalities and (...) also the metatheoretical content of some later well-known theorems of mathematical foundations. These are, the Skolem-Löwenheim Theorem which, except for its importance as such, it is also chosen for an interpretation of the associated metatheoretical paradox (Skolem Paradox), and Gödel’s (first) incompleteness result which, notwithstanding its obvious influence in the mathematical foundations, is still open to philosophical inquiry. On the phenomenological level, first-level and second-level idealizations, as above, are associated respectively with intentional acts carried out in actual present and with certain modes of a temporal constitution process. (shrink)

Structural realism has been proposed as an epistemological position interpolating between realism and sceptical anti-realism about scientific theories. The structural realist who accepts a scientific theory thinks that is empirically correct, and furthermore is a realist about the ‘structural content’ of . But what exactly is ‘structural content’? One proposal is that the ‘structural content’ of a scientific theory may be associated with its Ramsey sentence (). However, Demopoulos and Friedman have argued, using ideas drawn from Newman's earlier criticism of (...) Russell's structuralism, that this move fails to achieve an interesting intermediate position between realism and anti-realism. Rather, () adds little content beyond the instrumentalistically acceptable claim that the theory is empirically adequate. Here, I formulate carefully the crucial claim of Demopoulos and Friedman, and show that the Ramsey sentence () is true just in case possesses a full model which is empirically correct and satisfies a certain cardinality condition on its theoretical domain. This suggests that structural realism is not a position significantly different from the anti-realism it attempts to distinguish itself from. Introduction Technical framework Ramsification Empirical adequacy Ramsification empirical adequacy + cardinality constraint Conclusion. (shrink)

The notion of strict identity is sometimes given an explicit second-order definition: objects with all the same properties are identical. Here, a somewhat different problem is raised: Under what conditions is the identity relation on the domain of a structure first-order definable? A structure may have objects that are distinct, but indiscernible by the strongest means of discerning them given the language (the indiscernibility formula). Here a number of results concerning the indiscernibility formula, and the definability of identity, are collected (...) and a number of applications discussed. (shrink)

In a naïve realist approach to reading an ontology off the models of a physical theory, the invariance of a given theory under permutations of its property-bearing objects entails the existence of distinct possible worlds from amongst which the theory cannot choose. A brand of Ontic Structural Realism attempts to avoid this consequence by denying that objects possess primitive identity, and thus worlds with property values permuted amongst those objects are really one and the same world. Assuming that any successful (...) ontology of objects is able to describe a universe containing a determinate number of them, I argue that no version of OSR which both retains objects and understands ‘structure’ in terms of relations can be successful. This follows from the fact that no set of relational facts is sufficient to fix the cardinality of the collection of objects implied by those facts. More broadly, I offer reasons to believe that no version of OSR is compatible with the existence of objects, no matter how ontologically derivative they are taken to be. Any such account would have to attribute a definite cardinality to a collection of objects while denying that those objects are possessed of a primitive identity. With no compelling reason to abandon the classical conception of cardinality, such an attribution is incoherent. (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)

The concept of hypodox is dual to the concept of paradox. Whereas a paradox is incompatibly overdetermined, a hypodox is underdetermined. Indeed, many particular paradoxes have dual hypodoxes. So, naively the dual of Russell’s Paradox is whether the set of all sets that are members of themselves is self-membered. The dual of the Liar Paradox is the Truth-teller, and a hypodoxical dual of the Heterological paradox is whether ‘autological’ is autological. I provide some analysis of the duality and I search (...) for modal hypodoxes as duals to known paradoxes. I also try to continue this search further by mapping the relations between some paradoxes and hypodoxes in duality squares. This investigation increases the known extension of the concept of hypodox, and the duality relation between paradoxes and hypodoxes assists in finding some of these. (shrink)

The paper is concerned with Quine's substitutional account of logical truth. The critique of Quine's definition tends to focus on miscellaneous odds and ends, such as problems with identity. However, in an appendix to his influential article On Second Order Logic, George Boolos offered an ingenious argument that seems to diminish Quine's account of logical truth on a deeper level. In the article he shows that Quine's substitutional account of logical truth cannot be generalized properly to the general concept of (...) logical consequence. The purpose of this paper is threefold: first, to introduce the reader to the metamathematics of Quine's substitutional definition of logical truth; second, to make Boolos' result accessible to a broader audience by giving a detailed and self-contained presentation of his proof; and, finally, to discuss some of the possible implications and how a defender of the Quinean concepts might react to the challenge posed by Boolos' result. (shrink)

Fitch’s paradox shows, from fairly innocent-looking assumptions, that if there are any unknown truths, then there are unknowable truths. This is generally thought to deliver a blow to antirealist positions that imply that all truths are knowable. The present paper argues that a probabilistic version of antirealism escapes Fitch’s result while still offering all that antirealists should care for.

To save antirealism from Fitch's Paradox, Tennant has proposed to restrict the scope of the antirealist principle that all truths are knowable to truths that can be consistently assumed to be known. Although the proposal solves the paradox, it has been accused of doing so in an ad hoc manner. This paper argues that, first, for all Tennant has shown, the accusation is just; second, a restriction of the antirealist principle apparently weaker than Tennat's yields a non-ad hoc solution to (...) Fitch's Paradox; and third, the alternative is only apparently weaker than, and even provably equivalent to, Tennant's. It is thereby shown that the latter is not ad hoc after all. (shrink)

This paper contains five observations concerning the intended meaning of the intuitionistic logical constants: (1) if the explanations of this meaning are to be based on a non-decidable concept, that concept should not be that of `proof"; (2) Kreisel"s explanations using extra clauses can be significantly simplified; (3) the impredicativity of the definition of → can be easily and safely ameliorated; (4) the definition of → in terms of `proofs from premises" results in a loss of the inductive character of (...) the definitions of ∨ and ∃ and (5) the same occurs with the definition of ∀ in terms of `proofs with free variables". (shrink)

We give a procedure for counting the number of different proofs of a formula in various sorts of propositional logic. This number is either an integer (that may be 0 if the formula is not provable) or infinite.

Using the Hilbert-Bernays account as a spring-board, we first define four ways in which two objects can be discerned from one another, using the non-logical vocabulary of the language concerned. Because of our use of the Hilbert-Bernays account, these definitions are in terms of the syntax of the language. But we also relate our definitions to the idea of permutations on the domain of quantification, and their being symmetries. These relations turn out to be subtle---some natural conjectures about them are (...) false. We will see in particular that the idea of symmetry meshes with a species of indiscernibility that we will call `absolute indiscernibility'. We then report all the logical implications between our four kinds of discernibility. We use these four kinds as a resource for stating four metaphysical theses about identity. Three of these theses articulate two traditional philosophical themes: viz. the principle of the identity of indiscernibles, and haecceitism. The fourth is recent. Its most notable feature is that it makes diversity weaker than what we will call individuality : two objects can be distinct but not individuals. For this reason, it has been advocated both for quantum particles and for spacetime points. Finally, we locate this fourth metaphysical thesis in a broader position, which we call structuralism. We conclude with a discussion of the semantics suitable for a structuralist, with particular reference to physical theories as well as elementary model theory. (shrink)