Ogre and Pythia: An Invariance Proof Method for Weak Consistency Models

We design an invariance proof method for concurrent programs parameterised by a weak consistency model. The calculational design of the invariance proof method is by abstract interpretation of a truly parallel analytic semantics. This generalises the methods by Lamport and Owicki-Gries for sequential consistency. We use cat as an example of language to write consistency specifications of both concurrent programs and machine architectures

Complex Predicates and the Functional Sequence

In this paper I argue that a fine-grained functional hierarchy of semantically contentful categories such as Tense, Aspect, Initiation, and Process has explanatory power in understanding the crosslinguistic distribution of complex predicates. Complex predicates may involve adjunction, control, or raising, and show other variables as well. In a Minimalist framework, specific parameters cannot be invoked to allow or disallow different kinds of serial verbs, light verbs, resultatives, and so on. Instead, what variation is observed must come from the specifications of lexical items. This places a great burden on the learner, a burden which, I argue, is partly alleviated by the functional sequence

The *hope-wh puzzle

Clause-embedding predicates come in three major varieties: (i) responsive predicates (e.g. know) are compatible with both declarative and interrogative complements; (ii) rogative predicates (e.g. wonder) are only compatible with interrogative complements; and (iii) anti-rogative predicates (e.g. hope) are only compatible with declarative complements. It has been suggested that these selectional properties are at least partly semantic in nature. In particular, it has been proposed that the anti-rogativity of neg-raising predicates like believe comes from the triviality in meaning that would arise with interrogative complements. This paper puts forward a similar semantic explanation for non-veridical preferential predicates such as hope, which are anti-rogative, unlike their veridical counterparts such as be happy, which are responsive

A temporal logic approach to modular design of synthetic biological circuits

We present a new approach for the design of a synthetic biological circuit whose behaviour is specified in terms of signal temporal logic (STL) formulae. We first show how to characterise with STL formulae the input/output behaviour of biological modules miming the classical logical gates (AND, NOT, OR). Hence, we provide the regions of the parameter space for which these specifications are satisfied. Given a STL specification of the target circuit to be designed and the networks of its constituent components, we propose a methodology to constrain the behaviour of each module, then identifying the subset of the parameter space in which those constraints are satisfied, providing also a measure of the robustness for the target circuit design. This approach, which leverages recent results on the quantitative semantics of Signal Temporal Logic, is illustrated by synthesising a biological implementation of an half-adder

Lexical Decomposition, Silent Categories, and the Localizer Phrase

Linguistic

Communication in a multi-cultural world

The goal of this paper is to demonstrate that procedurally structured con- cepts are central to human communication in all cultures and throughout history. This thesis is supported by an analytical survey of three very different means of communication, namely Egyptian hieroglyphs, pictures, and Inca knot writing known as khipu. My thesis is that we learn, communicate and think by means of concepts; and regardless of the way in which the meaning of an expression is encoded, the meaning is a concept. Yet we do not define concepts within the classical set-theoretical framework. Instead, within the logical framework of Transparent Intensional Logic, we explicate concepts as logical procedures that can be assigned to expressions as their context-invariant meaning. In particular, complex meanings, which structurally match complex expressions, are complex procedures whose parts are sub-procedures. The moral suggested by the paper is this. Concepts are not flat sets; rather, they are algorithmically structured abstract procedures. Unlike sets, concepts have constituent sub-procedures that can be executed in order to arrive at the product of the procedure (if any). Not only particular parts matter, but also the way of combining these parts into one whole ‘instruction’ that can be followed, understood, executed, learnt, etc., matters.Web of Science21221819