Model-Theoretic Syntax at 10 - Earlham Computer Science ...
Model-Theoretic Syntax at 10 - Earlham Computer Science ...
Model-Theoretic Syntax at 10 - Earlham Computer Science ...
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
26 Modal Logic in <strong>Model</strong> <strong>Theoretic</strong> <strong>Syntax</strong><br />
Bibliography<br />
Afanasiev, Loredana, P<strong>at</strong>rick Blackburn, Ioanna Dimitriou,<br />
Bertrand Gaiffe, Evan Goris, Maarten Marx, and<br />
Maarten de Rijke (2005). PDL for ordered trees. Journal<br />
of Applied Non-Classical Logic, 15(2):115–135.<br />
Backofen, Rolf, James Rogers, and K. Vijay-Shanker<br />
(1995). A first-order axiom<strong>at</strong>iz<strong>at</strong>ion of the theory of<br />
finite trees. Journal of Logic, Language and Inform<strong>at</strong>ion,<br />
4(1):5–39.<br />
Blackburn, P<strong>at</strong>rick, Claire Gardent, and Wilfried Meyer<br />
Viol (1993). Talking about trees. In Steven Krauwer,<br />
Michael Moortg<strong>at</strong>, and Louis des Tombe, eds., Sixth<br />
Conference of the European Chapter of the Associ<strong>at</strong>ion<br />
for Comput<strong>at</strong>ional Linguistics — Proceedings of<br />
the Conference. ACL.<br />
Blackburn, P<strong>at</strong>rick and Wilfried Meyer-Viol (1994). Linguistics,<br />
logic and finite trees. Bulletin of the Interest<br />
Group in Pure and Applied Logics, 2(1):3–29.<br />
Blackburn, P<strong>at</strong>rick, Wilfried Meyer-Viol, and Maarten<br />
de Rijke (1996). A proof system for finite trees. In<br />
Dirk van Dalen and Marc Bezem, eds., <strong>Computer</strong> science<br />
logic (Paderborn, 1995). Springer, Berlin.<br />
Chomsky, Noam (1981). Lectures on Government and<br />
Binding. Foris Public<strong>at</strong>ions, Dordrecht.<br />
Cornell, Thomas (2000). Parsing and grammar engineering<br />
with tree autom<strong>at</strong>a. In Anton Nijholt Dirk Heylen<br />
and Giuseppe Scollo, eds., Algebraic Methods in Language<br />
Processing AMiLP 2000, Iowa City, Iowa.<br />
Doner, John (1970). Tree acceptors and some of their applic<strong>at</strong>ions.<br />
Journal of <strong>Computer</strong> and System <strong>Science</strong>s,<br />
4:406–451.<br />
Ferrante, Jeanne and Charles W. Rackoff (1979). The<br />
comput<strong>at</strong>ional complexity of logical theories. Springer,<br />
Berlin.<br />
Gazdar, Gerald, Ewan Klein, Geoffrey Pullum, and Ivan<br />
Sag (1985). Generalized Phrase Structure Grammar.<br />
Harvard University Press, Cambridge.<br />
Gécseg, Ferenc and Magnus Steinby (1997). Tree languages.<br />
In Handbook of formal languages, Vol. 3.<br />
Springer, Berlin.<br />
Gorn, Saul (1967). Explicit definitions and linguistic<br />
dominoes. In Systems and <strong>Computer</strong> <strong>Science</strong> (Proc.<br />
Conf., London, Ont., 1965). Univ. Toronto Press,<br />
Toronto, Ont.<br />
Hintikka, Jaakko and Gabriel Sandu (1991). On the<br />
Methodology of Linguistics. Basil Blackwell, Oxford.<br />
Klarlund, Nils (1998). Mona & fido: The logicautom<strong>at</strong>on<br />
connection in practice. In Georg Gottlob,<br />
Etienne Grandjean, and K<strong>at</strong>rin Seyr, eds., <strong>Computer</strong><br />
<strong>Science</strong> Logic (Brno, 1998). Springer, Berlin.<br />
Kolb, Hans-Peter, Jens Michaelis, Uwe Mönnich, and<br />
Frank Morawietz (2003). An oper<strong>at</strong>ional and denot<strong>at</strong>ional<br />
approach to non-context-freeness. <strong>Theoretic</strong>al<br />
<strong>Computer</strong> <strong>Science</strong>, 293(2):261–289.<br />
Kornai, Andràs and Geoffrey K. Pullum (1990). The X-<br />
bar theory of phrase structure. Language, 66:24–50.<br />
Kracht, Marcus (1995). Syntactic codes and grammar<br />
refinement. Journal of Logic, Language and Inform<strong>at</strong>ion,<br />
4(1):41–60.<br />
Kracht, Marcus (1997a). Inessential fe<strong>at</strong>ures. In Alain<br />
Lecomte, François Lamarche, and Guy Perrier, eds.,<br />
Logical aspects of comput<strong>at</strong>ional linguistics. Springer,<br />
Berlin.<br />
Kracht, Marcus (1997b). On reducing principles to rules.<br />
In P<strong>at</strong>rick Blackburn and Maarten de Rijke, eds., Specifying<br />
Syntactic Structures. CSLI Public<strong>at</strong>ions, Stanford,<br />
CA.<br />
Kracht, Marcus (1999). Tools and techniques in modal<br />
logic. North-Holland, Amsterdam.<br />
Kracht, Marcus (2001). Logic and syntax—a personal<br />
perspective. In Michael Zakharyaschev, Krister<br />
Segerberg, Maarten de Rijke, and Heinrich Wansing,<br />
eds., Advances in modal logic, Vol. 2. CSLI Public<strong>at</strong>ions,<br />
Stanford, CA.<br />
Kracht, Marcus (2003). The M<strong>at</strong>hem<strong>at</strong>ics of Language.<br />
de Gruyter, Berlin.<br />
Langholm, Tore (2001). A descriptive characteris<strong>at</strong>ion of<br />
indexed grammars. Grammars, 4(3):205–262.<br />
Lautemann, Clemens, Thomas Schwentick, and Denis<br />
Thérien (1995). Logics for context-free languages.<br />
In Leszek Pacholski and Jerzy Tiuryn, eds., <strong>Computer</strong><br />
science logic (Kazimierz, 1994). Springer, Berlin.<br />
Libkin, Leonid (2004). Elements of finite model theory.<br />
Springer, Berlin.<br />
Marx, Maarten (2004). Conditional XP<strong>at</strong>h, the first order<br />
complete XP<strong>at</strong>h dialect. In Proceedings of PODS ’04.<br />
Moss, Lawrence S. and Hans-Jörg Tiede (2006). Applic<strong>at</strong>ions<br />
of modal logic in linguistics. In P<strong>at</strong>rick Blackburn,<br />
Johan van Benthem, and Frank Wolter, eds.,<br />
Handbook of Modal Logic. ELSEVIER, Amsterdam.<br />
Palm, Adi (1999). Propositional tense logic for finite<br />
trees. In Proceedings of M<strong>at</strong>hem<strong>at</strong>ics of Language<br />
(MOL 6).<br />
Palm, Adi (2001). <strong>Model</strong> theoretic syntax and parsing:<br />
An applic<strong>at</strong>ion to temporal logic. In Proceedings of<br />
Formal Grammar and M<strong>at</strong>hem<strong>at</strong>ics of Language (FG-<br />
MOL).