The Scott rank of a countable structure is a measure, coming from the proof of Scott’s isomorphism theorem, of the complexity of that structure. The Scott spectrum of a theory (by which we mean a sentence of Lω1ω) is the set of Scott ranks of countable models of that theory. In ZFC + PD we give a descriptive-set-theoretic classification of the sets of ordinals which are the Scott spectrum of a ...

In this paper, the definition of meet-continuity on $L$-directedcomplete posets (for short, $L$-dcpos) is introduced. As ageneralization of meet-continuity on crisp dcpos, meet-continuity on$L$-dcpos, based on the generalized Scott topology, ischaracterized. In particular, it is shown that every continuous$L$-dcpo is meet-continuous and $L$-continuous retracts ofmeet-continuous $L$-dcpos are al...

Some 40 years ago, Dana Scott proved that every countable Scott set is the standard system of a model of PA. Two decades later, Knight and Nadel extended his result to Scott sets of size ω1. Here, I show that assuming the Proper Forcing Axiom (PFA), every proper Scott set is the standard system of a model of PA. I define that a Scott set X is proper if it is arithmetically closed and the quotie...

in this work, we analyse a pair of two-dimensional coupled reaction-diusion equations known as the gray-scott model, in which spot patterns have been observed. we focus on stationary patterns, and begin by deriving the asymptotic scaling of the parameters and variables necessary for the analysis of these patterns. a complete bifurcation study of these solutions is presented. the main mathematic...

My research combines analysis, computation, and modeling to understand problems stemming from general pattern forming systems. My thesis work applied dynamical systems techniques to understand localized structures in reaction-diffusion systems. Most of these patterns can be understood as stationary or traveling wave solutions to partial differential equations (PDEs). More recently I have focuse...

The M•CORE microRISC architecture has been developed to address the growing need for long battery life among today’s portable applications. In this paper, we will present the low-power design techniques and architectural trade-offs made during the development of this processor. Specifically, we will discuss the initial benchmarking, the development of the Instruction Set Architecture (ISA), the...

Effective model theory is an area of logic that analyzes the effective content of the typical notions and results of model theory and universal algebra. Typical notions in model theory and universal algebra are languages and structures, theories and models, models and their submodels, automorphisms and isomorphisms, embeddings and elementary embeddings. In this paper languages, structures, and ...

Recently, J. D. Lawson encouraged the domain theory community to consider the scientific program of developing domain theory in the wider context of T0 spaces instead of restricting to posets. In this paper, we respond to this calling with an attempt to formulate a topological version of the Scott Convergence Theorem, i.e., order-theoretic characterisation of those posets for which the Scott-co...