Dissertations / Theses on the topic 'Set Theory'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Set Theory.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
Dieterly, Andrea K. "Set Theory." Bowling Green State University / OhioLINK, 2011. http://rave.ohiolink.edu/etdc/view?acc_num=bgsu1304689030.
Full textCorella, Francisco. "Mechanizing set theory." Thesis, University of Cambridge, 1989. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.334076.
Full textAtmai, Rachid. "Contributions to Descriptive Set Theory." Thesis, University of North Texas, 2015. https://digital.library.unt.edu/ark:/67531/metadc804953/.
Full textDance, Cody. "Contributions to Descriptive Set Theory." Thesis, University of North Texas, 2016. https://digital.library.unt.edu/ark:/67531/metadc955115/.
Full textLongo, Cristiano. "Set theory for knowledge representation." Doctoral thesis, Università di Catania, 2012. http://hdl.handle.net/10761/1031.
Full textCorson, Samuel M. "Applications of Descriptive Set Theory in Homotopy Theory." BYU ScholarsArchive, 2010. https://scholarsarchive.byu.edu/etd/2401.
Full textPopham, S. J. "Some studies in 'finitary' set theory." Thesis, University of Bristol, 1985. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.372022.
Full textFernandes, Arias A. "The exceptional set in Nevanlinna theory." Thesis, Imperial College London, 1985. http://hdl.handle.net/10044/1/37689.
Full textBarton, Neil. "Executing Gödel's programme in set theory." Thesis, Birkbeck (University of London), 2017. http://bbktheses.da.ulcc.ac.uk/201/.
Full textAhmed, Shehzad. "Progressive Ideals in Combinatorial Set Theory." Ohio University / OhioLINK, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1554379497651916.
Full textKieftenbeld, Vincent. "Three Topics in Descriptive Set Theory." Thesis, University of North Texas, 2010. https://digital.library.unt.edu/ark:/67531/metadc28441/.
Full textZiegler, Albert. "Large sets in constructive set theory." Thesis, University of Leeds, 2014. http://etheses.whiterose.ac.uk/8370/.
Full textPearsall, Sam Alfred. "The Cantor set." CSUSB ScholarWorks, 1999. https://scholarworks.lib.csusb.edu/etd-project/1528.
Full textSchlee, Glen A. (Glen Alan). "On the Development of Descriptive Set Theory." Thesis, University of North Texas, 1988. https://digital.library.unt.edu/ark:/67531/metadc500836/.
Full textTsiknis, George Konstantinos. "Applications of a natural deduction set theory." Thesis, University of British Columbia, 1991. http://hdl.handle.net/2429/32181.
Full textScience, Faculty of
Computer Science, Department of
Graduate
Mao, Hongwei. "Estimating labour productivity using fuzzy set theory." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape8/PQDD_0019/MQ47065.pdf.
Full textKusalik, Timothy. "The continuum hypothesis in algebraic set theory." Thesis, McGill University, 2009. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=32368.
Full textDans "Sheaf Theory and the Continuum Hypothesis", Lawvere et Tierney ont démontré la compatibilité de la négation de l'hypothèse du continu avec la théorie des topos qui ressemblent au Set. Dans cette thèse, j'universalise le résultat de Lawvere-Tierney dans deux directions. Le résultat de Lawvere-Tierney compte sur le principe du tiers exclu et l'axiome du choix, et je fournis une formulation et une démonstration de la consistance de la négation de l'hypothèse du continu qui abandonne cette assomption. Aussi, j'universalise tous ces résultats sur l'hypothèse du continu et sa consistance de la contexte de la théorie du topos à la contexte de la théorie algébrique des ensembles.
Sharma, Jonathan. "STASE: set theory-influenced architecture space exploration." Diss., Georgia Institute of Technology, 2014. http://hdl.handle.net/1853/52330.
Full textIncurvati, Luca. "Set theory : its justification, logic and extent." Thesis, University of Cambridge, 2010. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.608586.
Full textFendrich, Samuel. "From axiomatization to generalizatrion of set theory." Thesis, London School of Economics and Political Science (University of London), 1987. http://etheses.lse.ac.uk/3272/.
Full textLee, Cary. "Descriptive set theory of reduced abelianp-groups /." The Ohio State University, 1995. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487864485228735.
Full textMecay, Stefan Terence. "Maximum-Sized Matroids with no Minors Isomorphic to U2,5, F7, F7¯, OR P7." Thesis, University of North Texas, 2000. https://digital.library.unt.edu/ark:/67531/metadc2514/.
Full textKi, Haseo Kechris A. S. Kechris A. S. "Topics in descriptive set theory related to number theory and analysis /." Diss., Pasadena, Calif. : California Institute of Technology, 1995. http://resolver.caltech.edu/CaltechETD:etd-10112007-111738.
Full textGebser, Martin. "Proof theory and algorithms for answer set programming." Phd thesis, Universität Potsdam, 2011. http://opus.kobv.de/ubp/volltexte/2011/5542/.
Full textAntwortmengenprogrammierung (engl. Answer Set Programming; ASP) ist ein Paradigma zum deklarativen Problemlösen, wobei Problemstellungen durch logische Programme beschrieben werden, sodass bestimmte Modelle, Antwortmengen genannt, zu Lösungen korrespondieren. Die zunehmenden praktischen Anwendungen von ASP verlangen nach performanten Werkzeugen zum Lösen komplexer Problemstellungen. ASP integriert diverse Konzepte aus verwandten Bereichen. Insbesondere sind automatisierte Techniken für die Suche nach Antwortmengen durch Verfahren zum Lösen des aussagenlogischen Erfüllbarkeitsproblems (engl. Boolean Satisfiability; SAT) inspiriert. Letztere beruhen auf soliden beweistheoretischen Grundlagen, wohingegen es für ASP kaum formale Systeme gibt, um Lösungsmethoden einheitlich zu beschreiben und miteinander zu vergleichen. Weiterhin basiert der Erfolg moderner Verfahren zum Lösen von SAT entscheidend auf fortgeschrittenen Suchtechniken, die in gängigen Methoden zur Antwortmengenberechnung nicht etabliert sind. Diese Arbeit entwickelt beweistheoretische Grundlagen und fortgeschrittene Suchtechniken im Kontext der Antwortmengenberechnung. Unsere formalen Beweissysteme ermöglichen die Charakterisierung, den Vergleich und die Analyse vorhandener Lösungsmethoden für ASP. Außerdem entwerfen wir moderne Verfahren zum Lösen von ASP, die fortgeschrittene Suchtechniken aus dem SAT-Bereich integrieren und erweitern. Damit trägt diese Arbeit sowohl zum tieferen Verständnis von Lösungsmethoden für ASP und ihrer Beziehungen untereinander als auch zu ihrer Verbesserung durch die Erschließung fortgeschrittener Suchtechniken bei. Die zentrale Idee unseres Ansatzes besteht darin, Atome und komposite Konstrukte innerhalb von logischen Programmen gleichermaßen mit aussagenlogischen Variablen zu assoziieren. Dies ermöglicht die Isolierung fundamentaler Inferenzschritte, die wir in formalen Charakterisierungen von Lösungsmethoden für ASP selektiv miteinander kombinieren können. Darauf aufbauend zeigen wir, dass unterschiedliche Einschränkungen von Fallunterscheidungen zwangsläufig zu exponentiellen Effizienzunterschieden zwischen den charakterisierten Methoden führen. Wir generalisieren unseren beweistheoretischen Ansatz auf logische Programme mit erweiterten Sprachkonstrukten und weisen analytisch nach, dass das Treffen bzw. Unterlassen von Fallunterscheidungen auf solchen Konstrukten ebenfalls exponentielle Effizienzunterschiede bedingen kann. Die zuvor beschriebenen fundamentalen Inferenzschritte nutzen wir zur Extraktion inhärenter Bedingungen, denen Antwortmengen genügen müssen. Damit schaffen wir eine Grundlage für den Entwurf moderner Lösungsmethoden für ASP, die fortgeschrittene, ursprünglich für SAT konzipierte, Suchtechniken mit einschließen und darüber hinaus einen transparenten Technologietransfer zwischen Verfahren zum Lösen von ASP und SAT erlauben. Neben der Suche nach einer Antwortmenge behandeln wir ihre Aufzählung, sowohl für gesamte Antwortmengen als auch für Projektionen auf ein Subvokabular. Hierfür entwickeln wir neuartige Methoden, die wiederholungsfreies Aufzählen in polynomiellem Platz ermöglichen, ohne die Suche zu beeinflussen und ggf. zu behindern, bevor Antwortmengen berechnet wurden.
Rittberg, Colin Jakob. "Methods, goals and metaphysics in contemporary set theory." Thesis, University of Hertfordshire, 2016. http://hdl.handle.net/2299/17218.
Full textLiu, Yongwen. "Cloud services selection based on rough set theory." Thesis, Troyes, 2016. http://www.theses.fr/2016TROY0018/document.
Full textWith the development of the cloud computing technique, users enjoy various benefits that high technology services bring. However, there are more and more cloud service programs emerging. So it is important for users to choose the right cloud service. For cloud service providers, it is also important to improve the cloud services they provide, in order to get more customers and expand the scale of their cloud services.Rough set theory is a good data processing tool to deal with uncertain information. It can mine the hidden knowledge or rules on data sets. The main purpose of this thesis is to apply rough set theory to help cloud users make decision about cloud services. In this work, firstly, a framework using the rough set theory in cloud service selection is proposed, and we give an example using rough set in cloud services selection to illustrate and analyze the feasibility of our approach. Secondly, the proposed cloud services selection approach has been used to evaluate parameters importance based on the users’ preferences. Finally, we perform experiments on large scale dataset to verity the feasibility of our proposal.The performance results can help cloud service users to make the right decision and help cloud service providers to target the improvement about their cloud services
Romanovski, Iakov. "Connections between descriptive set theory and HF-logic." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp03/MQ37160.pdf.
Full textRaghfar, Hossein. "Application of fuzzy set theory to poverty analysis." Thesis, University of Essex, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.343582.
Full textArtemenko, A. "The main set of foreign exchange regulation theory." Thesis, Sumy State University, 2019. https://essuir.sumdu.edu.ua/handle/123456789/77008.
Full textSaboo, Jai Vardhan. "An investment analysis model using fuzzy set theory." Thesis, Virginia Polytechnic Institute and State University, 1989. http://hdl.handle.net/10919/50087.
Full textMaster of Science
incomplete_metadata
Conley, Clinton Taylor. "Some applications of combinatorics in descriptive set theory." Diss., Restricted to subscribing institutions, 2009. http://proquest.umi.com/pqdweb?did=1876263421&sid=1&Fmt=2&clientId=1564&RQT=309&VName=PQD.
Full textChen, Ray-Ming. "Independence and conservativity results for intuitionistic set theory." Thesis, University of Leeds, 2010. http://etheses.whiterose.ac.uk/1439/.
Full text朱鏡江 and Kan-Kong Chu. "Exceptional set problems on some additive equations." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1994. http://hub.hku.hk/bib/B31212220.
Full textChu, Kan-Kong. "Exceptional set problems on some additive equations /." [Hong Kong] : University of Hong Kong, 1994. http://sunzi.lib.hku.hk/hkuto/record.jsp?B14763898.
Full textBuquicchio, Luke J. "Variational Open Set Recognition." Digital WPI, 2020. https://digitalcommons.wpi.edu/etd-theses/1377.
Full textEdvardsson, Karin. "How to set ratiohnal environmental goals : theory and applications." Licentiate thesis, KTH, Philosophy and History of Technology, 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-3875.
Full textEnvironmental goals are commonly set to guide work towards ecological sustainability. The aim of this thesis is to develop a precise terminology for the description of goals in terms of properties that are important in their practical use as decision-guides and to illustrate how it can be used in evaluations of environmental policy.
Essay I (written together with Sven Ove Hansson) identifies a set of rationality criteria for individual goals and discusses them in relation to the typical function of goals. For a goal to perform its typical function, i.e., to guide and induce action, it must be precise, evaluable, approachable (attainable), and motivating.
Essay II argues that for a goal system to be rational it must not only satisfy the criteria identified in Essay I but should also be coherent. The coherence of a goal system is made up of the relations that hold among the goals, most notably relations of support and conflict, but possibly also relations of operationalization. A major part of the essay consists in a conceptual analysis of the three relations.
Essay III contains an investigation into the rationality of five Swedish environmental objectives through an application of the rationality criteria identified in Essays I-II. The paper draws the conclusion that the objectives are not sufficiently rational according to the suggested criteria. It also briefly points at some of the difficulties that are associated with the use of goals in environmental policy and managemen
Ma, Ka Leung. "In solving the dominating set problem : group theory approach." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape10/PQDD_0005/NQ40311.pdf.
Full textEdvardsson, Karin. "How to Set Rational Environmental Goals : theory and applications." Licentiate thesis, Stockholm, 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-3875.
Full textStammers, Diana. "Set theory in the perception of atonal pitch relations." Thesis, University of Cambridge, 1994. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.296742.
Full textBhattacharyya, Kakali. "Classification of rock masses based on fuzzy set theory." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2003. http://hub.hku.hk/bib/B29490352.
Full textEspíndola, Christian. "Achieving completeness: from constructive set theory to large cardinals." Doctoral thesis, Stockholms universitet, Matematiska institutionen, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-130537.
Full textReeder, Patrick F. "Internal Set Theory and Euler's Introductio in Analysin Infinitorum." The Ohio State University, 2013. http://rave.ohiolink.edu/etdc/view?acc_num=osu1366149288.
Full textSt, John Gavin. "On formally undecidable propositions of Zermelo-Fraenkel set theory." Youngstown State University / OhioLINK, 2013. http://rave.ohiolink.edu/etdc/view?acc_num=ysu1369657108.
Full textAbbas, Mujahid. "Soft Set Theory: Generalizations, Fixed Point Theorems, and Applications." Doctoral thesis, Universitat Politècnica de València, 2015. http://hdl.handle.net/10251/48470.
Full textAbbas, M. (2014). Soft Set Theory: Generalizations, Fixed Point Theorems, and Applications [Tesis doctoral no publicada]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/48470
TESIS
Anna, Slivková. "Partial closure operators and applications in ordered set theory." Phd thesis, Univerzitet u Novom Sadu, Prirodno-matematički fakultet u Novom Sadu, 2018. https://www.cris.uns.ac.rs/record.jsf?recordId=107201&source=NDLTD&language=en.
Full textU ovoj tezi uopštavamo dobro poznate veze između operatora zatvaranja, sistema zatvaranja i potpunih mreža. Uvodimo posebnu vrstu parcijalnog operatora zatvaranja, koji nazivamo oštar parcijalni operator zatvaranja, i pokazujemo da svaki oštar parcijalni operator zatvaranja jedinstveno korespondira parcijalnom sistemu zatvaranja. Dalje uvodimo posebnu vrstu parcijalnog sistema zatvaranja, nazvan glavni parcijalni sistem zatvaranja, a zatim dokazujemo teoremu reprezentacije za posete u odnosu na uvedene parcijalne operatore zatvaranja i parcijalne sisteme zatvaranja. Dalje, s obzirom na dobro poznatu vezu između matroida i geometrijskih mreža, a budući da se pojam matroida može na prirodan nacin uopštiti na parcijalne matroide (definišući ih preko parcijalnih operatora zatvaranja umesto preko operatora zatvaranja), definišemo geometrijske uređene skupove i pokazujemo da su povezani sa parcijalnim matroidima na isti način kao što su povezani i matroidi i geometrijske mreže. Osim toga, definišemo polumodularne uređene skupove i pokazujemo da su oni zaista uopštenje polumodularnih mreža i da ista veza postoji između polumodularnih i geometrijskih poseta kao što imamo između polumodularnih i geometrijskih mreža. Konačno, konstatujemo da definisani pojmovi mogu biti primenjeni na implikacione sisteme, koji imaju veliku primenu u realnom svetu, posebno u analizi velikih podataka.
Berndal, Oskar. "Logical properties of morphisms between models of set theory." Thesis, KTH, Skolan för teknikvetenskap (SCI), 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-210839.
Full textMurali, V. "A study of universal algebras in fuzzy set theory." Thesis, Rhodes University, 1988. http://hdl.handle.net/10962/d1001983.
Full textMcKenzie, Zachiri Jason. "Automorphisms of models of set theory and extensions of NFU." Thesis, University of Cambridge, 2013. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.648220.
Full textLambie-Hanson, Christopher. "Covering Matrices, Squares, Scales, and Stationary Reflection." Research Showcase @ CMU, 2014. http://repository.cmu.edu/dissertations/368.
Full textGutekunst, Todd M. "Subsets of finite groups exhibiting additive regularity." Access to citation, abstract and download form provided by ProQuest Information and Learning Company; downloadable PDF file, 128 p, 2008. http://proquest.umi.com/pqdweb?did=1605136271&sid=5&Fmt=2&clientId=8331&RQT=309&VName=PQD.
Full text