- Full text PDF available (67)
- This year (0)
- Last 5 years (16)
- Last 10 years (32)
Finite-state descriptions for temporal semantics are outlined through which to distinguish soft inferences reflecting manners of conceptualization from more robust semantic entailments defined over models. Just what descriptions are built (before being interpreted model-theoretically) and how they are grounded in models of reality explain (upon examination)… (More)
Elementary ((rst-order) and non-elementary (set-theoretic) aspects of the largest bisimulation are considered , with a view towards analyzing operational semantics from the perspective of predicate logic. The notion of a bisimulation is employed in two distinct ways: (i) as an extensional notion of equivalence on programs (or processes) generalizing… (More)
The notion of inertia is explicated in terms of forces recorded in snapshots that are strung together to represent events. The role inertia worlds were conceived to serve in the semantics of the progressive is assumed by a branching construct that specifies what may follow, apart from what follows.
Finite-state methods are applied to the Russell-Wiener-Kamp notion of time (based on events) and developed into an account of interval relations and semi-intervals. Strings are formed and collected in regular languages and regular relations that are argued to embody temporal relations in their various un-derspecified guises. The regular relations include… (More)
To say that the meaning [[a]] of a term a is given by the meanings of a's parts and how these parts are combined is to state an equality [[a]] = ...[[b]] ... for b a part of a (1) with the meaning function [[·]] appearing on both sides. (1) is commonly construed as a prescription for computing the meaning of a based on the parts of a and their mode of… (More)
Intervals and the events that occur in them are encoded as strings, elaborating on a conception of events as " intervals cum description. " Notions of satisfaction in interval temporal logics are formulated in terms of strings, and the possibility of computing these via finite-state machines/transducers is investigated. This opens up temporal semantics to… (More)
Events in natural language semantics are characterized in terms of regular languages, each string in which can be regarded as a temporal sequence of observations. The usual regular constructs (concatenation, etc.) are supplemented with superposition, inducing a useful notion of entailment, distinct from that given by models of predicate logic.
Conservativity in generalized quantifiers is linked to pre-supposition filtering, under a propositions-as-types analysis extended with dependent quantifiers. That analysis is underpinned by model-theoretically interpretable proofs which inhabit propositions they prove, thereby providing objects for quantification and hooks for anaphora.
Notions of disambiguation supporting a compositional interpretation of ambiguous expressions and reeecting intuitions about how sentences combine in discourse are investigated. Expressions are analyzed both inductively by breaking them apart, and co-inductively by embedding them within larger contexts.