We try to explain Tarski’s conception of logical notions, as it emerges from a lecture of his, delivered in 1966 and published posthumously in 1986 (History and Philosophy of Logic, 7, pp. 143-154), a conception based on the idea of invariance. The evaluation of Tarski’s proposal leads us to consider an interesting (and neglected) reply to Skolem in which Tarski hints at his own point of view o...

It is an open problem in the area of computable randomness whether Kolmogorov-Loveland randomness coincides with Martin-Löf randomness. Joe Miller and André Nies suggested some variations of Kolmogorov-Loveland randomness to approach this problem and to provide a partial solution. We show that their proposed notion of partial permutation randomness is still weaker than Martin-Löf randomness.

Let V be a finite set andM a finite collection of subsets of V . ThenM is an alignment of V if and only if M is closed under taking intersections and contains both V and the empty set. If M is an alignment of V , then the elements of M are called convex sets and the pair (V,M) is called an aligned space or a convexity space. If S ⊆ V , then the convex hull of S, denoted by CH(S), is the smalles...

Embodiment has become an important concept in many areas of cognitive science. There are, however, very different notions of exactly what embodiment is and what kind of body is required for what kind of embodied cognition. This paper identifies and contrasts four different, increasingly restrictive notions of embodiment which can roughly be characterized as (1) ‘structural coupling’ between age...

We argue that symmetric (semi)monoidal comonads provide a means to structure context-dependent notions of computation such as notions of dataflow computation (computation on streams) and of tree relabelling as in attribute evaluation. We propose a generic semantics for extensions of simply typed lambda calculus with context-dependent operations analogous to the Moggi-style semantics for effectf...

In this paper, we address the equivalence of the analytic and probabilistic notions of harmonicity in the context of general symmetric Hunt processes on locally compact separable metric spaces. Extensions to general symmetric right processes on Lusin spaces including infinite dimensional spaces are mentioned at the end of this paper. AMS 2000 Mathematics Subject Classification: Primary 60J45, 3...

This is a philosophical analysis of commonly held notions and concepts about thinking and mind. The empirically derived notions are inadequate and insufficient for a deeper understanding of thought itself, but this prephilosophical understanding of thinking leads to a more refined and profound distinction of different forms of thought and their prominent common features of aspectuality and rela...

The ingredients of typical methodologies for model based development via refinement are re-examined, and some well-known frameworks are reviewed, drawing out commonalities and differences. It is observed that the ingredients of these formalisms can frequently be ‘mixed and matched’ much more freely than is often imagined, resulting in semantic variations on the original formulations. It is also...

Secure multi-party computation (MPC, for short) is a powerful cryptographic concept which lets mutually distrusting parties collaborate without compromising their private information (beyond what is required by the functionality for which they collaborate). The functionality allowed in such a collaboration is so general that MPC subsumes virtually all other cryptographic tasks. Much of the two ...

Testability, and design for testability, are widely discussed practical issues in software engineering, especially in protocol engineering. Existing definitions (or circumscriptions) of testability seem to be either quite vague, or, if more or less formal, then dedicated only to very special system models. Testability is usually decomposed into aspects like observability and controllability, an...