Graph comprehension is constrained by the goals of the cognitive system that processes the graph and by the context in which the graph appears. In this paper we report the results of a study using a sentence-graph verification paradigm. We recorded participants’ reaction times to indicate whether the information contained in a simple bar graph matched a written description of the graph. Aside f...

A longstanding open problem is whether there exists a non-syntactical model of the untyped λ-calculus whose theory is exactly the least λ-theory λβ . In this paper we investigate the more general question of whether the equational/order theory of a model of the untyped λ-calculus can be recursively enumerable (r.e. for brevity). We introduce a notion of effective model of λ-calculus, which cove...

A longstanding open problem is whether there exists a non-syntactical model of the untyped λ-calculus whose theory is exactly the least λ-theory λβ . In this paper we investigate the more general question of whether the equational/order theory of a model of the untyped λ-calculus can be recursively enumerable (r.e. for brevity). We introduce a notion of effective model of λ-calculus, which cove...

let $r$ be a commutative ring with identity. let $g(r)$ denote the maximal graph associated to $r$, i.e., $g(r)$ is a graph with vertices as the elements of $r$, where two distinct vertices $a$ and $b$ are adjacent if and only if there is a maximal ideal of $r$ containing both. let $gamma(r)$ denote the restriction of $g(r)$ to non-unit elements of $r$. in this paper we study the various graphi...

A longstanding open problem in lambda calculus is whether there exist continuous models of the untyped lambda calculus whose theory is exactly the λβ or the least sensible λ-theory H (generated by equating all the unsolvable terms). A related question is whether, given a class of lambda models, there are a minimal λ-theory and a minimal sensible λ-theory represented by it. In this paper, we giv...

We conducted an experiment to investigate whether spatial processing is used in graph comprehension tasks. Using an interference paradigm, we demonstrate that a graph task interfered more with performance on a spatial memory task than on a visual (non-spatial) memory task. Reaction times showed there was no speed-accuracy tradeoff. We conclude that it was the spatial nature of the graph task th...

Visual analytics emphasizes the interplay between visualization, analytical procedures performed by computers and human perceptual and cognitive activities. Human reasoning is an important element in this context. There are several theories in psychology and HCI explaining open-ended and exploratory reasoning. Five of these theories (sensemaking theories, gestalt theories, distributed cognition...

D-brane probes, Hanany-Witten setups and geometrical engineering stand as a trichotomy of the currently fashionable techniques of constructing gauge theories from string theory. Meanwhile, asymptotic freedom, finitude and IR freedom pose as a trichotomy of the beta-function behaviour in quantum field theories. Parallel thereto is a trichotomy in set theory of finite, tame and wild representatio...