LEADER 03216nam 2200613Ia 450 001 9910453540003321 005 20200520144314.0 010 $a1-84642-842-4 035 $a(CKB)1000000000550272 035 $a(EBL)366692 035 $a(OCoLC)437234330 035 $a(SSID)ssj0000358413 035 $a(PQKBManifestationID)11272711 035 $a(PQKBTitleCode)TC0000358413 035 $a(PQKBWorkID)10359959 035 $a(PQKB)10327893 035 $a(MiAaPQ)EBC366692 035 $a(Au-PeEL)EBL366692 035 $a(CaPaEBR)ebr10257013 035 $a(EXLCZ)991000000000550272 100 $a20080321d2009 uy 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 10$aCounselling and reflexive research in healthcare$b[electronic resource] $eworking therapeutically with clients with inflammatory bowel disease /$fGillian Thomas 210 $aLondon ;$aPhiladelphia $cJessica Kingsley Publishers$d2009 215 $a1 online resource (179 p.) 300 $aDescription based upon print version of record. 311 $a1-85302-866-5 320 $aIncludes bibliographical references (p. 167-170) and indexes. 327 $aFRONT COVER; Counselling and Reflexive Research in Healthcare; Working Therapeutically with Clients with Inflammatory Bowel Disease; Contents; Preface; Foreword; Chapter One: Introduction; Chapter Two: Methodology and methods; Chapter Three: A philosophical framework for researching clients' experiences; Chapter Four: The experience of the counsellor; Chapter Five: Physical, medical and social issues for clients; Chapter Six: Emotional and psychological issues for clients; Chapter Seven: Reflections on reflexive research and ongoing counselling work; Appendices 327 $aAppendix 1: Example of the 'problem' assessment sheetAppendix 2: Example of the 'aim' assessment sheet; Appendix 3: Example 1 of 'overall' assessment sheet; Appendix 4: Example 2 of 'overall' assessment sheet; References; Subject Index; Author Index; BACK COVER 330 $aWritten for counsellors working in healthcare settings, this book explores the range of benefits of undertaking reflexive research. Gillian Thomas demonstrates how this approach can offer therapeutic benefits by increasing understanding of a condition and the interaction between the physical and emotional aspects of living with a long term disease. 606 $aCounseling$xResearch$xMethodology 606 $aCounselor and client 606 $aInflammatory bowel diseases$xPatients$xCounseling of 606 $aInflammatory bowel diseases$xPsychological aspects 608 $aElectronic books. 615 0$aCounseling$xResearch$xMethodology. 615 0$aCounselor and client. 615 0$aInflammatory bowel diseases$xPatients$xCounseling of. 615 0$aInflammatory bowel diseases$xPsychological aspects. 676 $a362.196/344 676 $a616.342 700 $aThomas$b Gillian$f1947-$0990278 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910453540003321 996 $aCounselling and reflexive research in healthcare$92265283 997 $aUNINA LEADER 02190aam 2200529I 450 001 9910709519503321 005 20260430110212.0 024 8 $aGOVPUB-C13-42e0667bdaeff814e102bbe1b695700f 035 $a(CKB)5470000002479809 035 $a(OCoLC)926741524 035 $a(DGPO)001075048 035 $a(EXLCZ)995470000002479809 100 $a20151026d1977 ua 0 101 0 $aeng 181 $2rdacontent 182 $2rdamedia 183 $2rdacarrier 200 10$aCorrosion and metal artifacts - a dialogue between conservators and archaeologists and corrosion scientists /$fB. Floyd Brown, Harry C. Burnett, W. Thomas Chase, Martha Goodway, Jerome Kruger, Marce Poubaix 210 1$aGaithersburg, MD :$cU.S. Dept. of Commerce, National Institute of Standards and Technology,$d1977. 215 $a1 online resource 225 1 $aNBS special publication ;$v479 300 $a1977. 300 $aContributed record: Metadata reviewed, not verified. Some fields updated by batch processes. 300 $aTitle from PDF title page. 320 $aIncludes bibliographical references. 606 $aAntiquities$xCollection and preservation$vCongresses 606 $aArt objects$xConservation and restoration$vCongresses 606 $aCorrosion and anti-corrosives$vCongresses 608 $aConference papers and proceedings.$2lcgft 615 0$aAntiquities$xCollection and preservation 615 0$aArt objects$xConservation and restoration 615 0$aCorrosion and anti-corrosives 700 $aBrown$b B. F$g(Benjamin Floyd),$f1920-1981.$01391794 701 $aBrown$b B. F$g(Benjamin Floyd),$f1920-1981.$01391794 701 $aBurnett$b Harry C$01391795 701 $aChase$b W. T$g(William Thomas)$01391796 701 $aGoodway$b Martha$01391797 701 $aKruger$b Jerome$0287936 701 $aPourbaix$b Marce$01391798 712 02$aUnited States.$bNational Bureau of Standards. 801 0$bNBS 801 1$bNBS 801 2$bGPO 906 $aBOOK 912 $a9910709519503321 996 $aCorrosion and metal artifacts - a dialogue between conservators and archaeologists and corrosion scientists$93445905 997 $aUNINA LEADER 05274nam 22007815 450 001 9910726280003321 005 20260605212400.0 010 $a9783031269042$b(electronic bk.) 024 7 $a10.1007/978-3-031-26904-2 035 $a(MiAaPQ)EBC7253098 035 $a(Au-PeEL)EBL7253098 035 $a(OCoLC)1381711965 035 $a(DE-He213)978-3-031-26904-2 035 $a(PPN)270617094 035 $a(CKB)26773174400041 035 $a(EXLCZ)9926773174400041 100 $a20230523d2023 u| 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aAlgorithms for Constructing Computably Enumerable Sets /$fby Kenneth J. Supowit 205 $a1st ed. 2023. 210 1$aCham :$cSpringer International Publishing :$cImprint: Birkhäuser,$d2023. 215 $a1 online resource (191 pages) 225 1 $aComputer Science Foundations and Applied Logic,$x2731-5762 311 08$aPrint version: Supowit, Kenneth J. Algorithms for Constructing Computably Enumerable Sets Cham : Springer International Publishing AG,c2023 9783031269035 320 $aIncludes bibliographical references. 327 $a1 Index of notation and terms -- 2 Set theory, requirements, witnesses -- 3 What?s new in this chapter? -- 4 Priorities (a splitting theorem) -- 5 Reductions, comparability (Kleene-Post Theorem) -- 6 Finite injury (Friedberg-Muchnik Theorem) -- 7 The Permanence Lemma -- 8 Permitting (Friedberg-Muchnik below C Theorem) -- 9 Length of agreement (Sacks Splitting Theorem) -- 10 Introduction to infinite injury -- 11 A tree of guesses (Weak Thickness Lemma) -- 12 An infinitely branching tree (Thickness Lemma) -- 13 True stages (another proof of the Thickness Lemma) -- 14 Joint custody (Minimal Pair Theorem) -- 15 Witness lists (Density Theorem) -- 16 The theme of this book: delaying tactics -- Appendix A: a pairing function -- Bibliograph -- Solutions to selected exercises. 330 $aLogicians have developed beautiful algorithmic techniques for the construction of computably enumerable sets. This textbook presents these techniques in a unified way that should appeal to computer scientists. Specifically, the book explains, organizes, and compares various algorithmic techniques used in computability theory (which was formerly called "classical recursion theory"). This area of study has produced some of the most beautiful and subtle algorithms ever developed for any problems. These algorithms are little-known outside of a niche within the mathematical logic community. By presenting them in a style familiar to computer scientists, the intent is to greatly broaden their influence and appeal. Topics and features: · All other books in this field focus on the mathematical results, rather than on the algorithms. · There are many exercises here, most of which relate to details of the algorithms. · The proofs involving priority trees are written here in greater detail, and with more intuition, than can be found elsewhere in the literature. · The algorithms are presented in a pseudocode very similar to that used in textbooks (such as that by Cormen, Leiserson, Rivest, and Stein) on concrete algorithms. · In addition to their aesthetic value, the algorithmic ideas developed for these abstract problems might find applications in more practical areas. Graduate students in computer science or in mathematical logic constitute the primary audience. Furthermore, when the author taught a one-semester graduate course based on this material, a number of advanced undergraduates, majoring in computer science or mathematics or both, took the course and flourished in it. Kenneth J. Supowit is an Associate Professor Emeritus, Department of Computer Science & Engineering, Ohio State University, Columbus, Ohio, US. 410 0$aComputer Science Foundations and Applied Logic,$x2731-5762 606 $aComputer science 606 $aComputable functions 606 $aRecursion theory 606 $aSet theory 606 $aComputer science?Mathematics 606 $aTheory of Computation 606 $aComputability and Recursion Theory 606 $aSet Theory 606 $aTheory and Algorithms for Application Domains 606 $aMathematics of Computing 606 $aMatemātica discreta$2thub 606 $aTeoria de conjunts$2thub 606 $aAlgorismes$2thub 608 $aLlibres electrōnics$2thub 615 0$aComputer science. 615 0$aComputable functions. 615 0$aRecursion theory. 615 0$aSet theory. 615 0$aComputer science?Mathematics. 615 14$aTheory of Computation. 615 24$aComputability and Recursion Theory. 615 24$aSet Theory. 615 24$aTheory and Algorithms for Application Domains. 615 24$aMathematics of Computing. 615 7$aMatemātica discreta 615 7$aTeoria de conjunts. 615 7$aAlgorismes 676 $a004.0151 676 $a004.0151 700 $aSupowit$b Kenneth J.$01359561 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 912 $a9910726280003321 996 $aAlgorithms for Constructing Computably Enumerable Sets$93374026 997 $aUNINA