Hierdie studie is 'n kwalitatiewe ekosistemiese ondersoek van die fenomeen Chroniese Moegheidsindroom (CMS) . Die paradigmaverskuiwing vanaf die Cartesiaans-Newtoniaanse epistemologie na die kubernetiese epistemologie, het 'n aantal belangrike implikasies vir die bestudering en konseptualisering van CMS, soos uiteengesit in hierdie studie. 'n Bespreking van die konseptualisering en behandeling van CMS vanuit die tradisionele, reduksionistiese navorsing word verskaf. Die aannames van twee-orde kubernetika en sosiale konstruksionisme, is bespreek en toegepas op die beskrywing van twee sisteme waarin CMS voorkom. Die navorsingsmetodologie van die studie is gegenereer op grand van die genoemde teoretiese aannames. Die implikasies van die toepassing van die ekosistemiese epistemologie vir die konseptualisering van CMS word uitgewys. Die herkonseptualisering van CMS as 'n transisieproses word bespreek en riglyne vir verdere navorsing en psigoterapie word aangedui. Die huidige studie bied 'n beskrywing van die unieke betekenisse en oplossings wat gesinne genereer tydens die veranderings wat CMS vergesel. / The present study is a qualitative ecosystemic exploration of the phenomenon known as chronic fatigue syndrome (CFS). The paradigm shift from the Newtonian epistemology to the epistemology of cybernetics, has important implication for research and the conceptualisation of CFS, as indicated in the study. The traditional, reductionist conceptualisation of CFS in research and treatment methods, is discussed. The suppositions of second order cybernetics and social constructionism, are discussed and applied in the description of two systems where CFS occurs. The research methodology of the present study is generated from the theoretical suppositions. Die implications of the use of the ecosystemic epistemology for the conceptualisation of CFS are indicated. The re-conceptualisation of CFS as a transition process is discussed and guidelines are given for future research and psychotherapy. The present study is a description of the unique meanings and solutions that the families generated during the changes that accompany CFS. / Psychology / M.A. (Kliniese Sielkunde)

Hierdie studie is 'n kwalitatiewe ekosistemiese ondersoek van die fenomeen Chroniese Moegheidsindroom (CMS) . Die paradigmaverskuiwing vanaf die Cartesiaans-Newtoniaanse epistemologie na die kubernetiese epistemologie, het 'n aantal belangrike implikasies vir die bestudering en konseptualisering van CMS, soos uiteengesit in hierdie studie. 'n Bespreking van die konseptualisering en behandeling van CMS vanuit die tradisionele, reduksionistiese navorsing word verskaf. Die aannames van twee-orde kubernetika en sosiale konstruksionisme, is bespreek en toegepas op die beskrywing van twee sisteme waarin CMS voorkom. Die navorsingsmetodologie van die studie is gegenereer op grand van die genoemde teoretiese aannames. Die implikasies van die toepassing van die ekosistemiese epistemologie vir die konseptualisering van CMS word uitgewys. Die herkonseptualisering van CMS as 'n transisieproses word bespreek en riglyne vir verdere navorsing en psigoterapie word aangedui. Die huidige studie bied 'n beskrywing van die unieke betekenisse en oplossings wat gesinne genereer tydens die veranderings wat CMS vergesel. / The present study is a qualitative ecosystemic exploration of the phenomenon known as chronic fatigue syndrome (CFS). The paradigm shift from the Newtonian epistemology to the epistemology of cybernetics, has important implication for research and the conceptualisation of CFS, as indicated in the study. The traditional, reductionist conceptualisation of CFS in research and treatment methods, is discussed. The suppositions of second order cybernetics and social constructionism, are discussed and applied in the description of two systems where CFS occurs. The research methodology of the present study is generated from the theoretical suppositions. Die implications of the use of the ecosystemic epistemology for the conceptualisation of CFS are indicated. The re-conceptualisation of CFS as a transition process is discussed and guidelines are given for future research and psychotherapy. The present study is a description of the unique meanings and solutions that the families generated during the changes that accompany CFS. / Psychology / M.A. (Kliniese Sielkunde)

Cette thèse étudie les structures dont la théorie au second ordremonadique est décidable, et en particulier la hiérarchie à pile. Onpeut définir celle-ci comme la hiérarchie pour $n$ des graphesd'automates à piles imbriquées $n$ fois ; une définition externe, partransformations de graphes, est également disponible. Nous nousintéressons à l'exemple des ordinaux. Nous montrons que les ordinauxplus petits que $epsilon_0$ sont dans la hiérarchie, ainsi que des graphesporteurs de plus d'information, que l'on appelle "graphecouvrants''. Nous montrons ensuite l'inverse : tous les ordinaux de lahiérarchie sont plus petits que $epsilon_0$. Ce résultat utilise le fait queles ordres d'un niveau sont en fait isomorphes aux structures desfeuilles des arbres déterministes dans l'ordre lexicographique, aumême niveau. Plus généralement, nous obtenons une caractérisation desordres linéaires dispersés dans la hiérarchie. Dans un troisièmetemps, nous resserons l'intérêt aux ordres de type $omega$ --- les mots infinis --- pour montrer que les mots du niveau 2 sont les motsmorphiques, ce qui nous amène à une nouvelle extension au niveau 3 / This thesis studies the structures with decidable monadic second-ordertheory, and in particular the pushdown hierarchy. The latter can bedefined as the family for $n$ of pushdown graphs with $n$ timesimbricated stacks ; another definition is by graph transformations. Westudy the example of ordinals. We show that ordinals smaller that $epsilon_0$are in the hierarchy, along with graphs called "covering graphs'', which carry more data than ordinals. We show then the converse : allordinals of the hierarchy are smaller than $epsilon_0$. This result uses thefact that linear orders of a level are actually isomorphic to thestructure of leaves of deterministic trees by lexicographic ordering, at the same level. More generally, we obtain a characterisation ofscattered linear orders in the hierarchy. We finally focus on the caseof orders of type $omega$ --- infinite words --- and show that morphicwords are exactly words of the second level of the hierarchy. Thisleads us to a new definition of words for level 3

Esta dissertação estabelece a incompletude de um sistema formal cujas únicas constantes não-lógicas são 0 e s (respectivamente, o número natural 0 e a função sucessor segundo a interpretação standard), fundamentando-se, para tanto, em um teorema cuja prova necessita essencialmente da maquinária lógica de segunda-ordem e que foi designado de Teorema das Definições Recursivas. / We establish here the incompleteness of the formal system S2 for arithmetic_a formal system whose signature is {0, s}_by means of the Theorem of the Definition by Recursion (TDR). However, unlike the standard proofs of incompleteness, the proof of TDR, by virtue of restricted signature, uses essentially the power of second-order logic.

Esta dissertação estabelece a incompletude de um sistema formal cujas únicas constantes não-lógicas são 0 e s (respectivamente, o número natural 0 e a função sucessor segundo a interpretação standard), fundamentando-se, para tanto, em um teorema cuja prova necessita essencialmente da maquinária lógica de segunda-ordem e que foi designado de Teorema das Definições Recursivas. / We establish here the incompleteness of the formal system S2 for arithmetic_a formal system whose signature is {0, s}_by means of the Theorem of the Definition by Recursion (TDR). However, unlike the standard proofs of incompleteness, the proof of TDR, by virtue of restricted signature, uses essentially the power of second-order logic.

<p>In the first part of this thesis, we contribute to the semantics of typed object calculus by giving (a) a category-theoretic denotational semantics using partial maps making use of an algebraic compactness assumption, (b) a notion of "wrappers'' by which algebraic datatypes can be represented as object types, and (c) proofs of computational soundness and adequacy of typed object calculus via Plotkin's FPC (with lazy operational semantics), thus making models of FPC suitable also for first-order typed object calculus (with recursive objects supporting method update, but not subtyping). It follows that a valid equation in the model induces operationally congruent terms in the language, so that program algebras can be studied. For (c), we also develop an extended first-order typed object calculus, and prove subject reduction. The second part of the thesis concerns recursion principles on datatypes including the untyped lambda calculus as a special case. Freyd showed that in certain domain theoretic categories, locally continuous functors have minimal invariants, which possess a structure that he termed dialgebra. This gives rise to a category of dialgebras and homomorphisms, where the minimal invariants are initial, inducing a powerful recursion scheme (direcursion) on a complete partial order. We identify a problem that appears when we translate (co)iterative functions to direcursion, and as a solution to this problem we develop a recursion scheme (primitive direcursion). This immediately gives a number of examples of direcursive functions, improving on the situation in the literature where only a few examples have appeared. By means of a case study, this line of work is connected to object calculus models.</p> / Delarbete II är även publicerad som Teknisk rapport, 2007, Oct, No2.

The Moment Recursion (MR) models are a class of models for tactical planning of job shops or other processing networks. The MR model can be used to determine or approximate the first two moments of production quantities and queue lengths at each work station of a job shop. Knowledge of these two moments is sufficient to carry out a variety of performance evaluation, optimization and decision-support applications. This paper presents a literature survey of the Moment-Recursion models. Limitations in the existing research and possible research opportunities are also discussed. Based on the research opportunities discussed, we are in the process of building a model that attempts to fill these research gaps. / Singapore-MIT Alliance (SMA)

In the first part of this thesis, we contribute to the semantics of typed object calculus by giving (a) a category-theoretic denotational semantics using partial maps making use of an algebraic compactness assumption, (b) a notion of "wrappers'' by which algebraic datatypes can be represented as object types, and (c) proofs of computational soundness and adequacy of typed object calculus via Plotkin's FPC (with lazy operational semantics), thus making models of FPC suitable also for first-order typed object calculus (with recursive objects supporting method update, but not subtyping). It follows that a valid equation in the model induces operationally congruent terms in the language, so that program algebras can be studied. For (c), we also develop an extended first-order typed object calculus, and prove subject reduction. The second part of the thesis concerns recursion principles on datatypes including the untyped lambda calculus as a special case. Freyd showed that in certain domain theoretic categories, locally continuous functors have minimal invariants, which possess a structure that he termed dialgebra. This gives rise to a category of dialgebras and homomorphisms, where the minimal invariants are initial, inducing a powerful recursion scheme (direcursion) on a complete partial order. We identify a problem that appears when we translate (co)iterative functions to direcursion, and as a solution to this problem we develop a recursion scheme (primitive direcursion). This immediately gives a number of examples of direcursive functions, improving on the situation in the literature where only a few examples have appeared. By means of a case study, this line of work is connected to object calculus models. / Delarbete II är även publicerad som Teknisk rapport, 2007, Oct, No2.

This thesis develops the phonological model for the Stockholm Swedish intonation system. Though previous research provides a general model of this system, many phonological aspects of it have remained understudied. The intonational options that are available to speakers of Stockholm Swedish are discussed, and it is argued that Stockholm Swedish provides evidence for complex branching of phonological domains. Specifically, it is argued that so called focal accents, which are referred to as (H)LH-accents in the present work, have essentially two different functions. First, they signal information structural categories such as focus. Second, they signal left edges of Intonation Phrases (IP). It is also argued that a wide range of options exist in the post-nuclear area. Six types of contours for such areas are distinguished, plus one additional rising contour when there are no post-nuclear accents. Based on these findings, I present an account of the branching options for the phonological categories in the Stockholm Swedish prosodic hierarchy. I argue that there is evidence for recursive phonological structures in Stockholm Swedish, i.e. that a mother node and a daughter node can belong to the same phonological category. Also, Stockholm Swedish provides evidence for a distinction between prosodic coordination (equal sister nodes) and prosodic adjunction (unequal sister nodes). Prosodic structure is mapped onto syntactic structure via a set of variably ranked Optimality Theoretic constraints. The relation between phonological and syntactic structure shows that the phonology prefers prosodic coordination (equal sisters) over adjunction (unequal sisters). The material for the study comprises a corpus of approximately 420 read sentences, which were specifically designed to test various phonological hypotheses, and approximately 17 minutes of uncontrolled speech.

By enlarging the spatial and temporal spectral problems within a certain Lie algebra, a hierarchy of integrable couplings of the Kaup-Newell soliton equations is constructed. The recursion operator of the resulting hierarchy of integrable couplings is explicitly computed. The integrability of the new coupling hierarchy is exhibited by showing the existence of infinitely many commuting symmetries.