## On the Logic and Learning of Language (2002)

Citations: | 7 - 2 self |

### BibTeX

@TECHREPORT{Fulop02onthe,

author = {Sean A. Fulop and Saunders Mac Lane},

title = {On the Logic and Learning of Language},

institution = {},

year = {2002}

}

### OpenURL

### Abstract

algebra . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33 3.1.1 Homomorphisms and free generators . . . . . . . . . . . . 34 3.1.2 Quotient algebras . . . . . . . . . . . . . . . . . . . . . . . 36 3.1.3 Reducts . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 37 3.2 Algebras of languages . . . . . . . . . . . . . . . . . . . . . . . . . 38 3.2.1 The algebra of formulae . . . . . . . . . . . . . . . . . . . 38 3.2.2 Substitutions . . . . . . . . . . . . . . . . . . . . . . . . . . 39 3.2.3 Associated algebras . . . . . . . . . . . . . . . . . . . . . . 40 3.2.4 Valuations . . . . . . . . . . . . . . . . . . . . . . . . . . . 41 3.2.5 Lindenbaum-Tarski quotient algebras . . . . . . . . . . . . 42 3.3 Algebras of deductive systems . . . . . . . . . . . . . . . . . . . . 44 3.3.1 Determining a class of algebras . . . . . . . . . . . . . . . 45 3.3.2 Algebra of a sequent calculus . . . . . . . . . . . . . . . . . 46 3.3.3 Completeness . . . . . . . . . . . . . . . . . . . . . . . . . 48 3.4 Subsuming special cases: an example . . . . . . . . . . . . . . . . 49 3.4.1 The sequent system GL . . . . . . . . . . . . . . . . . . . . 49 3.4.2 The equivalent system t(GL) . . . . . . . . . . . . . . . . . 51 3.4.3 Algebraic models for GL . . . . . . . . . . . . . . . . . . . 52 3.5 Kripke semantics . . . . . . . . . . . . . . . . . . . . . . . . . . . . 56 4 Categorial type logics 61 4.1 The typed lambda calculus . . . . . . . . . . . . . . . . . . . . . . 62 4.2 Categorial grammar . . . . . . . . . . . . . . . . . . . . . . . . . . 66 4.3 Forms of Lambek's calculus . . . . . . . . . . . . . . . . . . . . . . 69 4.3.1 Classical CG revisited . . . . . . . . . . . . . . . . . . . . . 70 4.3.2 The nonassociative product-free system . . . . . . . . . . . 70 4.3.3 Addin...

### Citations

1261 | Modeling by shortest data description - Rissanen - 1978 |

464 |
Language learnability and language development
- Pinker
- 1984
(Show Context)
Citation Context ...s of words by an unspecified means, and then apply a default mapping to assign a syntactic category to each word based on its semantic category (this is the so-called Canonical Structure Realization, =-=Pinker 1984-=-). The alternative syntactic bootstrapping hypothesis of Gleitman (1990) holds in a sense the converse of semantic bootstrapping, proposing that children primarily use syntactic information to acquire... |

257 | Categorial type logics
- Moortgat
- 1997
(Show Context)
Citation Context ...for linguistic syntax, and these will also be used in our grammar learning system. Type logics can be used as formal deductive engines for what has sometimes been called “grammatical inference” (e=-=.g. Moortgat 1997-=-), which refers to the process of deriving that a certain string of words (which can also be assigned a particular syntactic constituent structure in a familiar sense) has the status of sentence accor... |

199 |
Formal Principles of Language Acquisition
- Wexler, Culicover
- 1980
(Show Context)
Citation Context ...ly. This special status of a particular language is given the name accumulation point, but the notion has its origin in essence in the work of Wexler and his collaborators (Wexler and Hamburger 1973, =-=Wexler and Culicover 1980). 7.7 DEFIN-=-ITION (KAPUR 1991) The language L ∈ L is said to be an accumulation point just when there exists a sequence of finite sets S0, S1, . . . such that 1. ∀i ∈ N Si ⊆ Si+1; 2. � ∞ i=0 Si = L; 3... |

190 |
Surface structure and interpretation
- Steedman
- 1996
(Show Context)
Citation Context ...thing that a functional type maps to (its “result”) is uniformly written to the left of a slash. In this system, prevalent in the literature on Combinatory Categorial Grammar (Ades and Steedman 19=-=82, Steedman 1997) This-=- notational convention is sometimes referred to as “result-first,” (Wood 1993), while our convention, which reflects current practice in the type-logical literature, can be called “result-on-top... |

144 |
Parsing as deduction
- Pereira, Warren
- 1983
(Show Context)
Citation Context ... major approach to generative formal theories is exemplified by typelogical grammar, and can be summed up with a slogan drawn from computational linguistics, “grammar as logic, parsing as deduction�=-=�� (Pereira and Warren 1983-=-). thing. 1 Some treatments speak instead of a set of words over some alphabet, but it amounts to the sames8.6. TYPE LOGIC AS A STRUCTURALIST GENERATIVEFRAMEWORK187 For some reason, this approach is r... |

137 | Mathematical logic as based on the theory of types - Russell - 1908 |

129 | Systems that learn - Osherson, Stob, et al. - 1985 |

119 |
The Collected Papers of Gerhard Gentzen
- Szabo, Ed, et al.
- 1969
(Show Context)
Citation Context ... Logic, Language, and Meaning. Vol. 2. University of Chicago Press. Gentzen, Gerhard. 1934. Untersuchungen über das logische Schliessen. Math. Zeitschrift 39:176–210, 405–431. English translation=-= in (Szabo 1969). G-=-irard, Jean-Yves. 1987. Linear logic. Theoretical Computer Science 50:1–102. Gleitman, Lila. 1990. The structural sources of verb meanings. Language Acquisition 1(1):3–55. Gold, E. M. 1967. Langua... |

98 |
Coding and Information Theory
- Roman
- 1992
(Show Context)
Citation Context ...that τ is assigned |IG| divided by the cardinality of IG. The probability of a particular type assignment w : : τ in IG is thus given by P(w : : τ) = o(w)o(τ) . |IG| By the definition of informati=-=on (Roman 1996), the -=-information obtained from a particular type assignment w : : τ is given by � � |IG| I(w : : τ) = log2 . o(w)o(τ)s154 CHAPTER 6. LEARNING TYPE-LOGICAL GRAMMAR Now the entropy of the lexicon IG v... |

87 |
An algebraic approach to non-classical logics
- Rasiowa
- 1974
(Show Context)
Citation Context ...tion of a propositional (or zero-order) logic, and of two very useful deductive calculi that can be used to specify such a logic. Our two main guides to method in this outline are (Gentzen 1934) and (=-=Rasiowa 1974-=-). The sequent calculus invented by Gentzen will prove to be a useful kind of deductive system for specifying consequence relations that are sensitive to the particular occurrences or arrangement of p... |

70 |
Transformational Grammar
- RADFORD
- 1988
(Show Context)
Citation Context ... learned about or have themselves advocated producing or justifying a syntactic structure for a sentence by employing constituent structure tests. Some of the influential syntax textbooks (especially =-=Radford 1988-=-) spend considerable time discussing the subject of empirical tests for constituency. The use of the tests is often introduced to us as the main way in which we can all agree that a particular group o... |

61 | Resource Logics: Proof Theoretical Investigations - Roorda - 1991 |

56 |
Categorial Grammars
- Wood, M
- 1993
(Show Context)
Citation Context ... a slash. In this system, prevalent in the literature on Combinatory Categorial Grammar (Ades and Steedman 1982, Steedman 1997) This notational convention is sometimes referred to as “result-first,�=-=�� (Wood 1993), w-=-hile our convention, which reflects current practice in the type-logical literature, can be called “result-on-top” since one can read the mapping represented in a slash type as going from the type... |

26 |
Categorial Investigations
- Moortgat
- 1988
(Show Context)
Citation Context ... structurebased theories in a similar way, since the syntactic evidence available in Dutch shows the verb clusters to be syntactic constituents, though they obviously aren’t semantic constituents (v=-=. Moortgat 1988-=- for an argument from coordination). The key problem is that traditional phrase structure is constrained to provide a semantic purpose to every constituent in the tree, and the CSTs together with typi... |

24 | Automated Proof Search in Non-Classical Logics: Efficient Matrix Proof Methods for Modal and Intuitionistic Logics - Wallen - 1987 |

21 | Product-free Lambek calculus and context-free grammars
- Pentus
- 1997
(Show Context)
Citation Context ...application structures as we have defined it, weakly generates the context-free languages (Bar-Hillel et al. 1964). • The associative Lambek calculus also weakly generates the context-free languages=-= (Pentus 1997).-=- • General multimodal type-logical grammars, with no constraints placed upon their structural rules, weakly generate all recursively enumerable string languages (the so-called Type 0 languages) (Car... |

15 | Formulas-as-types for a hierarchy of sublogics of Intuistionistic Propositional Logic.' ms. Institut fur Philosophie - Wansing - 1990 |

13 | Proof nets for the multimodal Lambek calculus - Moot, Puite |

13 | Language acquisition in the MDL framework - Rissanen, Ristad - 1994 |

12 |
General algebraic logic: A perspective on ‘What is logic
- Andréka, Németi
- 1994
(Show Context)
Citation Context ...rove extremely important in the next chapter, since no standard Tarskian algebraic treatment of any logic (i.e. consequence relation) that does not determine a closure operation can be developed (cf. =-=Németi and Andréka 1994,-=- Andréka et al. 1995). To provide our substructural type logics with an algebraic semantics in general, we must develop a new kind of algebraic treatment of the sequent calculus; there can be no stan... |

11 |
Dispelling myths about language bootstrapping
- Siskind
- 1991
(Show Context)
Citation Context ... semantic bootstrapping hypothesis is that it isn’t really much of a hypothesis, but is rather more of a general suggestion. In this section we compare one particular instantiation of the suggestion=-= (Siskind 1991-=-) with our own, demonstrating in the process that the pros and cons of semantic bootstrapping really depend upon the details of a given implementation; the efficacy of the suggestion simply cannot be ... |

10 |
Strong Generative Capacity
- Miller
- 1999
(Show Context)
Citation Context ...irect competitor fors176 LINGUISTIC THEORY type logic, Combinatory Categorial Grammar. Considering all of these theories’ notions of syntactic structure could take up a book (and practically does, v=-=. Miller 1999-=-), but suffice it to say that none of them attempts to account exactly for the syntactic structures evinced by constituent structure tests. Some of these theories essentially duplicate the structures ... |

10 | Grammatical Composition: Modes, Models, Modalities - Versmissen - 1996 |

10 |
On the insufficiency of surface data for the learning of transformational languages
- Wexler, Hamburger
- 1973
(Show Context)
Citation Context ...other languages in the family. This special status of a particular language is given the name accumulation point, but the notion has its origin in essence in the work of Wexler and his collaborators (=-=Wexler and Hamburger 1973, Wexler-=- and Culicover 1980). 7.7 DEFINITION (KAPUR 1991) The language L ∈ L is said to be an accumulation point just when there exists a sequence of finite sets S0, S1, . . . such that 1. ∀i ∈ N Si ⊆... |

7 | The relevance of computational complexity theory to natural language processing - Rounds - 1991 |

5 | Classical Propositional Operators - Segerberg - 1982 |

1 |
Meaningful patterns. In Jelle Gerbrandy, Maarten Marx, Maarten de Rijke, and Yde Venema (Eds.), JFAK: Essays dedicated to Johan van Benthem on the occasion of his 50th birthday
- Moortgat
- 1999
(Show Context)
Citation Context ... expands the structural domain of a feature, when read from top to bottom. The need for this kind of rule turns out to be ubiquitous in the linguistic application of modally enriched type logics (cf. =-=Moortgat 1999, Kraak 1998), and will -=-likely end up among the set of structural rules for any natural language. (Expand) ∆[Γ1 ⋄ 〈Γ2〉 a ] ⇒ C ∆[〈Γ1 ⋄ Γ2〉 a ] ⇒ C The final analysis has the advantage that the special... |

1 |
On the algebraization of some Gentzen systems. Fundamenta Informaticae 18:319–338
- Rebagliato, Verdú
- 1993
(Show Context)
Citation Context ...a consequence relation that reflects the consequence relation embodied in the logic. While recent work along these lines has presented some ways of algebraizing certain Gentzen-style sequent calculi (=-=Rebagliato and Verdú 1993-=-, Font and Jansana 1996), the notion has not yet been extended to include substructural sequent systems like the type logics. We hope that the work presented here can form a suitable foundation for th... |