Switch to: References

Add citations

You must login to add citations.
  1. First-Order Aspects of Tree Paths.Ruaan Kellerman - 2015 - Logic Journal of the IGPL 23 (4):688-704.
    Download  
     
    Export citation  
     
    Bookmark  
  • Computation Tree Logics and Temporal Logics with Reference Pointers.Valentin Goranko - 2000 - Journal of Applied Non-Classical Logics 10 (3-4):221-242.
    A complete axiomatic system CTL$_{rp}$ is introduced for a temporal logic for finitely branching $\omega^+$-trees in a temporal language extended with so called reference pointers. Syntactic and semantic interpretations are constructed for the branching time computation tree logic CTL* into CTL$_{rp}$. In particular, that yields a complete axiomatization for the translations of all valid CTL*-formulae. Thus, the temporal logic with reference pointers is brought forward as a simpler (with no path quantifiers), but in a way more expressive medium for reasoning (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Talking About Trees and Truth-Conditions.Reinhard Muskens - 2001 - Journal of Logic, Language and Information 10 (4):417-455.
    We present Logical Description Grammar (LDG), a model ofgrammar and the syntax-semantics interface based on descriptions inelementary logic. A description may simultaneously describe the syntacticstructure and the semantics of a natural language expression, i.e., thedescribing logic talks about the trees and about the truth-conditionsof the language described. Logical Description Grammars offer a naturalway of dealing with underspecification in natural language syntax andsemantics. If a logical description (up to isomorphism) has exactly onetree plus truth-conditions as a model, it completely specifies thatgrammatical (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Underspecified Semantics.Reinhard Muskens - 2000 - In Klaus von Heusinger & Urs Egli (eds.), Reference and Anaphoric Relations. Kluwer Academic Publishers. pp. 311--338.
    Ambiguities in natural language can multiply so fast that no person or machine can be expected to process a text of even moderate length by enumerating all possible disambiguations. A sentence containing $n$ scope bearing elements which are freely permutable will have $n!$ readings, if there are no other, say lexical or syntactic, sources of ambiguity. A series of $m$ such sentences would lead to $(n!)^m$ possibilities. All in all the growth of possibilities will be so fast that generating readings (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Classes and Theories of Trees Associated with a Class of Linear Orders.Valentin Goranko & Ruaan Kellerman - 2011 - Logic Journal of the IGPL 19 (1):217-232.
    Given a class of linear order types C, we identify and study several different classes of trees, naturally associated with C in terms of how the paths in those trees are related to the order types belonging to C. We investigate and completely determine the set-theoretic relationships between these classes of trees and between their corresponding first-order theories. We then obtain some general results about the axiomatization of the first-order theories of some of these classes of trees in terms of (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Temporal Logics with Reference Pointers and Computation Tree Logics.Valentin Goranko - 2000 - Journal of Applied Non-Classical Logics 10 (3):221-242.
    A complete axiomatic system CTL$_{rp}$ is introduced for a temporal logic for finitely branching $\omega^+$-trees in a temporal language extended with so called reference pointers. Syntactic and semantic interpretations are constructed for the branching time computation tree logic CTL$^{*}$ into CTL$_{rp}$. In particular, that yields a complete axiomatization for the translations of all valid CTL$^{*}$-formulae. Thus, the temporal logic with reference pointers is brought forward as a simpler (with no path quantifiers), but in a way more expressive medium for reasoning (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Construction by Description in Discourse Representation.Noor van Leusen & Reinhard Muskens - 2003 - In Jaroslav Peregrin (ed.), Meaning: The Dynamic Turn. Elsevier. pp. 33-65.
    This paper uses classical logic for a simultaneous description of the syntax and semantics of a fragment of English and it is argued that such an approach to natural language allows procedural aspects of linguistic theory to get a purely declarative formulation. In particular, it will be shown how certain construction rules in Discourse Representation Theory, such as the rule that indefinites create new discourse referents and definites pick up an existing referent, can be formulated declaratively if logic is used (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Language, Lambdas, and Logic.Reinhard Muskens - 2003 - In R. Oehrle & J. Kruijff (eds.), Resource Sensitivity, Binding, and Anaphora (Studies in Linguistics and Philosophy 80). Dordrecht: Kluwer Academic Publishers. pp. 23--54.
    The paper develops Lambda Grammars, a form of categorial grammar that, unlike other categorial formalisms, is non-directional. Linguistic signs are represented as sequences of lambda terms and are combined with the help of linear combinators.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Categorial Grammar and Lexical-Functional Grammar.Reinhard Muskens - 2001 - In Miriam Butt & Tracey Holloway King (eds.), Proceedings of the LFG01 Conference, University of Hong Kong. Stanford, CA: CSLI Publications. pp. 259-279.
    This paper introduces λ-grammar, a form of categorial grammar that has much in common with LFG. Like other forms of categorial grammar, λ-grammars are multi-dimensional and their components are combined in a strictly parallel fashion. Grammatical representations are combined with the help of linear combinators, closed pure λ-terms in which each abstractor binds exactly one variable. Mathematically this is equivalent to employing linear logic, in use in LFG for semantic composition, but the method seems more practicable.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Description Theory, LTAGs and Underspecified Semantics.Reinhard Muskens & Emiel Krahmer - 1998 - In Anne Abeillé, Tilman Becker, Giorgio Satta & K. Vijay-Shanker (eds.), Fourth International Workshop on Tree Adjoining Grammars and Related Frameworks. Philadelphia, PA: Institute for Research in Cognitive Science. pp. 112-115.
    An attractive way to model the relation between an underspecified syntactic representation and its completions is to let the underspecified representation correspond to a logical description and the completions to the models of that description. This approach, which underlies the Description Theory of Marcus et al. 1983 has been integrated in Vijay-Shanker 1992 with a pure unification approach to Lexicalized Tree-Adjoining Grammars (Joshi et al. 1975, Schabes 1990). We generalize Description Theory by integrating semantic information, that is, we propose to (...)
    Download  
     
    Export citation  
     
    Bookmark