Switch to: References

Add citations

You must login to add citations.
  1. Easy Solutions for a Hard Problem? The Computational Complexity of Reciprocals with Quantificational Antecedents.Fabian Schlotterbeck & Oliver Bott - 2013 - Journal of Logic, Language and Information 22 (4):363-390.
    We report two experiments which tested whether cognitive capacities are limited to those functions that are computationally tractable (PTIME-Cognition Hypothesis). In particular, we investigated the semantic processing of reciprocal sentences with generalized quantifiers, i.e., sentences of the form Q dots are directly connected to each other, where Q stands for a generalized quantifier, e.g. all or most. Sentences of this type are notoriously ambiguous and it has been claimed in the semantic literature that the logically strongest reading is preferred (Strongest (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Pluralism for Relativists: a new framework for context-dependence.Ahmad Jabbar - 2021 - In Proceedings of the 18th workshop of the Logic and Engineering of Natural Language Semantics (LENLS). pp. 3-16.
    We propose a framework that makes space for both non-indexical contextualism and assessment-sensitivity. Such pluralism is motivated by considering possible variance in judgments about retraction. We conclude that the proposed pluralism, instead of problematizing, vindicates defining truth of a proposition w.r.t. a context of utterance and a context of assessment. To implement this formally, we formalize initialization of parameters by contexts. Then, a given parameter, depending on a speaker's judgment, can get initialized by either the context of utterance or the (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • A Computational Learning Semantics for Inductive Empirical Knowledge.Kevin T. Kelly - 2014 - In Alexandru Baltag & Sonja Smets (eds.), Johan van Benthem on Logic and Information Dynamics. Springer International Publishing. pp. 289-337.
    This chapter presents a new semantics for inductive empirical knowledge. The epistemic agent is represented concretely as a learner who processes new inputs through time and who forms new beliefs from those inputs by means of a concrete, computable learning program. The agent’s belief state is represented hyper-intensionally as a set of time-indexed sentences. Knowledge is interpreted as avoidance of error in the limit and as having converged to true belief from the present time onward. Familiar topics are re-examined within (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations