Chapin reviewed this 1972 ZEITSCHRIFT paper that proves the completeness theorem for the logic of variable-binding-term operators created by Corcoran and his student John Herring in the 1971 LOGIQUE ET ANALYSE paper in which the theorem was conjectured. This leveraging proof extends completeness of ordinary first-order logic to the extension with vbtos. Newton da Costa independently proved the same theorem about the same time using a Henkin-type proof. This 1972 paper builds on the 1971 “Notes on a Semantic (...) Analysis of Variable Binding Term Operators” (Co-author John Herring), Logique et Analyse 55, 646–57. MR0307874 (46 #6989). A variable binding term operator (vbto) is a non-logical constant, say v, which combines with a variable y and a formula F containing y free to form a term (vy:F) whose free variables are exact ly those of F, excluding y. Kalish-Montague 1964 proposed using vbtos to formalize definite descriptions “the x: x+x=2”, set abstracts {x: F}, minimization in recursive function theory “the least x: x+x>2”, etc. However, they gave no semantics for vbtos. Hatcher 1968 gave a semantics but one that has flaws described in the 1971 paper and admitted by Hatcher. In 1971 we give a correct semantic analysis of vbtos. We also give axioms for using them in deductions. And we conjecture strong completeness for the deductions with respect to the semantics. The conjecture, proved in this paper with Hatcher’s help, was proved independently about the same time by Newton da Costa. (shrink)

This paper investigates the analysis of the de re/de dicto distinction and related facts. I start with the assumption, supported by Cresswell 1990, that the evaluation of the truth of a proposition relative to a particular possible world/situation is mediated via the presence in the syntax of a silent pronoun with type-s denotation. In this system, the de re/de dicto distinction arises from a difference in which an operator binds a given situation pronoun. Percus 2000 shows that such a system (...) potentially overgenerates, in that a third type of reading is predicted to exist for sentences which actually have only two: de re and de dicto. Percus proposes constraints on the binding of situation pronouns, which correctly rule out these third readings. This paper shows, however, that extrinsic constraints on the binding of situation pronouns are not necessary to rule out the unwanted readings, as long as we develop a more precise theory of binding in the first place. I adapt the binding operator argued for by Büring 2004, originally developed only for overt pronouns, and show that when used as an operator for situation pronouns, the unwanted readings are not predicted to occur. (shrink)

Theabstract variable binding calculus (VB-calculus) provides a formal frame-work encompassing such diverse variable-binding phenomena as lambda abstraction, Riemann integration, existential and universal quantification (in both classical and nonclassical logic), and various notions of generalized quantification that have been studied in abstract model theory. All axioms of the VB-calculus are in the form of equations, but like the lambda calculus it is not a true equational theory since substitution of terms for variables is restricted. A similar problem (...) with the standard formalism of the first-order predicate logic led to the development of the theory of cylindric and polyadic Boolean algebras. We take the same course here and introduce the variety of polyadic VB-algebras as a pure equational form of the VB-calculus. In one of the main results of the paper we show that every locally finite polyadic VB-algebra of infinite dimension is isomorphic to a functional polyadic VB-algebra that is obtained from a model of the VB-calculus by a natural coordinatization process. This theorem is a generalization of the functional representation theorem for polyadic Boolean algebras given by P. Halmos. As an application of this theorem we present a strong completeness theorem for the VB-calculus. More precisely, we prove that, for every VB-theory T that is obtained by adjoining new equations to the axioms of the VB-calculus, there exists a model D such that T s=t iff D s=t. This result specializes to a completeness theorem for a number of familiar systems that can be formalized as VB-calculi. For example, the lambda calculus, the classical first-order predicate calculus, the theory of the generalized quantifierexists uncountably many and a fragment of Riemann integration. (shrink)

-/- A variable binding term operator (vbto) is a non-logical constant, say v, which combines with a variable y and a formula F containing y free to form a term (vy:F) whose free variables are exact ly those of F, excluding y. -/- Kalish-Montague proposed using vbtos to formalize definite descriptions, set abstracts {x: F}, minimalization in recursive function theory, etc. However, they gave no sematics for vbtos. Hatcher gave a semantics but one that has flaws. We (...) give a correct semantic analysis of vbtos. We also give axioms for using them in deductions. And we conjecture strong completeness for the deductions with respect to the semantics. The conjecture was later proved independently by the authors and by Newton da Costa. -/- The expression (vy:F) is called a variable bound term (vbt). In case F has only y free, (vy:F) has the syntactic propreties of an individual constant; and under a suitable interpretation of the language vy:F) denotes an individual. By a semantic analysis of vbtos we mean a proposal for amending the standard notions of (1) "an interpretation o f a first -order language" and (2) " the denotation of a term under an interpretation and an assignment", such that (1') an interpretation o f a first -order language associates a set-theoretic structure with each vbto and (2') under any interpretation and assignment each vb t denotes an individual. (shrink)

ABSTRACT Quine insisted that the satisfaction of an open modalised formula by an object depends on how that object is described. Kripke's ‘objectual’ interpretation of quantified modal logic, whereby variables are rigid, is commonly thought to avoid these Quinean worries. Yet there remain residual Quinean worries for epistemic modality. Theorists have recently been toying with assignment-shifting treatments of epistemic contexts. On such views an epistemic operator ends up binding all the variables in its scope. One might worry that this (...) yields the undesirable result that any attempt to ‘quantify in’ to an epistemic environment is blocked. If quantifying into the relevant constructions is vacuous, then such views would seem hopelessly misguided and empirically inadequate. But a famous alternative to Kripke's semantics, namely Lewis' counterpart semantics, also faces this worry since it also treats the boxes and diamonds as assignment-shifting devices. As I'll demonstrate, the mere fact that a variable is bound is no obstacle to binding it. This provides a helpful lesson for those modelling de re epistemic contexts with assignment sensitivity, and perhaps leads the way toward the proper treatment of binding in both metaphysical and epistemic contexts: Kripke for metaphysical modality, Lewis for epistemic modality. (shrink)

The general theory of variable binding term operators is an interesting recent development in logic. It opens up a rich class of semantic and model-theoretic problems. In this paper we survey the recent literature on the topic, and offer some remarks on its significances and on its connections with other branches of mathematical logic.

o (2000), 243). In particular, the idea is that binding interactions between the relevant expressions and natural lan- guage quantifiers are best explained by the hypothesis that those expressions harbor hidden but bindable variables. Recently, however, Herman Cappelen and Ernie Lepore have rejected such binding arguments for the presence of hid- den variables on the grounds that they overgeneralize — that, if sound, such arguments would establish the presence of hidden variables in all sorts of ex- pressions where (...) it is implausible that they exist (Cappelen and Lepore (2005), Cappelen and Lepore (2002)).1 In what follows we respond to Cappelen’s and Lepore’s attempted reductio by bringing out crucial disanalogies between cases where the binding argument is successful and cases where it is not. But we have a deeper purpose than merely to respond to Cappelen and Lepore: we think the attempted reductio goes wrong by not taking sufficiently seriously the nature of the binding relation that holds between quantifiers and arguments/variables, and that our criticism will serve to highlight the nature and importance of this relation. (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)

Human agents draw a variety of inferences effortlessly, spontaneously, and with remarkable efficiency – as though these inferences were a reflexive response of their cognitive apparatus. Furthermore, these inferences are drawn with reference to a large body of background knowledge. This remarkable human ability seems paradoxical given the complexity of reasoning reported by researchers in artificial intelligence. It also poses a challenge for cognitive science and computational neuroscience: How can a system of simple and slow neuronlike elements represent a large (...) body of systemic knowledge and perform a range of inferences with such speed? We describe a computational model that takes a step toward addressing the cognitive science challenge and resolving the artificial intelligence paradox. We show how a connectionist network can encode millions of facts and rules involving n-ary predicates and variables and perform a class of inferences in a few hundred milliseconds. Efficient reasoning requires the rapid representation and propagation of dynamic bindings. Our model (which we refer to as SHRUTI) achieves this by representing (1) dynamic bindings as the synchronous firing of appropriate nodes, (2) rules as interconnection patterns that direct the propagation of rhythmic activity, and (3) long-term facts as temporal pattern-matching subnetworks. The model is consistent with recent neurophysiological evidence that synchronous activity occurs in the brain and may play a representational role in neural information processing. The model also makes specific psychologically significant predictions about the nature of reflexive reasoning. It identifies constraints on the form of rules that may participate in such reasoning and relates the capacity of the working memory underlying reflexive reasoning to biological parameters such as the lowest frequency at which nodes can sustain synchronous oscillations and the coarseness of synchronization. (shrink)

In this paper, we defend a traditional approach to semantics, that holds that the outputs of compositional semantics are propositional, i.e. truth conditions. Though traditional, this view has been challenged on a number of fronts over the years. Since classic work of Lewis, arguments have been offered which purport to show that semantic composition requires values that are relativized, e.g. to times, or other parameters that render them no longer propositional. Focusing in recent variants of these arguments involving quantification and (...) binding, we argue that a correct understanding of how composition works gives no reason to relativize semantic values, and that propositional semantic values are in fact the preferred option. We take our argument to be mainly empirical, but along the way, we defend some more general theses. Simple propositional semantic values are viable in composition, we maintain, because composition is itself a complex phenomenon, involving multiple modes of composition. Furthermore, some composition principles make adjustments to the meanings of constituents in the course of composition. These adjustments are by triggered syntactic environments. We argue such small contributions of meaning from syntactic structure are acceptable. (shrink)

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). (shrink)

The Montagovian hypothesis of direct model-theoretic interpretation of syntactic surface structures is supported by an account of the semantics of binding that makes no use of variables, syntactic indices, or assignment functions & shows that the interpretation of a large portion of so-called variable-binding phenomena can dispense with the level of logical form without incurring equivalent complexity elsewhere in the system. Variable-free semantics hypothesizes local interpretation of each surface constituent; binding is formalized as a type-shifting (...) operation on expressions that denote functions, & sentences containing a free pronoun are analyzed as a function from individuals to propositions having a meaning of type (e,t). Standard weak crossover effects & binding patterns in sentences with multiple pronouns are shown to submit to straightforward type-theoretic treatments that do not rely on indexation. The variable-free semantics smoothly implements full surface compositionality & requires less machinery than standard accounts to handle functional questions, their answers, sloppy inferences, & across-the-board binding. 73 References. J. Hitchcock. (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.].

Since Kaplan’s "Demonstratives", it has become a common-place to distinguish between the character and content of an expression, where the content of an expression is what it contributes to "what is said" by sentences containing that expression, and the character gives a rule for determining, in a context, the content of an expression. A tacit assumption of theories of character has been that character is autonomous from content – that semantic evaluation starts with character, adds context, and then derives content. (...) One consequence of this autonomy thesis is that the rules for character can contain no variables bound by content-level operators elsewhere in the sentence. Tacit appeal to this consequence features essentially both in Jason Stanley’s recent argument that all contextual ambiguity must be linked to "elements in the actual syntactic structure of the sentence uttered" in his "Context and Logical Form" and in my arguments against character-based theories of complex demonstratives in my "Complex Demonstratives". However, I argue here that the autonomy thesis is unmotivated, and show that we can separate Kaplan’s notion of character into two independent components: an aspect of meaning which is context-sensitive, and an aspect of meaning that is exempted from scopal interactions with other operators. The resulting semantic framework allows constructions similar to Kaplan’s rejected notion of "monsters begat by elegance", but which are both more empirically adequate and more theoretically versatile. Having made the distinction between context-sensitivity and autonomy from scopal interaction, I show how it allows binding into the character of expressions and hence undermines the immediate success of both Stanley’s argument and my former argument against character-based theories of complex demonstratives, and discuss briefly the prospects for reinstating modified versions of those arguments. Finally, I show how that same distinction allows a defusing of Kripke’s modal argument against a descriptive theory of names. Once autonomy from semantic interaction is separated from context-sensitivity, the first of those two alone can be used to capture the modal rigidity of proper names.. (shrink)

A new formalism for predicate logic is introduced, with a non-standard method of binding variables, which allows a compositional formalization of certain anaphoric constructions, including donkey sentences and cross-sentential anaphora. A proof system in natural deduction format is provided, and the formalism is compared with other accounts of this type of anaphora, in particular Dynamic Predicate Logic.

The facts aboutsuch, then, indicate not just thatsuch is a pro-adjective, but also that binding conditions apply broadly to pro-ADJs and pro-CNs, as well as to a wide range of pro-arguments. If this is true, the CN binding process accomplished by rules (40) and (41) might better be expressed in a system that uses a Cooper (1979) store mechanism. In fact, Stump (p. 144) notes that this could easily be done. Meanings of the type of∨ P n could (...) be stored, just as NP meanings are, until an appropriate binding CN phrase was encountered. Binding conditions would simply require that a∨ P n meaning not come out of storage until the derivation had emerged from its governing category. The behavior of the pro-adjectivesuch suggests that an expression of any category, if it is legitimately translatable as a variable, may be a fullfledged proform; many principles and mechanisms described to account for the widely studied pronouns in fact apply to nonargument categories. (shrink)

Expressions such as English himself are interpreted as locally bound anaphors in certain syntactic environments and are exempt from the binding conditions in others. This article provides a unified semantics for himself in both of these uses. Their difference is reduced to the interaction with the syntactic environment. The semantics is based on an extension of the treatment of pronominals in variable-free semantics. The adoption of variable free semantics is inspired by the existence of proxy-readings, which motivate (...) an analysis based on Skolem functions. It is explained why certain anaphor types allow proxy-readings whereas others do not. (shrink)

We are used to the idea that computers operate on numbers, yet another kind of data is equally important: the syntax of formal languages, with variables, binding, and alpha-equivalence. The original application of nominal techniques, and the one with greatest prominence in this paper, is to reasoning on formal syntax with variables and binding. Variables can be modelled in many ways: for instance as numbers (since we usually take countably many of them); as links (since they may `point' (...) to a binding site in the term, where they are bound); or as functions (since they often, though not always, represent `an unknown'). None of these models is perfect. In every case for the models above, problems arise when trying to use them as a basis for a fully formal mechanical treatment of formal language. The problems are practical—but their underlying cause may be mathematical. The issue is not whether formal syntax exists, since clearly it does, so much as what kind of mathematical structure it is. To illustrate this point by a parody, logical derivations can be modelled using a Gödel encoding (i.e., injected into the natural numbers). It would be false to conclude from this that proof-theory is a branch of number theory and can be understood in terms of, say, Peano's axioms. Similarly, as it turns out, it is false to conclude from the fact that variables can be encoded e.g., as numbers, that the theory of syntax-with-binding can be understood in terms of the theory of syntax-without-binding, plus the theory of numbers (or, taking this to a logical extreme, purely in terms of the theory of numbers). It cannot; something else is going on. What that something else is, has not yet been fully understood. In nominal techniques, variables are an instance of names, and names are data. We model names using urelemente with properties that, pleasingly enough, turn out to have been investigated by Fraenkel and Mostowski in the first half of the 20th century for a completely different purpose than modelling formal language. What makes this model really interesting is that it gives names distinctive properties which can be related to useful logic and programming principles for formal syntax. Since the initial publications, advances in the mathematics and presentation have been introduced piecemeal in the literature. This paper provides in a single accessible document an updated development of the foundations of nominal techniques. This gives the reader easy access to updated results and new proofs which they would otherwise have to search across two or more papers to find, and full proofs that in other publications may have been elided. We also include some new material not appearing elsewhere. (shrink)

In this paper I inquire into the methodological status of one of the arguments that have figured prominently in contemporary debates about the semantics of a variety of expressions, the so-called “Binding Argument”. My inquiry is limited to the case of meteorological sentences like “It is raining”, but my conclusion can be extended to other types of sentences as well. Following Jason Stanley, I distinguish between three interpretations of the argument. My focus is on the third, weakest interpretation, according (...) to which postulating variables for locations in the logical form of meteorological sentences is the best available explanation of the binding phenomena that such sentences give rise to. My aim is to show that even in this weak interpretation, the argument cannot be reasonably taken to hold. I accomplish this by showcasing several alternative ways to account for the binding data that have not been, as of yet, ruled out as flawed. (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)

In this paper I assume that syntactic structures contain items that function as variables over possible worlds (or things like possible worlds). I show that in certain syntactic positions we can use some variables but not other. I accordingly motivate a "binding theory" for the items that occupy these positions, and I discuss some consequences of this binding theory.

It has long been assumed in linguistics that bound variable interpretations of pronouns are possible (only) when a quantified expression c‐commands the pronoun. In two studies in which readers' eye movements were recorded, we examined the processing of pronouns bound by universal quantifiers. Experiment 1 compared examples where the quantifier c‐commands the pronoun (‘Every British soldier thought he killed an enemy soldier’) with examples where it doesn't (‘Every British soldier aimed and then he killed an enemy soldier’). Although there (...) were no first pass differences, re‐reading time showed that both quantifier examples took longer to read than nonquantified controls (‘The old British soldier…’), but there was no special penalty in examples when the quantifier failed to c‐command the pronoun. Experiment 2 investigated intersentential binding (telescoping): ‘John Frederick/Each executive/Every executive went home. He broiled a steak. He ate dinner. Then he watched television.’ Second pass and total reading times in the region containing the first pronoun were longer for quantified examples than name examples. But there was no indication that telescoping is tightly restricted, for example, to contexts with ‘each’ or to discourses describing stereotypical events composed of predictable subevents. The results suggest that bound variable interpretations are more generally and more readily available than is often assumed. They fit well with Bosch's (1983) attempt to limit pronoun occurrences to just two types: anaphoric referential pronouns and syntactic agreement pronouns. On this view, ‘bound variable’ interpretations without c‐command are really anaphoric pronouns with inferred antecedents. This view is discussed along with the challenges it faces. (shrink)

This paper develops a framework for TAG (Tree Adjoining Grammar) semantics that brings together ideas from different recent approaches. Then, within this framework, an analysis of scope is proposed that accounts for the different scopal properties of quantifiers, adverbs, raising verbs and attitude verbs. Finally, including situation variables in the semantics, different situation binding possibilities are derived for different types of quantificational elements.

Potts et seq. presents an analysis of gap-containing supplements where the gap is modelled as a variable over the semantic type of the constituent that the as-clause adjoins to. This much allows the meaning of the gap to be resolved purely compositionally, by defining as as a function that allows the anchor to bind the gap variable. This article presents a class of as-clauses where Potts’s analysis seems to break down, in that the gap cannot be modelled as (...) a variable over the semantic type of the anchor. I propose that these cases can be unified with those in Potts’s work, as well as a larger class of ellipsis phenomena, by assuming that, under certain conditions, surface gaps are composite entities, containing a bound variable and a free variable that are resolved independently of each other. The bound variable is bound by the anchor, and the free variable is resolved by anaphora to a salient discourse object. (shrink)

Some natural language expressions –namely, determiners like every, some, most, etc.— introduce quantification over individuals (or, in other words, they express relations between sets of individuals). For example, the truth conditions of a sentence like (1a) are represented in Predicate Logic (PrL) by binding the..

Uncontroversially, the semantic interpretation of comparative adjectives such as rich or small depends, among other factors, on a contextually salient comparison standard. Two alternative theories have been proposed in order to account for such contextual dependence: an indexicalist view, according to which comparative adjectives are indexical expressions, and a hidden variable approach, which insists that a comparison standard is contributed as the semantic value of a variable occurring at the level of semantic representation. In this paper, I defend (...) the indexicalist view against an influential argument favoring the hidden variable approach, the so-called argument from binding. I argue that independent evidence favors an understanding of comparison standards as functions, and that on such a conception of comparison standards the evidence put forth by the argument from binding is naturally accountable within an indexicalist treatment. (shrink)

The principle of compositionality requires that the meaning of a complex expression remains the same after substitution of synonymous expressions. Alleged counterexamples to compositionality seem to force a theoretical choice: either apparent synonyms are not synonyms or synonyms do not syntactically occur where they appear to occur. Some theorists have instead looked to Frege’s doctrine of “reference shift” according to which the meaning of an expression is sensitive to its linguistic context. This doctrine is alleged to retain the relevant claims (...) about synonymy and substitution while respecting the compositionality principle. Thus, Salmon :415, 2006) and Glanzberg and King :1–29, 2020) offer occurrence-based accounts of variable binding, and Pagin and Westerståhl :381–415, 2010c) argue that an occurrence-based semantics delivers a compositional account of quotation. Our thesis is this: the occurrence-based strategies resolve the apparent failures of substitutivity in the same general way as the standard expression-based semantics do. So it is a myth that a Frege-inspired occurrence-based semantics affords a genuine alternative strategy. (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)

We argue that the extant evidence for Stoic logic provides all the elements required for a variable-free theory of multiple generality, including a number of remarkably modern features that straddle logic and semantics, such as the understanding of one- and two-place predicates as functions, the canonical formulation of universals as quantified conditionals, a straightforward relation between elements of propositional and first-order logic, and the roles of anaphora and rigid order in the regimented sentences that express multiply general propositions. We (...) consider and reinterpret some ancient texts that have been neglected in the context of Stoic universal and existential propositions and offer new explanations of some puzzling features in Stoic logic. Our results confirm that Stoic logic surpasses Aristotle’s with regard to multiple generality, and are a reminder that focusing on multiple generality through the lens of Frege-inspired variable-binding quantifier theory may hamper our understanding and appreciation of pre-Fregean theories of multiple generality. (shrink)

Variable binding has long been a challenge to connectionists. Attempts to perform variable binding using localist and distributed connectionist representations are discussed, and problems inherent in each type of representation are outlined.

Human cognition is unique in the way in which it relies on combinatorial (or compositional) structures. Language provides ample evidence for the existence of combinatorial structures, but they can also be found in visual cognition. To understand the neural basis of human cognition, it is therefore essential to understand how combinatorial structures can be instantiated in neural terms. In his recent book on the foundations of language, Jackendoff described four fundamental problems for a neural instantiation of combinatorial structures: the massiveness (...) of the binding problem, the problem of 2, the problem of variables, and the transformation of combinatorial structures from working memory to long-term memory. This paper aims to show that these problems can be solved by means of neural “blackboard” architectures. For this purpose, a neural blackboard architecture for sentence structure is presented. In this architecture, neural structures that encode for words are temporarily bound in a manner that preserves the structure of the sentence. It is shown that the architecture solves the four problems presented by Jackendoff. The ability of the architecture to instantiate sentence structures is illustrated with examples of sentence complexity observed in human language performance. Similarities exist between the architecture for sentence structure and blackboard architectures for combinatorial structures in visual cognition, derived from the structure of the visual cortex. These architectures are briefly discussed, together with an example of a combinatorial structure in which the blackboard architectures for language and vision are combined. In this way, the architecture for language is grounded in perception. Perspectives and potential developments of the architectures are discussed. Key Words: binding; blackboard architectures; combinatorial structure; compositionality; language; dynamic system; neurocognition; sentence complexity; sentence structure; working memory; variables; vision. (shrink)

Animate vision systems have gaze control mechanisms that can actively position the camera coordinate system in response to physical stimuli. Compared to passive systems, animate systems show that visual computation can be vastly less expensive when considered in the larger context of behavior. The most important visual behavior is the ability to control the direction of gaze. This allows the use of very low resolution imaging that has a high virtual resolution. Using such a system in a controlled way provides (...) additional constraints that dramatically simplify the computations of early vision. Another important behavior is the way the environment “behaves‘. Animate systems under real-time constraints can further reduce their computational burden by using environmental cues that are perspicuous in the local context. A third source of economy is introduced when behaviors are learned. Because errors are rarely fatal, systems using learning algorithms can amortize computational cost over extended periods. Further economies can be achieved when the learning system uses indexical reference, which is a form of dynamic variable binding. Animate vision is a natural way of implementing this dynamic binding. (shrink)

The formal semantics that we have proposed for definite and indefinite descriptions analyzes them both as variable-binding operators and as referring terms. It is the referential analysis which makes it possible to account for the facts outlined in Section 2, e.g. for the purely ‘instrumental’ role of the descriptive content; for the appearance of unusually wide scope readings relative to other quantifiers, higher predicates, and island boundaries; for the fact that the island-escaping readings are always equivalent to maximally (...) wide scope quantifiers; and for the appearance of violations of the identity conditions on variables in deleted constituents. We would emphasize that this is not a random collection of observations. They cohere naturally with each other, and with facts about other phrases that are unambigously referential.We conceded at the outset of this paper that the referential use of an indefinite noun phrase does not, by itself, motivate the postulation of a referential interpretation. Our argument has been that the behavior of indefinites in complex sentences cannot be economically described, and certainly cannot be explained, unless a referential interpretation is assumed. It could be accounted for in pragmatic terms only if the whole theory of scope relations and of conditions on deletion could be eliminated from the semantics and incorporated into a purely pragmatic theory. But this seems unlikely. (shrink)

Hybrid languages have both modal and first-order characteristics: a Kripke semantics, and explicit variable binding apparatus. This paper motivates the development of hybrid languages, sketches their history, and examines the expressive power of three hybrid binders. We show that all three binders give rise to languages strictly weaker than the corresponding first-order language, that full first-order expressivity can be gained by adding the universal modality, and that all three binders can force the existence of infinite models and have (...) undecidable satisfiability problems. (shrink)

Rooth & Partee (1982) and Rooth (1985) have shown that the English-specific rule-by-rule system of PTQ can be factored out into function application plus two transformations for resolving type mismatch (type lifting and variable binding). Building on these insights, this article proposes a universal system for type-driven translation, by adding two more innovations: local type determination for gaps (generalizing Montague 1973) and a set of semantic filters (extending Cooper 1983). This system, dubbed Cross-Linguistic Semantics (XLS), is shown to (...) account for various phenomena — including scope relations in English and Greenlandic Eskimo, internally headed relative clauses in Lakhota, serial verbs in Yoruba and VP ellipsis in English. (shrink)

In sentences like Every teacher laughed we think of every teacher as a unary (=type (1)) quantifier - it expresses a property of one place predicate denotations. In variable binding terms, unary quantifiers bind one variable. Two applications of unary quantifiers, as in the interpretation of No student likes every teacher, determine a binary (= type (2)) quantifier; they express properties of two place predicate denotations. In variable binding terms they bind two variables. We call (...) a binary quantifier Fregean (or reducible) if it can in principle be expressed by the iterated application of unary quantifiers. In this paper we present two mathematical properties which distinguish non-Fregean quantifiers from Fregean ones. Our results extend those of van Benthem (1989) and Keenan (1987a). We use them to show that English presents a large variety of non-Fregean quantifi ers. Some are new here, others are familiar (though the proofs that they are non-Fregean are not). The main point of our empirical work is to inform us regarding the types of quantification natural language presents - in particular (van Benthem, 1989) that it goes beyond the usual (Fregean) analysis which treats it as mere iterated application of unary quantifiers. Secondarily, our results challenge linguistic approaches to "Logical Form" which constrain variable binding operators to "locally" bind just one occurrence of a variable, e.g., the Bijection Principle (BP) of Koopman and Sportiche (1983). The BP (correctly) blocks analyses like For which x, x's mother kissed x? for Who did his mother kiss? since For which x would locally bind two occurrences of x. But some of our irreducible binary quantifiers are naturally represented by operators which do locally bind two variables. This paper is organized as follows: Section 1 provides an explicit formulation of our questions of concern. Section 2 classifies the English constructions which we show to be non-Fregean. Section 3 presents the mathematical properties which test for non-Fregean quantification and applies these tests to the constructions in Section 2. Proofs of the mathema tical properties are given in the Appendix. (shrink)

I present a general theory of abstraction operators which treats them as variable-binding term- forming operators, and provides a reasonably uniform treatment for definite descriptions, set abstracts, natural number abstraction, and real number abstraction. This minimizing, extensional and relational theory reveals a striking similarity between definite descriptions and set abstracts, and provides a clear rationale for the claim that there is a logic of sets (which is ontologically non- committal). The theory also treats both natural and real numbers (...) as answering to a two-fold process of abstraction. The first step, of conceptual abstraction, yields the object occupying a particular position within an ordering of a certain kind. The second step, of objectual abstraction, yields the number sui generis, as the position itself within any ordering of the kind in question. (shrink)

The present study investigates whether quantifier scope is computed incrementally during online sentence processing. We exploited the free word order in German to manipulate whether the verbal predicate preceded or followed the second quantifier in doubly quantified sentences that required the computation of inverse scope. A possessive pronoun in the first quantifier that had to be bound by the second quantifier was used to enforce scope inversion. We tested whether scope inversion causes difficulty and whether this difficulty emerges even at (...) a point before comprehenders have encountered the main verb. We report three pretests and two reading time experiments. The first two pretests were offline tests that established (1) that the sentences exhibited the assumed scope preferences and (2) that variable binding forced scope inversion. The third pretest employed self-paced reading to show that interpreting a bound variable is not difficult per se and that difficulty in the critical construction must thus be due to inverting scope. Incremental processing of quantifier scope was investigated in a self-paced reading experiment. We observed difficulty right after the second quantifier, but only if it appeared after the main verb, that is, after the predication was complete. Further evidence for late scope inversion comes from an eyetracking experiment. Again, a scope inversion effect could only be observed at the end of the sentence. Taken together, our study demonstrates that in German inverse scope is only computed at the sentence boundary. (shrink)