Empty individual expressions are needed to reconstruct the actual use of scientific language as well as to make logic free from existence assumptions. According to Quine, a language must be extensional to be adequate for the purposes of science. By means of Lambert's non-extensionality argument it can be demonstrated that a language containing empty individual expressions cannot be extensional as long as truth-values are the extensions of sentences. This book investigates the soundness of Lambert's argument and examines the question of (...) whether and how extensionality of a language for free logic can be secured. To achieve these aims, the notion of extensionality is thoroughly analyzed and two new semantic approaches to free logic are developed in which states of affairs, but not truth-values, are the extensions of sentences. These two semantic approaches are defended against the slingshot argument. In this way, two possible solutions to the problem of extensionality arise which use non-existent objects in two different ways: whereas in dual domain semantics non-existent objects serve as referents of empty singular terms, in single domain semantics they serve as hole marker objects that mark the holes in states of affairs where an object is missing due to an irreferental individual expression. (shrink)

The partial structures approach has two major components: a broad notion of structure (partial structure) and a weak notion of truth (quasi-truth). In this paper, we discuss the relationship between this approach and free logic. We also compare the model-theoretic analysis supplied by partial structures with the method of supervaluations, which was initially introduced as a technique to provide a semantic analysis of free logic. We then combine the three formal frameworks (partial structures, free logic and supervaluations), and apply the (...) resulting approach to accommodate semantic paradoxes. (shrink)

In the following the details of a state-of-affairs semantics for positive free logic are worked out, based on the models of common inner domain - outer domain semantics. Lambert's PFL system is proven to be weakly adequate (i.e., sound and complete) with respect to that semantics by demonstrating that the concept of logical truth definable therein coincides with that one of common truth-value semantics for PFL. Furthermore, this state-of-affairs semantics resists the challenges stemming from the slingshot argument since logically equivalent (...) statements do not always have the same extension according to it. Finally, it is argued that in such a semantics all statements of a certain language for PFL are state-of-affairs-related extensional as well as salva extensione extensional, even though their salva veritate extensionality fails. (shrink)

If one takes seriously the idea that a scientific language must be extensional, and accepts Quine’s notion of truth-value-related extensionality, and also recognizes that a scientific language must allow for singular terms that do not refer to existing objects, then there is a problem, since this combination of assumptions must be inconsistent. I will argue for a particular solution to the problem, namely, changing what is meant by the word ‘extensionality’, so that it would not be the truth-value that had (...) to be preserved under the substitution of co-extensional expressions, but the state of affairs that the sentence described. The question is whether or not elementary sentences containing empty singular terms, such as ‘Vulcan rotates’, are extensional in the substitutivity sense. Five conditions are specified under which extensionality in the substitutivity sense of such sentences can be secured. It is demonstrated that such sentences are state-of-affairs-as-extension-related extensional. This implies that such sentences are also truth-value-related extensional in Quine’s sense, but not truth-value-as-extension-related extensional. (shrink)

A free logic is one in which a singular term can fail to refer to an existent object, for example, `Vulcan' or `5/0'. This essay demonstrates the fruitfulness of a version of this non-classical logic of terms (negative free logic) by showing (1) how it can be used not only to repair a looming inconsistency in Quine's theory of predication, the most influential semantical theory in contemporary philosophical logic, but also (2) how Beeson, Farmer and Feferman, among others, use it (...) to provide a natural foundation for partial functions in programming languages. Vis à vis (2), the question is raised whether the Beeson-Farmer-Feferman approach is adequate to the treatment of partial functions in all programming languages. Gumb and the author say No, and suggest a way of handling the refractory cases by means of positive free logic. Finally, Antonelli's solution of a problem associated with the Gumb-Lambert proposal is mentioned. (shrink)

The logic of partial terms (LPT) is a variety of negative free logic in which functions, as well as predicates, are strict. A companion paper focused on nonconstructive LPTwith definite descriptions, called LPD, and laid the foundation for tableaux systems by defining the concept of an LPDmodel system and establishing Hintikka's Lemma, from which the strong completeness of the corresponding tableaux system readily follows. The present paper utilizes the tableaux system in establishing an Extended Joint Consistency Theorem for LPDthat incorporates (...) the Robinson Joint Consistency Theorem and the Craig-Lyndon Interpolation Lemma. The method of proof is similar to that originally used in establishing the Extended Joint Consistency Theorem for positive free logic. Proof of the Craig-Lyndon Interpolation Lemma for formulas possibly having free variables is readily had in LPTand its intuitionistic counterpart. The paper concludes with a brief discussion of the theory of definitions in LPD. (shrink)

This article presents a sequent calculus for a negative free logic with identity, called N . The main theorem (in part 1) is the admissibility of the Cut-rule. The second part of this essay is devoted to proofs of soundness, compactness and completeness of N relative to a standard semantics for negative free logic.

We seek means of distinguishing logical knowledge from other kinds of knowledge, especially mathematics. The attempt is restricted to classical two-valued logic and assumes that the basic notion in logic is the proposition. First, we explain the distinction between the parts and the moments of a whole, and theories of ?sortal terms?, two theories that will feature prominently. Second, we propose that logic comprises four ?momental sectors?: the propositional and the functional calculi, the calculus of asserted propositions, and rules for (...) (in)valid deduction, inference or substitution. Third, we elaborate on two neglected features of logic: the various modes of negating some part(s) of a proposition R, not only its ?external? negation not-R; and the assertion of R in the pair of propositions ?it is (un)true that R? belonging to the neglected logic of asserted propositions, which is usually left unstated. We also address the overlooked task of testing the asserted truth-value of R. Fourth, we locate logic among other foundational studies: set theory and other theories of collections, metamathematics, axiomatisation, definitions, model theory, and abstract and operator algebras. Fifth, we test this characterisation in two important contexts: the formulation of some logical paradoxes, especially the propositional ones; and indirect proof-methods, especially that by contradiction. The outcomes differ for asserted propositions from those for unasserted ones. Finally, we reflect upon self-referring self-reference, and on the relationships between logical and mathematical knowledge. A subject index is appended. (shrink)

Questions of definedness are ubiquitous in mathematics. Informally, these involve reasoning about expressions which may or may not have a value. This paper surveys work on logics in which such reasoning can be carried out directly, especially in computational contexts. It begins with a general logic of partial terms, continues with partial combinatory and lambda calculi, and concludes with an expressively rich theory of partial functions and polymorphic types, where termination of functional programs can be established in a natural way.

Partial functions are ubiquitous in both mathematics and computer science. Therefore, it is imperative that the underlying logical formalism for a general-purpose mechanized mathematics system provide strong support for reasoning about partial functions. Unfortunately, the common logical formalisms — first-order logic, type theory, and set theory — are usually only adequate for reasoning about partial functionsin theory. However, the approach to partial functions traditionally employed by mathematicians is quite adequatein practice. This paper shows how the traditional approach to partial functions (...) can be formalized in a range of formalisms that includes first-order logic, simple type theory, and Von-Neumann—Bernays—Gödel set theory. It argues that these new formalisms allow one to directly reason about partial functions; are based on natural, well-understood, familiar principles; and can be effectively implemented in mechanized mathematics systems. (shrink)

Are there nonexistent objects, i.e., objects that do not exist? Some examples often cited are: Zeus, Pegasus, Sherlock Holmes, Vulcan (the hypothetical planet postulated by the 19th century astronomer Le Verrier), the perpetual motion machine, the golden mountain, the fountain of youth, the round square, etc. Some important philosophers have thought that the very concept of a nonexistent object is contradictory (Hume) or logically ill-formed (Kant, Frege), while others (Leibniz, Meinong, the Russell of Principles of Mathematics) have embraced it wholeheartedly. (...) This entry is an examination of the many questions which arise in connection with the view that there are nonexistent objects. The following are particularly salient: What reasons are there (if any) for thinking that there are nonexistent objects? If there are nonexistent objects, then what kind of objects are they? How can they be characterized? Is it possible to provide a consistent theory of nonexistent objects? What is the explanatory force of a consistent theory of nonexistent objects (if such a thing is possible)? (shrink)

On the one hand, logic has (or ought to have) nothing to do with metaphysics; it ought to have nothing to do with questions concerning what there is, or whether there is anything at all. On the other hand, metaphysics can hardly get off the ground without the help of logical analysis; to be is to be a truth-maker, and the search for truth-makers requires that we lay open the logical structure of our language. So something’s gotta give: either logical (...) analysis is metaphysically biased, or metaphysicians must make up their mind before resorting to logical analysis. Or both. (shrink)

Free logics aim at freeing logic from existence assumptions by making them explicit, e.g., by adding an existence premisse to the antecedence of the classical axiom-schema of Universal Instantiation. Their historical development was motivated by the problem of empty singular terms, and that one of simple statements containing at least one such singular term: what is the referential status of such singular terms and what truth-value, if any, do such statemants have? Free logics can be classified with regard to their (...) respective answers to these problems. Negative free logics assume that non-existent objects cannot have any properties at all; hence, in particular, they cannot be self-identical or rotate. Positive free logics believe that non-existents can be self-identical according to the Leibnizian concept of identity. Neutral free logics think that statements of self-identity are truth-valueless because of the Fregean principle of compositionality. Since only in negative free logic, but not in positive free logic, two statements of the forms "a = a" and "E!a" are logically equivalent, one also can define only for NFL, but not for PFL, existence by self-identity. (shrink)