Interfaces: Explorations in Logic, Language and Computation
David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
Springer Berlin (2010)
The European Summer School in Logic, Language and Information (ESSLLI) takes place every year, each time at a different location in Europe. With its focus on the large interdisciplinary area where linguistics, logic and computation converge, it has become very popular since it started in 1989, attracting large crowds of students. ESSLLI is where everyone in the field meets, teaches, takes courses, gives talks, dances all night, and generally has a good time. One of the enjoyable features of the School is its recurring Student Session, organized by students along the lines of a conference. The speakers are students too, who are eager to get a chance to present their work. They face stiff competition to get their talks accepted, as the number of papers that is sent in each year is high and acceptance rates low. In my experience many of the selected talks contain fresh and surprising insights and are a pleasure to attend. But the reader may judge the quality of the Student Session for himself, as this volume contains a selection of papers from its 2008 and 2009 installments, the first held in Hamburg, the second in Bordeaux. The book is divided into four parts. – Semantics and Pragmatics – Mathematical Linguistics – Applied Computational Linguistics – Logic and Computation The first two of these present work in the intersection of logic (broadly conceived) and different parts of linguistics, the third contains papers on the interface of linguistics and computation, while the fourth, as its name suggests, deals with logic and computation. The reader will see a connection with the Venn diagram that functions as ESSLLI’s logo.
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
|External links||This entry has no external links. Add one.|
|Through your library||Configure|
Andreas Schnabl, Cdiprover3: A Tool for Proving Derivational Complexities of Term Rewriting Systems. In.
Daphne Theijssen, Variable Selection in Logistic Regression: The British English Dative Alternation. In.
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
M. Reynolds (2001). An Axiomatization of Full Computation Tree Logic. Journal of Symbolic Logic 66 (3):1011-1057.
Tim van Gelder & Robert Port (eds.) (1995). Mind As Motion: Explorations in the Dynamics of Cognition. MIT Press.
Lawrence C. Paulson (1987). Logic and Computation: Interactive Proof with Cambridge Lcf. Cambridge University Press.
J. Lambek (1997). Programs, Grammars and Arguments: A Personal View of Some Connections Between Computation, Language and Logic. Bulletin of Symbolic Logic 3 (3):312-328.
Ruy J. G. B. de Queiroz (2002). Eighth Workshop on Logic, Language, Information and Computation (WoLLIC '2001). Bulletin of Symbolic Logic 8 (2):319-320.
Lex Hendriks (1999). Effective Logic Computation, Klaus Truemper. Journal of Logic, Language and Information 8 (4):481-484.
Jakub Szymanik (2009). The Computational Complexity of Quantified Reciprocals. In Peter Bosch, David Gabelaia & Jérôme Lang (eds.), Lecture Notes on Artificial Intelligence 5422, Logic, Language, and Computation 7th International Tbilisi Symposium on Logic, Language, and Computation. Springer.
Ahti-Veikko Pietarinen (2003). Logic, Language Games and Ludics. Acta Analytica 18 (30/31):89-123.
Peter Bosch, David Gabelaia & Jérôme Lang (eds.) (2009). Lecture Notes on Artificial Intelligence 5422, Logic, Language, and Computation 7th International Tbilisi Symposium on Logic, Language, and Computation. [REVIEW] Springer.
Stefan Wintein (2010). What Makes a Knight? In T. Icard & R. Muskens (eds.), Interfaces: Explorations in Logic, Language and Computation. Springer Berlin. 25--37.
Sorry, there are not enough data points to plot this chart.
Added to index2010-08-03
Recent downloads (6 months)0
How can I increase my downloads?