Switch to: References

Citations of:

Towards a computational semantics

In Peter Gärdenfors (ed.), Generalized Quantifiers. Reidel Publishing Company. pp. 31--71 (1987)

Add citations

You must login to add citations.
  1. Logical constants across varying types.Johan van Benthem - 1989 - Notre Dame Journal of Formal Logic 30 (3):315-342.
    Download  
     
    Export citation  
     
    Bookmark   38 citations  
  • Generalized quantifiers.Dag Westerståhl - 2008 - Stanford Encyclopedia of Philosophy.
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  • Comprehension of Simple Quantifiers: Empirical Evaluation of a Computational Model.Jakub Szymanik & Marcin Zajenkowski - 2010 - Cognitive Science 34 (3):521-532.
    We examine the verification of simple quantifiers in natural language from a computational model perspective. We refer to previous neuropsychological investigations of the same problem and suggest extending their experimental setting. Moreover, we give some direct empirical evidence linking computational complexity predictions with cognitive reality.<br>In the empirical study we compare time needed for understanding different types of quantifiers. We show that the computational distinction between quantifiers recognized by finite-automata and push-down automata is psychologically relevant. Our research improves upon hypothesis and (...)
    Download  
     
    Export citation  
     
    Bookmark   33 citations  
  • (1 other version)Computational Semantics for Monadic Quantifiers.Marcin Mostowski - 1998 - Journal of Applied Non--Classical Logics 8 (1-2):107--121.
    The paper gives a survey of known results related to computational devices (finite and push–down automata) recognizing monadic generalized quantifiers in finite models. Some of these results are simple reinterpretations of descriptive—feasible correspondence theorems from finite–model theory. Additionally a new result characterizing monadic quantifiers recognized by push down automata is proven.
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • Modal Frame Correspondences and Fixed-Points.Johan Van Benthem - 2006 - Studia Logica 83 (1-3):133-155.
    Taking Löb's Axiom in modal provability logic as a running thread, we discuss some general methods for extending modal frame correspondences, mainly by adding fixed-point operators to modal languages as well as their correspondence languages. Our suggestions are backed up by some new results – while we also refer to relevant work by earlier authors. But our main aim is advertizing the perspective, showing how modal languages with fixed-point operators are a natural medium to work with.
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • Semantics of the Barwise sentence: insights from expressiveness, complexity and inference.Dariusz Kalociński & Michał Tomasz Godziszewski - 2018 - Linguistics and Philosophy 41 (4):423-455.
    In this paper, we study natural language constructions which were first examined by Barwise: The richer the country, the more powerful some of its officials. Guided by Barwise’s observations, we suggest that conceivable interpretations of such constructions express the existence of various similarities between partial orders such as homomorphism or embedding. Semantically, we interpret the constructions as polyadic generalized quantifiers restricted to finite models. We extend the results obtained by Barwise by showing that similarity quantifiers are not expressible in elementary (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • (1 other version)Computational Semantics for Monadic Quantifiers.Marcin Mostowski - 1998 - Journal of Applied Non-Classical Logics 8 (1-2):107-121.
    ABSTRACT This paper gives a survey of known results related to computational devices recognising monadic generalised quantifiers infinite models. Some of these results are simple reinterpretations of descriptive-feasible correspondence theorems from finite-model theory. Additionally a new result characterizing monadic quantifiers recognized by push down automata is proven.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Semiotic Anthropology in Poland.Marcin Brocki - 2007 - Studia Semiotyczne—English Supplement 26:168-183.
    In British and American anthropological literature, the ethnology of Central and Eastern European countries has shared in the plight of descriptions of this part of the world: it was seen as exotic, foreign, remote, a backwater, focused on sideline problems and situated on the periphery of this field of science. This state of affairs has been the case since at least the beginning of the Cold War as the descriptions of the national characters of Eastern Bloc communities, drafted by American (...)
    Download  
     
    Export citation  
     
    Bookmark