Variables

A variable binding term operator is an operator which binds variables of formulas to give origin to terms. Examples of vbtos are the description operator ι, Hilbert’s ε-symbol, the classifier { : }, and Russell’s abstraction operator ˆx1xˆ2 . . . xˆnF. It is usual to introduce vbtos by contextual definition, though their treatment in first- and higherorder languages as new primitive symbols, added to them, is more convenient, especially from the semantic point of view. A semantic approach to vbtos (...) in classical logic is contained in da Costa 1980 . In this note we outline how vbtos can be handled in some paraconsistent and paracomplete logics, precisely those logics of da Costa 1974 and da Costa and Marconi 1986. But our methods apply equally will to several other non-classical systems. Although in some particular cases, for instance in the case of the description operator in certain first-order languages, the contextual treatment of vbtos seems to be reasonable, we limit ourselves here to the semantic approach to these operators. In order to develop our semantic analysis, we combine the methods of da Costa 1980 with those of Alves 1984; in this last paper, a paraconsistent model theory is studied relative to da Costa’s predicate calculi with equality C = n , 1 ≤ n ≤ ω. (shrink)

We use a simple relational framework to develop the key notions and results on hidden variables and non-locality. The extensive literature on these topics in the foundations of quantum mechanics is couched in terms of probabilistic models, and properties such as locality and no-signalling are formulated probabilistically. We show that to a remarkable extent, the main structure of the theory, through the major No-Go theorems and beyond, survives intact under the replacement of probability distributions by mere relations.

Leibniz notoriously insisted that no two individuals differ solo numero, that is, by being primitively distinct, without differing in some property. The details of Leibniz’s own way of understanding and defending the principle –known as the principle of identity of indiscernibles (henceforth ‘the Principle’)—is a matter of much debate. However, in contemporary metaphysics an equally notorious and discussed issue relates to a case put forward by Max Black (1952) as a counter-example to any necessary and non-trivial version of the principle. (...) Black asks us to imagine, via one of the fictional characters of his dialogue, a world consisting solely of two completely resembling spheres, in a relational space. The supporter of the principle is then forced to admit that although there are ex hypothesi two objects in that universe, there is no property (except trivial ones), not even relational ones, to distinguish them, and hence the necessary version of the principle is falsified. In this essay I will argue that Black’s possible world, together with the dialectic between the potential friends and foes of the Principle as expounded by Black himself.. (shrink)

The epsilon calculus is a logical formalism developed by David Hilbert in the service of his program in the foundations of mathematics. The epsilon operator is a term-forming operator which replaces quantifiers in ordinary predicate logic. Specifically, in the calculus, a term εx A denotes some x satisfying A(x), if there is one. In Hilbert's Program, the epsilon terms play the role of ideal elements; the aim of Hilbert's finitistic consistency proofs is to give a procedure which removes such terms (...) from a formal proof. The procedures by which this is to be carried out are based on Hilbert's epsilon substitution method. The epsilon calculus, however, has applications in other contexts as well. The first general application of the epsilon calculus was in Hilbert's epsilon theorems, which in turn provide the basis for the first correct proof of Herbrand's theorem. More recently, variants of the epsilon operator have been applied in linguistics and linguistic philosophy to deal with anaphoric pronouns. (shrink)

This paper briefly traces the evolution of the function concept until its modern set theoretic definition, and then investigates its relationship to the pre-formal notion of variable dependence. I shall argue that the common association of pre-formal dependence with the modern function concept is misconceived, and that two different notions of dependence are actually involved in the classic and the modern viewpoints, namely effective and functional dependence. The former contains the latter, and seems to conform more to our pre-formal conception (...) of dependence. The idea of effective dependence is further investigated in connection with the notions of function content and intensionality. Finally, the relevance of the distinction between the two kinds of dependence to mathematical practice is considered. (shrink)

Classical logic counts sentences such as ‘Alice is identical with Alice’ as logically true. A standard objection to classical logic is that Alice’s self-identity, for instance, is not a matter of logic because the identity of particular objects is not a matter of logic. For this reason, many philosophers argue that classical logic is not the right logic, and that it should be abandoned in favour of free logic — logic free of existential commitments with respect to singular terms. In (...) most standard free logics, sentences such as ‘Alice is identical with Alice’ are not logically true. This paper argues that this objection from existential commitments is some- what superficial and that there is a deeper reason why ‘Alice is identical with Alice’ should not be considered a logical truth. Indeed, a key fundamental thought about the nature of logic is that a logical truth is true in virtue of its logical form. The fundamental problem I raise is that a sentence such as ‘Alice is identical with Alice’ appears to not even be true in virtue of its logical form. Thus this paper argues that given that such a sentence is not true in virtue of its logical form, it should not be counted as logically true. It moreover argues, on the same grounds, that even the sentences which free logicians regard as logically true shouldn’t be regarded as logically true. So in this sense free logic is no repair to classical logic. (shrink)

In this early paper I set out an argument in favor of the standard semantics of first-order logic, to the effect that (Vx)(Ey)x=y. Though my arguments from the paper have since been revised in details, The conclusion of the paper seems still viable and acceptable.

Recent literature contains influential arguments for variabilism, the view that we should understand proper names as analogues not of constants but of variables. In particular, proper names are said to sometimes take semantic values that are not referential but purely general. I present a counter-example to this view.

We are much better equipped to let the facts reveal themselves to us instead of blinding ourselves to them or stubbornly trying to force them into preconceived molds. We no longer embarrass ourselves in front of our students, for example, by insisting that “Some Xs are Y” means the same as “Some X is Y”, and lamely adding “for purposes of logic” whenever there is pushback. Logic teaching in this century can exploit the new spirit of objectivity, humility, clarity, observationalism, (...) contextualism, and pluralism. Besides the new spirit there have been quiet developments in logic and its history and philosophy that could radically improve logic teaching. One rather conspicuous example is that the process of refining logical terminology has been productive. Future logic students will no longer be burdened by obscure terminology and they will be able to read, think, talk, and write about logic in a more careful and more rewarding manner. Closely related is increased use and study of variable-enhanced natural language as in “Every proposition x that implies some proposition y that is false also implies some proposition z that is true”. Another welcome development is the culmination of the slow demise of logicism. No longer is the teacher blocked from using examples from arithmetic and algebra fearing that the students had been indoctrinated into thinking that every mathematical truth was a tautology and that every mathematical falsehood was a contradiction. A fifth welcome development is the separation of laws of logic from so-called logical truths, i.e., tautologies. Now we can teach the logical independence of the laws of excluded middle and non-contradiction without fear that students had been indoctrinated into thinking that every logical law was a tautology and that every falsehood of logic was a contradiction. This separation permits the logic teacher to apply logic in the clarification of laws of logic. This lecture expands the above points, which apply equally well in first, second, and third courses, i.e. in “critical thinking”, “deductive logic”, and “symbolic logic”. (shrink)

This paper discusses the history of the confusion and controversies over whether the definition of consequence presented in the 11-page 1936 Tarski consequence-definition paper is based on a monistic fixed-universe framework?like Begriffsschrift and Principia Mathematica. Monistic fixed-universe frameworks, common in pre-WWII logic, keep the range of the individual variables fixed as the class of all individuals. The contrary alternative is that the definition is predicated on a pluralistic multiple-universe framework?like the 1931 Gödel incompleteness paper. A pluralistic multiple-universe framework recognizes multiple (...) universes of discourse serving as different ranges of the individual variables in different interpretations?as in post-WWII model theory. In the early 1960s, many logicians?mistakenly, as we show?held the ?contrary alternative? that Tarski 1936 had already adopted a Gödel-type, pluralistic, multiple-universe framework. We explain that Tarski had not yet shifted out of the monistic, Frege?Russell, fixed-universe paradigm. We further argue that between his Principia-influenced pre-WWII Warsaw period and his model-theoretic post-WWII Berkeley period, Tarski's philosophy underwent many other radical changes. (shrink)

Drawing on Russell's substitutional theory, this paper examines the notion of ‘structured variable’, in order to compare Russell's and Tarski's conceptions of variables. The framework of syntactic fibrations, coming from categorical logic, is used as a common setting. The main objective of this paper is to make sense of the notion of structured variable beyond the context of Russell's theory, to question the Tarskian way of understanding what it is to be a possible value for a variable, and to bring (...) out semantically structured variables as a renewed and fruitful way of conceiving of logical structure. (shrink)

In The Principles of Mathematics, Russell writes: Whatever may be an object of thought, or may occur in any true or false proposition, or can be counted as one, I call a term. This, then, is the widest word in the philosophical vocabulary. I shall use as synonymous with it the words unit, individual and entity. The first two emphasize the fact that every term is one, while the third is derived from the fact that every term has being, i.e. (...) is in some sense. A man, a moment, a number, a class, a relation, a chimera, or anything else that can be mentioned, is sure to be a term'. Now in this remark, a certain extremely general, topic-neutral use of ‘object’ is singled out, a use in which the expression is treated as equivalent to (equally neutral) uses of ‘term’, ‘entity’, ‘unit’, ‘individual’, and ‘thing’. In addition, a claim is made to the effect that the content of the expression, with its emphasis on one, is such as to be adequate to comprehend the sum-total of existence, to include whatever there may be. The paper addresses the question of what this claim means, and whether it might be true. (shrink)

Safe first-order formulas generalize the concept of a safe rule, which plays an important role in the design of answer set solvers. We show that any safe sentence is equivalent, in a certain sense, to the result of its grounding—to the variable-free sentence obtained from it by replacing all quantifiers with multiple conjunctions and disjunctions. It follows that a safe sentence and the result of its grounding have the same stable models, and that stable models of a safe sentence can (...) be characterized by a formula of a simple syntactic form. (shrink)

In a series of recent works, Kit Fine, 605–631, 2003, 2007) has sketched a novel solution to Frege’s puzzle. Radically departing from previous solutions, Fine argues that Frege’s puzzle forces us to reject compositionality. In this paper we first provide an explicit formalization of the relational semantics for first-order logic suggested, but only briefly sketched, by Fine. We then show why the relational semantics alone is technically inadequate, forcing Fine to enrich the syntax with a coordination schema. Given this enrichment, (...) we argue, that that the semantics is compositional. We then examine the deep consequences of this result for Fine’s proposed solution to Frege’s puzzle. We argue that Fine has mis-diagnosed his own solution–his attempted solution does not deny compositionality. The correct characterization of Fine’s solution fits him more comfortably among familiar solutions to the puzzle. (shrink)

Kit Fine has reawakened a puzzle about variables with a long history in analytic philosophy, labeling it “the antinomy of the variable”. Fine suggests that the antinomy demands a reconceptualization of the role of variables in mathematics, natural language semantics, and first-order logic. The difficulty arises because: (i) the variables ‘x’ and ‘y’ cannot be synonymous, since they make different contributions when they jointly occur within a sentence, but (ii) there is a strong temptation to say that distinct variables ‘x’ (...) and ‘y’ are synonymous, since sentences differing by the total, proper substitution of ‘x’ for ‘y’ always agree in meaning. We offer a precise interpretation of the challenge posed by (i) and (ii). We then develop some neglected passages of Tarski to show that his semantics for variables has the resources to resolve the antinomy without abandoning standard compositional semantics. (shrink)

Montague and Kaplan began a revolution in semantics, which promised to explain how a univocal expression could make distinct truth-conditional contributions in its various occurrences. The idea was to treat context as a parameter at which a sentence is semantically evaluated. But the revolution has stalled. One salient problem comes from recurring demonstratives: "He is tall and he is not tall". For the sentence to be true at a context, each occurrence of the demonstrative must make a different truth-conditional contribution. (...) But this difference cannot be accounted for by standard parameter sensitivity. Semanticists, consoled by the thought that this ambiguity would ultimately be needed anyhow to explain anaphora, have been too content to posit massive ambiguities in demonstrative pronouns. This article aims to revived the parameter revolution by showing how to treat demonstrative pronouns as univocal while providing an account of anaphora that doesn't end up re-introducing the ambiguity. (shrink)

Kaplan (1989a) insists that natural languages do not contain displacing devices that operate on character—such displacing devices are called monsters. This thesis has recently faced various empirical challenges (e.g., Schlenker 2003; Anand and Nevins 2004). In this note, the thesis is challenged on grounds of a more theoretical nature. It is argued that the standard compositional semantics of variable binding employs monstrous operations. As a dramatic first example, Kaplan’s formal language, the Logic of Demonstratives, is shown to contain monsters. For (...) similar reasons, the orthodox lambda-calculus-based semantics for variable binding is argued to be monstrous. This technical point promises to provide some far-reaching implications for our understanding of semantic theory and content. The theoretical upshot of the discussion is at least threefold: (i) the Kaplanian thesis that “directly referential” terms are not shiftable/bindable is unmotivated, (ii) since monsters operate on something distinct from the assertoric content of their operands, we must distinguish ingredient sense from assertoric content (cf. Dummett 1973; Evans 1979; Stanley 1997), and (iii) since the case of variable binding provides a paradigm of semantic shift that differs from the other types, it is plausible to think that indexicals—which are standardly treated by means of the assignment function—might undergo the same kind of shift. (shrink)

The received view about meteorological predicates like ‘rain’ is that they carry an argument slot for a location which can be filled explicitly or implicitly. The view assumes that ‘rain’, in the absence of an explicit location, demands that the context provide a specific location. In an earlier article in this journal, I provided a counter-example, viz. a context in which ‘it is raining’ receives a location-indefinite interpretation. On the basis of that example, I argued that when there is tacit (...) references to a location, it takes place for pragmatic reasons and casts no light on the semantics of meteorological predicates. Since then, several authors have reanalysed the counter-example, so as to make it compatible with the standard view. I discuss those attempts and argue that my account is superior. (shrink)

The first part of this article (Sections 1–5) focuses on the classical notions of scope and binding and their formal foundations. It argues that once their semantic core is properly understood, it can be implemented in various different ways: with or without movement, with or without variables. The second part (Sections 6–12) takes up the empirical issues that have redrawn the map in the past two decades. It turns out that scope is not a primitive. Existential scope and distributive scope (...) have to be distinguished, leaving few if any run-of-the-mill quantifiers. Scope behavior is also not uniform. At least three classes of expressions emerge: indefinites, distributive universals, and counters. Likewise, the bound variable interpretation of pronouns is joined by co-variation with situations. As a result, the classical notions of scope and binding are likely to end up as building blocks in the varied mechanisms at work in “scope phenomena” and “binding phenomena”, and not as self-contained analyses of those phenomena. (shrink)

Combinatory logic (Curry and Feys 1958) is a “variable-free” alternative to the lambda calculus. The two have the same expressive power but build their expressions differently. “Variable-free” semantics is, more precisely, “free of variable binding”: it has no operation like abstraction that turns a free variable into a bound one; it uses combinators—operations on functions—instead. For the general linguistic motivation of this approach, see the works of Steedman, Szabolcsi, and Jacobson, among others. The standard view in linguistics is that reflexive (...) and personal pronouns are free variables that get bound by an antecedent through some coindexing mechanism. In variable free semantics the same task is performed by some combinator that identifies two arguments of the function it operates on (a duplicator). This combinator may be built into the lexical semantics of the pronoun, into that of the antecedent, or it may be a free-floating operation applicable to predicates or larger chunks of texts, i.e. a typeshifter. This note is concerned with the case of cross-sentential anaphora. It adopts Hepple’s and Jacobson’s interpretation of pronouns as identity maps and asks how this can be extended to the cross-sentential case, assuming the dynamic semantic view of anaphora. It first outlines the possibility of interpreting indefinites that antecede non-ccommanded pronouns as existential quantifiers enriched with a duplicator. Then it argues that it is preferable to use the duplicator as a type-shifter that applies “on the fly”. The proposal has consequences for two central ingredients of the classical dynamic semantic treatment: it does away with abstraction over assignments and with treating indefinites as inherently existentially quantified. However, cross-sentential anaphora remains a matter of binding, and the idea of propositions as context change potentials is retained. (shrink)

Current theories of grammar handle both extraction and anaphorization by introducing variables into syntactic representations. Combinatory categorial grammar eliminates variables corresponding to gaps. Using the combinator W, the paper extends this approach to anaphors, which appear to act as overt bound variables. [Slightly extended version in Bartsch et al 1989.].

This work gives an extended presentation of the treatment of variable-binding operators adumbrated in [3:1993d]. Illustrative examples include elementary languages with quantifiers and lambda-equipped categorial languages. Some remarks are also offered to illustrate the philosophical import of the resulting picture. Particularly, a certain conception of logic emerges from the account: the view that logics are true theories in the model-theoretic sense, i.e. the result of selecting a certain class of models as the only “admissible” interpretation structures (for a given language).

We investigate a variant of the variable convention proposed at Tractatus 5.53ff for the purpose of eliminating the identity sign from logical notation. The variant in question is what Hintikka has called the strongly exclusive interpretation of the variables, and turns out to be what Ramsey initially (and erroneously) took to be Wittgenstein's intended method. We provide a tableau calculus for this identity-free logic, together with soundness and completeness proofs, as well as a proof of mutual interpretability with first-order logic (...) with identity. (shrink)

We investigate a rst-order predicate logic based on Wittgenstein's suggestion to express identity of object by identity of sign, and difference of objects by difference of signs. Hintikka has shown that predicate logic can indeed be set up in such a way; we show that it can be done nicely. More specically, we provide a perspicuous cut-free sequent calculus, as well as a Hilbert-type calculus, for Wittgensteinian predicate logic and prove soundness and completeness theorems.

Wittgensteinian predicate logic (W-logic) is characterized by the requirement that the objects mentioned within the scope of a quantifier be excluded from the range of the associated bound variable. I present a sound and complete tableaux calculus for this logic and discuss issues of translatability between Wittgensteinian and standard predicate logic in languages with and without individual constants. A metalinguistic co-denotation predicate, akin to Frege’s triple bar of the Begriffsschrift, is introduced and used to bestow the full expressive power of (...) first-order logic with identity on W-logic in the presence of constants. (shrink)

I present a reconstruction of the logical system of the Tractatus, which differs from classical logic in two ways. It includes an account of Wittgenstein’s “form-series” device, which suffices to express some effectively generated countably infinite disjunctions. And its attendant notion of structure is relativized to the fixed underlying universe of what is named. -/- There follow three results. First, the class of concepts definable in the system is closed under finitary induction. Second, if the universe of objects is countably (...) infinite, then the property of being a tautology is \Pi^1_1-complete. But third, it is only granted the assumption of countability that the class of tautologies is \Sigma_1-definable in set theory. -/- Wittgenstein famously urges that logical relationships must show themselves in the structure of signs. He also urges that the size of the universe cannot be prejudged. The results of this paper indicate that there is no single way in which logical relationships could be held to make themselves manifest in signs, which does not prejudge the number of objects. (shrink)