Free Logic

We provide an application of a sequent calculus framework to the formalization of definite descriptions. It is a continuation of research undertaken in [20, 22]. In the present paper a so-called free description theory is examined in the context of different kinds of free logic, including systems applied in computer science and constructive mathematics for dealing with partial functions. It is shown that the same theory in different logics may be formalised by means of different rules and gives results of (...) varying strength. For all presented calculi a constructive cut elimination is provided. (shrink)

The search for the extensions of sentences can be guided by Frege’s “principle of compositionality of extension”, according to which the extension of a composed expression depends only on its logical form and the extensions of its parts capable of having extensions. By means of this principle, a strict criterion for the admissibility of objects as extensions of sentences can be derived: every object is admissible as the extension of a sentence that is preserved under the substitution of co-extensional expressions. (...) The question is: what are the extensions of elementary sentences containing empty singular terms, like ‘Vulcan rotates’. It can be demonstrated that in such sentences, states of affairs as structured objects (but not truth-values) are preserved under the substitution of co-extensional expressions. Hence, such states of affairs are admissible (while truth-values are not) as extensions of elementary sentences containing empty singular terms. (shrink)

This paper presents rules in sequent calculus for a binary quantifier I to formalise definite descriptions: Ix[F, G] means ‘The F is G’. The rules are suitable to be added to a system of positive free logic. The paper extends the proof of a cut elimination theorem for this system by Indrzejczak by proving the cases for the rules of I. There are also brief comparisons of the present approach to the more common one that formalises definite descriptions with a (...) term forming operator. In the final section rules for I for negative free and classical logic are also mentioned. (shrink)

This paper presents a sequent calculus and a dual domain semantics for a theory of definite descriptions in which these expressions are formalised in the context of complete sentences by a binary quantifier I. I forms a formula from two formulas. Ix[F, G] means ‘The F is G’. This approach has the advantage of incorporating scope distinctions directly into the notation. Cut elimination is proved for a system of classical positive free logic with I and it is shown to be (...) sound and complete for the semantics. The system has a number of novel features and is briefly compared to the usual approach of formalising ‘the F ’ by a term forming operator. It does not coincide with Hintikka’s and Lambert’s preferred theories, but the divergence is well-motivated and attractive. (shrink)

Linnebo and Shapiro have recently given an analysis of potential infinity using modal logic. A key technical component of their account is to show that under a suitable translation ◊ of nonmodal language into modal language, nonmodal sentences ϕ 1, …, ϕ n entail ψ just in case ϕ 1 ◊, …, ϕ n ◊ entail ψ ◊ in the modal logic S4.2. Linnebo and Shapiro establish this result in nonfree logic. In this note I argue that their analysis of (...) potential infinity should be carried out in a free logic. I then extend their key theorems to the setting of negative free logic. (shrink)

This paper presents rules of inference for a binary quantifier I for the formalisation of sentences containing definite descriptions within intuitionist positive free logic. I binds one variable and forms a formula from two formulas. Ix[F, G] means ‘The F is G’. The system is shown to have desirable proof-theoretic properties: it is proved that deductions in it can be brought into normal form. The discussion is rounded up by comparisons between the approach to the formalisation of definite descriptions recommended (...) here and the more usual approach that uses a term-forming operator ι, where ιxF means ‘the F’. (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)

This paper presents a way of formalising definite descriptions with a binary quantifier ι, where ιx[F, G] is read as ‘The F is G’. Introduction and elimination rules for ι in a system of intuitionist negative free logic are formulated. Procedures for removing maximal formulas of the form ιx[F, G] are given, and it is shown that deductions in the system can be brought into normal form.

Sentences containing definite descriptions, expressions of the form ‘The F’, can be formalised using a binary quantifier ι that forms a formula out of two predicates, where ιx[F, G] is read as ‘The F is G’. This is an innovation over the usual formalisation of definite descriptions with a term forming operator. The present paper compares the two approaches. After a brief overview of the system INFι of intuitionist negative free logic extended by such a quantifier, which was presented in (...) (Kürbis 2019), INFι is first compared to a system of Tennant’s and an axiomatic treatment of a term forming ι operator within intuitionist negative free logic. Both systems are shown to be equivalent to the subsystem of INFι in which the G of ιx[F, G] is restricted to identity. INFι is then compared to an intuitionist version of a system of Lambert’s which in addition to the term forming operator has an operator for predicate abstraction for indicating scope distinctions. The two systems will be shown to be equivalent through a translation between their respective languages. Advantages of the present approach over the alternatives are indicated in the discussion. (shrink)

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

Paul Oppenheimer and Edward Zalta's formalisation of Anselm's ontological argument for the existence of God is automated by embedding a free logic for definite descriptions within Isabelle/HOL.

Fregean theories of descriptions as terms have to deal with improper descriptions. To save bivalence various proposals have been made that involve assigning referents to improper descriptions. While bivalence is indeed saved, there is a price to be paid. Instantiations of the same general scheme, viz. the one and only individual that is F and G is G, are not only allowed but even required to have different truth values.

Halbach has argued that Tarski biconditionals are not ontologically conservative over classical logic, but his argument is undermined by the fact that he cannot include a theory of arithmetic, which functions as a theory of syntax. This article is an improvement on Halbach's argument. By adding the Tarski biconditionals to inclusive negative free logic and the universal closure of minimal arithmetic, which is by itself an ontologically neutral combination, one can prove that at least one thing exists. The result can (...) then be strengthened to the conclusion that infinitely many things exist. Those things are not just all Gödel codes of sentences but rather all natural numbers. Against this background inclusive negative free logic collapses into noninclusive free logic, which collapses into classical logic. The consequences for ontological deflationism with respect to truth are discussed. (shrink)

This dissertation develops an inferentialist theory of meaning. It takes as a starting point that the sense of a sentence is determined by the rules governing its use. In particular, there are two features of the use of a sentence that jointly determine its sense, the conditions under which it is coherent to assert that sentence and the conditions under which it is coherent to deny that sentence. From this starting point the dissertation develops a theory of quantification as marking (...) coherent ways a language can be expanded and modality as the means by which we can reflect on the norms governing the assertion and denial conditions of our language. If the view of quantification that is argued for is correct, then there is no tension between second-order quantification and nominalism. In particular, the ontological commitments one can incur through the use of a quantifier depend wholly on the ontological commitments one can incur through the use of atomic sentences. The dissertation concludes by applying the developed theory of meaning to the metaphysical issue of necessitism and contingentism. Two objections to a logic of contingentism are raised and addressed. The resulting logic is shown to meet all the requirement that the dissertation lays out for a theory of meaning for quantifiers and modal operators. (shrink)

I argue that neutral free logic and existence hedging are incompatible. Primarily, I respond to proposals by James Pryor intended to reconcile the two. Consideration of those proposals will reveal that on any neutral free logic either some existence hedges will entail some undesired existence claims, or they will not entail some desired existence claims.

The result of combining classical quantificational logic with modal logic proves necessitism – the claim that necessarily everything is necessarily identical to something. This problem is reflected in the purely quantificational theory by theorems such as ∃x t=x; it is a theorem, for example, that something is identical to Timothy Williamson. The standard way to avoid these consequences is to weaken the theory of quantification to a certain kind of free logic. However, it has often been noted that in order (...) to specify the truth conditions of certain sentences involving constants or variables that don’t denote, one has to apparently quantify over things that are not identical to anything. In this paper I defend a contingentist, non-Meinongian metaphysics within a positive free logic. I argue that although certain names and free variables do not actually refer to anything, in each case there might have been something they actually refer to, allowing one to interpret the contingentist claims without quantifying over mere possibilia. (shrink)

This paper asks which free logic a Fregean should adopt. It examines options within the tradition including Carnap’s (1956) chosen object theory, Lehmann’s (1994, 2002) strict Fregean free logic, Woodruff’s (1970) strong table about Boolean operators and Bencivenga’s (1986, 1991) supervaluational semantics. It argues for a neutral free logic in view of its proximity towards explaining natural languages. However, disagreeing with Lehmann, it claims a Fregean should adopt the strong table based on Frege’s discussion on generality. Supervaluation uses strong table (...) and aims to give it a semantic justification. However, supervaluation is in turn justified by convention or mental experiments, which Lehmann argues as inadequate. The paper proposes a new justification of supervaluation based on sense and two-dimensional semantics. The resulting model, coined Supervaluational Neutral Free Logic (SNFL), resolves many conflicts between Lehmann and Bencivenga while staying close with Frege’s discussions about non-denotation. It also provides new insights into the relations among truth, logical truth, and supervaluated truth (or supertruth, for short). (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)

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)

By a free logic is generally meant a variant of classical first-order logic in which constant terms may, under interpretation, fail to refer to individuals in the domain D over which the bound variables range, either because they do not refer at all or because they refer to individuals outside D. If D is identified with what is assumed by the given interpretation to exist, in accord with Quine’s dictum that “to be is to be the value of a [bound] (...) variable,” then a free variation on classical semantics does not require that all constant terms refer to existents, and in this sense such terms lack existential import. (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)

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)

Two subject-predicate calculi with equality,SP = and its extensionUSP =, are presented as systems of natural deduction. Both the calculi are systems of free logic. Their presentation is preceded by an intuitive motivation.It is shown that Aristotle's syllogistics without the laws of identitySaP andSiP is definable withinSP =, and that the first-order predicate logic is definable withinUSP =.

IPC, the intuitionistic predicate calculus, has the property(i) Vc(A c /x) xA.Furthermore, for certain important , IPC has the converse property (ii) xA Vc(A c /x). (i) may be given up in various ways, corresponding to different philosophic intuitions and yielding different systems of intuitionistic free logic. The present paper proves the strong completeness of several of these with respect to Kripke style semantics. It also shows that giving up (i) need not force us to abandon the analogue of (ii).

Starting from a generalization of the standard axioms for a monoid we present a stepwise development of various, mutually equivalent foundational axiom systems for category theory. Our axiom sets have been formalized in the Isabelle/HOL interactive proof assistant, and this formalization utilizes a semantically correct embedding of free logic in classical higher-order logic. The modeling and formal analysis of our axiom sets has been significantly supported by series of experiments with automated reasoning tools integrated with Isabelle/HOL. We also address the (...) relation of our axiom systems to alternative proposals from the literature, including an axiom set proposed by Freyd and Scedrov for which we reveal a technical issue (when encoded in free logic where free variables range over defined and undefined objects): either all operations, e.g. morphism composition, are total or their axiom system is inconsistent. The repair for this problem is quite straightforward, however. (shrink)