In this paper, a metaphysics is proposed that includes everything that can be represented by a well-founded multiset. It is shown that this metaphysics, apart from being self-explanatory, is also benevolent. Paradoxically, it turns out that the probability that we were born in another life than our own is zero. More insights are gained by inducing properties from a metaphysics that is not self-explanatory. In particular, digital metaphysics is analyzed, which claims that only computable things exist. First of all, it (...) is shown that digital metaphysics contradicts itself by leading to the conclusion that the shortest computer program that computes the world is infinitely long. This means that the Church-Turing conjecture must be false. Secondly, the applicability of Occam’s razor is explained by evolution: in an evolving physics it can appear at each moment as if the world is caused by only finitely many things. Thirdly and most importantly, this metaphysics is benevolent in the sense that it organizes itself to fulfill the deepest wishes of its observers. Fourthly, universal computers with an infinite memory capacity cannot be built in the world. And finally, all the properties of the world, both good and bad, can be explained by evolutionary conservation. (shrink)

A prized property of theories of all kinds is that of generality, of applicability or least relevance to a wide range of circumstances and situations. The purpose of this article is to present a pair of distinctions that suggest that three kinds of generality are to be found in mathematics and logics, not only at some particular period but especially in developments that take place over time: ‘omnipresent’ and ‘multipresent’ theories, and ‘ubiquitous’ notions that form dependent parts, or moments, of (...) theories. The category of ‘facets’ is also introduced, primarily to assess the roles of diagrams and notations in these two disciplines. Various consequences are explored, starting with means of developing applied mathematics, and then reconsidering several established ways of elaborating or appraising theories, such as analogising, revolutions, abstraction, unification, reduction and axiomatisation. The influence of theories already in place upon theory-building is emphasised. The roles in both mathematics and logics of set theory, abstract algebras, metamathematics, and model theory are assessed, along with the different relationships between the two disciplines adopted in algebraic logic and in mathematical logic. Finally, the issue of monism versus pluralism in these two disciplines is rehearsed, and some suggestions are made about the special character of mathematical and logical knowledge, and also the differences between them. Since the article is basically an exercise in historiography, historical examples and case studies are described or noted throughout. (shrink)

This paper develops a formal system, consisting of a language and semantics, called serial logic ( SL ). In rough outline, SL permits quantification over, and reference to, some finite number of things in an order , in an ordinary everyday sense of the word “order,” and superplural quantification over things thus ordered. Before we discuss SL itself, some mention should be made of an issue in philosophical logic which provides the background to the development of SL , and with (...) respect to which I wish to contend that the system permits progress. (shrink)

This paper argues that there is no possible structural way of drawing a distinction between objects of different types, such as individuals and properties of different adicities and orders. We show first that purely combinatorial information (information about how objects combine to form states of affairs) is not sufficient for doing this. We show that for any set of such combinatorial data there is always more than one way of typing them – that is, there are always several ways of (...) classifying the different constituents of states of affairs as individuals and properties. Therefore, contrary to received ontological opinion, no object is essentially of any specific type. In the second part we argue that taking into account logical information does not help either, since logic presupposes the very distinction we are trying to draw. Furthermore, this distinction is not even essential for logic, since logic can function perfectly well without it. We conclude that certain distinctions which have been traditionally regarded as ontologically basic (such as that between individuals and properties) cannot be as fundamental as is often supposed. (shrink)

Neutrosophic theory and its applications have been expanding in all directions at an astonishing rate especially after of the introduction the journal entitled “Neutrosophic Sets and Systems”. New theories, techniques, algorithms have been rapidly developed. One of the most striking trends in the neutrosophic theory is the hybridization of neutrosophic set with other potential sets such as rough set, bipolar set, soft set, hesitant fuzzy set, etc. The different hybrid structures such as rough neutrosophic set, single valued neutrosophic rough set, (...) bipolar neutrosophic set, single valued neutrosophic hesitant fuzzy set, etc. are proposed in the literature in a short period of time. Neutrosophic set has been an important tool in the application of various areas such as data mining, decision making, e-learning, engineering, medicine, social science, and some more. (shrink)

An important question for proponents of non-contractive approaches to paradox is why contraction fails. Zardini offers an answer, namely that paradoxical sentences exhibit a kind of instability. I elaborate this idea using revision theory, and I argue that while instability does motivate failures of contraction, it equally motivates failure of many principles that non-contractive theorists want to maintain.

The Received View of particles in quantum mechanics is that they are indistinguishable entities within their kinds and that, as a consequence, they are not individuals in the metaphysical sense and self-identity does not meaningfully apply to them. Nevertheless cardinality does apply, in that one can have n> 1 such particles. A number of authors have recently argued that this cluster of claims is internally contradictory: roughly, that having more than one such particle requires that the concepts of distinctness and (...) identity must apply after all. A common thread here is that the notion of identity is too fundamental to forego in any metaphysical account. I argue that this argument fails. I then argue that the failure of individuality and identity applies also to macroscopic physical objects, that the problems cannot be constrained to apply only within the microscopic realm. (shrink)

This manuscript focuses on a problem for Millian Russellianism raised by Fine : “[Assuming] that we are in possession of the information that a Fs and the information that a Gs, it appears that we are sometimes justified in putting this information ‘together’ and inferring that a both Fs and Gs. But how?” It will be my goal to determine a Millian-Russellian solution to this problem. I will first examine Nathan Salmon’s Millian-Russellian solution, which appeals to a non-semantic and subjective (...) notion of coordination defined in terms of guises. I will object that in order to convincingly solve a specific version of Fine’s problem, identity conditions for guises must be provided. On the other hand, the most plausible way to individuate guises is by means of the equivalence classes of coordination itself. But, if so, the guise-based strategy to solve Fine’s problem risks being circular; in addition, there are serious doubts that coordination is transitive. An alternative Millian-Russellian solution to Fine’s problem will then be explored, which gives up guises and employs, instead, a non-semantic and subjective relation of coordination not defined in terms of guises, along with occurrences of Russellian propositions of a special sort, for which identity conditions will be provided and via which token attitude states intuitively more fine-grained than guises will be individuated. (shrink)

We critically examine the claim that identity is a fundamental concept. According to those putting forward this thesis, there are four related reasons that can be called upon to ground the fundamental character of identity: identity is presupposed in every conceptual system; identity is required to characterize individuality; identity cannot be defined; the intelligibility of quantification requires identity. We address each of these points and argue that none of them advances compelling reasons to hold that identity is fundamental; in fact, (...) most of the tasks that seem to require identity may be performed without identity. So, in the end, identity may not be a fundamental concept after all. (shrink)

Schrödinger logics are logical systems in which the principle of identity is not true in general. The intuitive motivation for these logics is both Erwin Schrödinger's thesis that identity lacks sense for elementary particles of modern physics, and the way which physicists deal with this concept; normally, they understand identity as meaning indistinguishability . Observing that these concepts are equivalent in classical logic and mathematics, which underly the usual physical theories, we present a higher-order logical system in which these concepts (...) are systematically separated. A 'classical' semantics for the system is presented and some philosophical related questions are mentioned. One of the main characteristics of our system is that Leibniz' Principle of the Identity of Indiscernibles cannot be derived. This fact is in accordance with some authors who maintain that quantum mechanics violates this principle. Furthermore, our system may be viewed as a way of making sense some of Schrödinger's logical intuitions about the nature of elementary particles. (shrink)

Dialectical proof procedures in assumption-based argumentation are in general sound but not complete with respect to both the credulous and skeptical semantics (due to non-terminating loops). This raises the question of whether we could describe exactly what such procedures compute. In a previous paper, we introduce infinite arguments to represent possibly non-terminating computations and present dialectical proof procedures that are both sound and complete with respect to the credulous semantics of assumption-based argumentation with infinite arguments. In this paper, we study (...) whether and under what conditions dialectical proof procedures are both sound and complete with respect to the grounded semantics of assumption-based argumentation with infinite arguments. We introduce the class of ω-grounded and finitary-defensible argumentation frameworks and show that finitary assumption-based argumentation is ω-grounded and finitary-defensible. We then present dialectical procedures that are sound and complete wrt finitary assumption-based argumentation. (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.

The debate between critics of syntactic and semantic approaches to the formalization of scientific theories has been going on for over 50 years. I structure the debate in light of a recent exchange between Hans Halvorson, Clark Glymour, and Bas van Fraassen and argue that the only remaining disagreement concerns the alleged difference in the dependence of syntactic and semantic approaches on languages of predicate logic. This difference turns out to be illusory.

An axiomatic account of multiset theory is given, where multiplicities are of the same sort as sets. Various theories are proposed covering different existing multiset systems, as well as a stronger theory which is equiconsistent with Zermelo–Fraenkel set theory and with antifoundation. The inclusion relation receives a recursive definition in terms of membership and is shown to be not always antisymmetric.

The concept of truth arguably plays a central role in many areas of philosophical theorizing. Yet, what seems to be one of the most fundamental principles governing that concept, i.e. the equivalence between P and , is inconsistent in full classical logic, as shown by the semantic paradoxes. I propose a new solution to those paradoxes, based on a principled revision of classical logic. Technically, the key idea consists in the rejection of the unrestricted validity of the structural principle of (...) contraction. I first motivate philosophically this idea with the metaphysical picture of the states-of-affairs expressed by paradoxical sentences as being distinctively . I then proceed to demonstrate that the theory of truth resulting from this metaphysical picture is, in many philosophically interesting respects, surprisingly stronger than most other theories of truth endorsing the equivalence between P and (for example, the theory vindicates the validity of the traditional laws of excluded middle and of non-contradiction, and also vindicates the traditional constraint of truth preservation on logical consequence). I conclude by proving a cutelimination theorem that shows the consistency of the theory. (shrink)

This is a general philosophical paper where I overview some of my ideas concerning the non-reflexive foundations of quantum mechanics. By NRFQM I mean an interpretation of QM that considers an involved on- tology of non-individuals as explained in the text. Thus, I do not endorse a purely instrumentalist view of QM, but believe that it speaks of something, and then I try to show that one of the plausible views of this ‘something’ is as entities devoided of identity conditions.

This paper is the first part of an exploration into the logical properties of relative identity. After providing the semantic grounds for various monadic logics of relative identity, I define the minimal system and its nine extensions. It is suggested that despite their purely formal origin at least some of them may contain nontrivial philosophical insights. All logics are axiomatized by means of sound and complete sequent calculi. I show their affinities with existing formalizations.

Lambek categorial grammars is a class of formal grammars based on the Lambek calculus. Pentus proved in 1993 that they generate exactly the class of context-free languages without the empty word. In this paper, we study categorial grammars based on the Lambek calculus with the permutation rule LP. Of particular interest is the product-free fragment of LP called the Lambek-van Benthem calculus LBC. Buszkowski in his 1984 paper conjectured that grammars based on the Lambek-van Benthem calculus (LBC-grammars for short) generate (...) exactly permutation closures of context-free languages. In this paper, we disprove this conjecture by presenting a language generated by an LBC-grammar that is not a permutation closure of any context-free language. Firstly, we introduce an ad-hoc modification of vector addition systems called linearly-restricted branching vector addition systems with states and additional memory (LRBVASSAMs for short) and prove that the latter are equivalent to LBC-grammars. Then we construct an LRBVASSAM that generates a non-semilinear set and thus disprove Buszkowski’s conjecture. Since Buszkowski’s conjecture is false, not so much is known about the languages generated by LBC-grammars or by LP-grammars. The equivalence of LRBVASSAMs and LBC-grammars allows us to establish a number of their properties. We show that LP-grammars generate the same class of languages as LBC-grammars; that is, removing product from LP does not decrease expressive power of corresponding categorial grammars. We also prove that this class of languages is closed under union, intersection, concatenation, and Kleene plus. (shrink)

Besides their ordinary cardinal and proportional meanings, many and few have been argued to allow for a ‘reverse proportional’ reading. This reading has later been characterised in two opposite directions: Cohen’s reading where the proportion \ matters and Herburger’s where it does not. We develop a compositional analysis that derives the correct truth conditions for both characterisations of Westerståhl-style sentences while maintaining conservativity, assuming a standard syntax/semantics mapping and reducing their context-dependence to mechanisms independently needed for degree constructions in general. (...) In a nutshell, mirroring the decomposition of other degree expressions like tall, many is decomposed into the parametrized determiner many and the operator POS, where POS combines with a contextually salient comparison class C matching the alternatives triggered by some element X\ in the sentence. Non-reverse readings obtain when X\ is external to the original host NP and reverse readings when X\ is internal to the host NP. Cohen’s truth conditions for Westerståhl-style sentences are derived as a reverse proportional reading and Herburger’s interpretation as a sub-case of the non-reverse cardinal reading. (shrink)

We generalise the Blok–Jónsson account of structural consequence relations, later developed by Galatos, Tsinakis and other authors, in such a way as to naturally accommodate multiset consequence. While Blok and Jónsson admit, in place of sheer formulas, a wider range of syntactic units to be manipulated in deductions (including sequents or equations), these objects are invariablyaggregatedvia set-theoretical union. Our approach is more general in that nonidempotent forms of premiss and conclusion aggregation, including multiset sum and fuzzy set union, are considered. (...) In their abstract form, thus,deductive relationsare defined as additional compatible preorderings over certain partially ordered monoids. We investigate these relations using categorical methods and provide analogues of the main results obtained in the general theory of consequence relations. Then we focus on the driving example of multiset deductive relations, providing variations of the methods of matrix semantics and Hilbert systems in Abstract Algebraic Logic. (shrink)

Dave Ripley has recently argued against the plausibility of multiset consequence relations and of contraction-free approaches to paradox. For Ripley, who endorses a nontransitive theory, the best arguments that buttress transitivity also push for contraction—whence it is wiser for the substructural logician to go nontransitive from the start. One of Ripley’s allegations is especially insidious, since it assumes the form of a trivialisation result: it is shown that if a multiset consequence relation can be associated to a closure operator in (...) the expected way, then it necessarily contracts. We counter Ripley’s objection by presenting an approach to multiset consequence that escapes this trap. This approach is multiple-conclusioned in a heterodox way, for multiple succedents are given a conjunctive, rather than a disjunctive reading. Finally, we address a further objection by French and Ripley to the effect that the informational interpretation of sequents in linear logic does not motivate cut. (shrink)

We study the semantics of dialectical proof procedures. As dialectical proof procedures are in general sound but not complete wrt admissibility semantics, a natural question here is whether we could give a more precise semantical characterization of what they compute. Based on a new notion of infinite arguments representing loops, we introduce a stricter notion of admissibility, referred to as strict admissibility, and show that dialectical proof procedures are in general sound and complete wrt strict admissibility.

In the literature on self-referential paradoxes one of the hardest and most challenging problems is that of revenge. This problem can take many shapes, but, typically, it besets non-classical accounts of some semantic notion, such as truth, that depend on a set of classically defined meta-theoretic concepts, like validity, consistency, and so on. A particularly troubling form of revenge that has received a lot of attention lately involves the concept of validity. The difficulty lies in that the non-classical logician cannot (...) accept her own definition of validity because it is given in a classical meta-theory. It is often suggested that this mismatch between the consequence relation of the account being espoused and the consequence relation of the meta-theory is a serious embarrassment. The main goal of the paper is to explore whether certain substructural accounts of the paradoxes can avoid this sort of embarrassment. Typically, these accounts are expressively incomplete, since they cannot assert in the object language that certain invalid arguments are in fact invalid. To overcome this difficulty I develop a novel type of hybrid proof-procedure, one that takes invalidities to be just as fundamental as validities. I prove that this proof-procedure enjoys a number of interesting properties and I analyze the prospects of applying it to languages capable of expressing self-referential statements. (shrink)

In this paper, I consider the connection between consequence relations and closure operations. I argue that one familiar connection makes good sense of some usual applications of consequence relations, and that a largeish family of familiar noncontractive consequence relations cannot respect this familiar connection.

In the recent literature on proof-theoretic semantics, there is mention of a generality condition on defining rules. According to this condition, the schematic formulation of the defining rules must be maximally general, in the sense that no restrictions should be placed on the contexts of these rules. In particular, context variables must always be present in the schematic rules and they should range over arbitrary collections of formulae. I argue against imposing such a condition, by showing that it has undesirable (...) results and that it is ill-supported by the arguments brought in its favour. (shrink)