Switch to: Citations

Add references

You must login to add references.
  1. Compositionality is not the problem.Wilfrid Hodges - 1998 - Logic and Logical Philosophy 6:7.
    The paper analyses what is said and what is presupposed by thePrinciple of Compositionality for semantics, as it is commonly stated. ThePrinciple of Compositionality is an axiom which some semantics satisfy andsome don’t. It says essentially that if two expressions have the same meaning then they make the same contribution to the meanings of expressionscontaining them. This is a sensible axiom only if one combines it with aconverse, that if two expressions make the same contribution to the meanings of sentences (...)
    Download  
     
    Export citation  
     
    Bookmark   26 citations  
  • Henkin Quantifiers and Complete Problems.Andreas Blass & Yuri Gurevich - 1986 - Annals of Pure and Applied Logic 32:1--16.
    Download  
     
    Export citation  
     
    Bookmark   27 citations  
  • Dynamic predicate logic.Jeroen Groenendijk & Martin Stokhof - 1991 - Linguistics and Philosophy 14 (1):39-100.
    This paper is devoted to the formulation and investigation of a dynamic semantic interpretation of the language of first-order predicate logic. The resulting system, which will be referred to as ‘dynamic predicate logic’, is intended as a first step towards a compositional, non-representational theory of discourse semantics. In the last decade, various theories of discourse semantics have emerged within the paradigm of model-theoretic semantics. A common feature of these theories is a tendency to do away with the principle of compositionality, (...)
    Download  
     
    Export citation  
     
    Bookmark   358 citations  
  • (1 other version)Some remarks on infinitely long formulas.L. Henkin - 1961 - Journal of Symbolic Logic 30 (1):167--183.
    Download  
     
    Export citation  
     
    Bookmark   102 citations  
  • (1 other version)[Introduction].Wilfrid Hodges - 1986 - Journal of Symbolic Logic 51 (4):865.
    We consider two formalisations of the notion of a compositionalsemantics for a language, and find some equivalent statements in termsof substitutions. We prove a theorem stating necessary and sufficientconditions for the existence of a canonical compositional semanticsextending a given partial semantics, after discussing what features onewould want such an extension to have. The theorem involves someassumptions about semantical categories in the spirit of Husserl andTarski.
    Download  
     
    Export citation  
     
    Bookmark   72 citations  
  • [Introduction].Wilfrid Hodges - 1988 - Journal of Symbolic Logic 53 (1):1.
    We consider two formalisations of the notion of a compositionalsemantics for a language, and find some equivalent statements in termsof substitutions. We prove a theorem stating necessary and sufficientconditions for the existence of a canonical compositional semanticsextending a given partial semantics, after discussing what features onewould want such an extension to have. The theorem involves someassumptions about semantical categories in the spirit of Husserl andTarski.
    Download  
     
    Export citation  
     
    Bookmark   72 citations  
  • (1 other version)Some combinatorics of imperfect information.Peter Cameron & Wilfrid Hodges - 2001 - Journal of Symbolic Logic 66 (2):673-684.
    Download  
     
    Export citation  
     
    Bookmark   25 citations  
  • Compositional semantics for a language of imperfect information.W. Hodges - 1997 - Logic Journal of the IGPL 5 (4):539-563.
    We describe a logic which is the same as first-order logic except that it allows control over the information that passes down from formulas to subformulas. For example the logic is adequate to express branching quantifiers. We describe a compositional semantics for this logic; in particular this gives a compositional meaning to formulas of the 'information-friendly' language of Hintikka and Sandu. For first-order formulas the semantics reduces to Tarski's semantics for first-order logic. We prove that two formulas have the same (...)
    Download  
     
    Export citation  
     
    Bookmark   137 citations  
  • From compositional to systematic semantics.Wlodek Zadrozny - 1994 - Linguistics and Philosophy 17 (4):329 - 342.
    We prove a theorem stating that any semantics can be encoded as a compositional semanties, which means that, essentially, the standard definition of compositionality is formally vacuous. We then show that when compositional semantics is required to be systematic (that is, the meaning function cannot be arbitrary, but must belong to some class), it is possible to distinguish between compositional and noncompositional semantics. As a result, we believe that the paper clarifies the concept of compositionality and opens the possibility of (...)
    Download  
     
    Export citation  
     
    Bookmark   42 citations  
  • Formal features of compositionality.Wilfrid Hodges - 2001 - Journal of Logic, Language and Information 10 (1):7-28.
    We consider two formalisations of the notion of a compositionalsemantics for a language, and find some equivalent statements in termsof substitutions. We prove a theorem stating necessary and sufficientconditions for the existence of a canonical compositional semanticsextending a given partial semantics, after discussing what features onewould want such an extension to have. The theorem involves someassumptions about semantical categories in the spirit of Husserl andTarski.
    Download  
     
    Export citation  
     
    Bookmark   59 citations  
  • (1 other version)Some Combinatorics of Imperfect Information.Peter Cameron & Wilfrid Hodges - 2001 - Journal of Symbolic Logic 66 (2):673-684.
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • On mathematical proofs of the vacuity of compositionality.dag westerståhl - 1998 - Linguistics and Philosophy 21 (6):635-643.
    Download  
     
    Export citation  
     
    Bookmark   21 citations  
  • Partially ordered connectives.Gabriel Sandu & Jouko Väänänen - 1992 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 38 (1):361-372.
    We show that a coherent theory of partially ordered connectives can be developed along the same line as partially ordered quantification. We estimate the expressive power of various partially ordered connectives and use methods like Ehrenfeucht games and infinitary logic to get various undefinability results.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Henkin Quantifiers.M. Krynicki & M. Mostowski - 1995 - In Michał Krynicki, Marcin Mostowski & Lesław W. Szczerba (eds.), Quantifiers: Logics, Models and Computation: Volume Two: Contributions. Dordrecht, Netherland: Kluwer Academic Publishers. pp. 193--263.
    Download  
     
    Export citation  
     
    Bookmark   15 citations