Dissertations / Theses on the topic 'Stability theory[Forking 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 'Stability theory[Forking 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.
Wagner, Frank O. "Stable groups and generic types." Thesis, University of Oxford, 1990. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.258015.
Full textPourmahdian, M. "Model theory of simple theories." Thesis, University of Oxford, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.325836.
Full textCraft, Colin N. "On Morley's Categoricity Theorem with an Eye Toward Forking." Miami University / OhioLINK, 2011. http://rave.ohiolink.edu/etdc/view?acc_num=miami1323475348.
Full textPotier, Joris. "A few things about hyperimaginaries and stable forking." Doctoral thesis, Universitat de Barcelona, 2015. http://hdl.handle.net/10803/394029.
Full textEn este texto se trata, por una parte, de la relación entre grupos compactos e hiper-imaginarios acotados, y por otra parte se prueba que una teoría T tiene la propiedad de bifurcación estable si i solo si Teq la tiene.
Farina, John Dominic. "Stability properties in ring theory." Connect to a 24 p. preview or request complete full text in PDF format. Access restricted to UC campuses, 2006. http://wwwlib.umi.com/cr/ucsd/fullcit?p3237384.
Full textTitle from first page of PDF file (viewed December 8, 2006). Available via ProQuest Digital Dissertations. Vita. Includes bibliographical references (p. 86-90).
Tsaparas, Panayiotis. "Stability in adversarial queueing theory." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp04/mq28768.pdf.
Full textHaykazyan, Levon. "Aspects of nonelementary stability theory." Thesis, University of Oxford, 2016. https://ora.ox.ac.uk/objects/uuid:940cd0bf-e4bb-4074-a521-d3c139d16743.
Full textPalacín, Cruz Daniel. "Forking in simple theories and CM-triviality." Doctoral thesis, Universitat de Barcelona, 2012. http://hdl.handle.net/10803/84023.
Full textThe development of first-order stable theories required two crucial abstract notions: forking independence, and the related notion of canonical base. Forking independence generalizes the linear independence in vector spaces and the algebraic independence in algebraically closed fields. On the other hand, the concept of canonical base generalizes the field of definition of an algebraic variety. The general theory of independence adapted to simple theories, a class of first-order theories which includes all stable theories and other interesting examples such as algebraically closed fields with an automorphism and the random graph. Nevertheless, in order to obtain canonical bases for simple theories, the model-theoretic development of hyperimaginaries --equivalence classes of arbitrary tuple modulo a type-definable (without parameters) equivalence relation-- was required. In the present thesis we deal with topics around the geometry of forking in simple theories. Our first goal is to study generalizations of the non ample hierarchy which will code the complexity of forking with respect to a family of partial types. We introduce two hierarchies: the non (weak) ample hierarchy with respect to a fixed family of partial types. If we work with respect to the family of bounded types, these generalizations correspond to the ordinary non ample hierarchy. Recall that in the ordinary non ample hierarchy the first and the second level correspond to one-basedness and CM-triviality, respectively. The first level of the non weak ample hierarchy with respect to some fixed family of partial types states that the type of the canonical base over a realization is analysable in the family. Considering the family of regular non one-based types, the first level of the non weak ample hierarchy corresponds to the weak version of the Canonical Base Property studied by Chatzidakis and Pillay. We generalize Chatzidakis' result showing that in any simple theory with enough regular types, the canonical base of a type over a realization is analysable in the family of regular non one-based types. We hope that this result can be useful for the applications; for instance, the Canonical Base Property plays an essential role in the proof of Mordell-Lang for function fields in characteristic zero and Manin-Mumford due to Hrushovski. Our second aim is to use combinatorial properties of forking independence to solve elimination of hyperimaginaries problems. For this we assume the theory to be simple and CM-trivial. This implies that the forking independence is well-behaved. Our goal is to prove that any simple CM-trivial theory which eliminates finitary hyperimaginaries --hyperimaginaries which are definable over a finite tuple-- eliminates all hyperimaginaries. Using a result due to Kim, small simple CM-trivial theories eliminate hyperimaginaries. It is worth mentioning that all currently known omega-categorical simple theories are CM-trivial, even those obtained by an ab initio Hrushovski construction. To conclude, we study a classification problem inside simple theories. We study the class of simple low theories, which includes all stable theories and supersimple theories of finite D-rank. In addition, we prove that it also includes the class of simple theories of bounded finite weight. Moreover, we partially solve a question posed by Casanovas and Wagner: Are all omega-categorical simple theories low? We solve affirmatively this question under the assumption of CM-triviality. In fact, our proof exemplifies that the geometry of forking independence in a possible counterexample cannot come from finite sets.
De, Bruyne Peter J. J. "Aspects of solar coronal stability theory." Thesis, University of St Andrews, 1991. http://hdl.handle.net/10023/14071.
Full textCerri, Andrea <1978>. "Stability and computation in multidimensional size theory." Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2007. http://amsdottorato.unibo.it/562/.
Full textDagbovie, Ayawoa. "Applications of stability theory to ecological problems." Thesis, Heriot-Watt University, 2013. http://hdl.handle.net/10399/2795.
Full textBahsoon, Rami Khalil. "Evaluating architectural stability with real options theory." Thesis, University College London (University of London), 2006. http://discovery.ucl.ac.uk/1445303/.
Full textLuo, Xiao 1975. "Information, knowledge, and stability : essays in game theory." Thesis, McGill University, 2000. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=36778.
Full textChapter 2 offers a general framework for analyzing complex economic and social environments. Specifically, I introduce new notions of a general system and a ϕ-stable set. By making use of Tarski's fixed point theorem, I then establish the existence of a ϕ-stable set. I further apply the proposed notions to game theory, e.g., rationalizability is derived from the largest ϕ-stable set.
Chapter 3 establishes epistemic foundations for the criterion of "stability." Specifically, in strategic games, achieving common knowledge of rationality (CKR) implies an internally ϕ-stable set that is contained in an externally ϕ-stable set and, moreover, whenever mutually known, a ϕ-stable set is implied by rationality alone. In the case of two-person games, achieving CKR implies a ϕ-stable set. In extensive games with perfect information, achieving CKR implies a unique ϕ-stable set. On the other hand, in both strategic and extensive games, any of the commonly known ϕ-stable sets implies CKR. Furthermore, any ϕ-stable set can be achieved in terms of CKR.
Chapter 4 presents a new solution concept of stable equilibrium in beliefs (SEB) by assuming it is common knowledge that players are uncertainty averse. By making use of an appealing criterion of "stability," an SEB is defined as a strategy profile supported by a stable belief system. It is shown that all SEBs constitute a unique stable belief system, and an SEB satisfies subgame perfectness; moreover, it is shown that the notion of SEB "refines" that of subgame perfect equilibrium in terms of path of play. Finally, we establish the epistemic foundation for the notion of SEB.
Sofer, Miguel Marcelo. "On equilibrium, stability and nonlocality in elasticity theory /." [S.l.] : [s.n.], 1991. http://e-collection.ethbib.ethz.ch/show?type=diss&nr=9420.
Full textChoi, Yam-ming Kelvin. "Use of block theory in tunnel stability analysis /." View the Table of Contents & Abstract, 2006. http://sunzi.lib.hku.hk/hkuto/record/B36616710.
Full textMagyari-Köpe, Blanka. "Structural stability of solids from first principles theory." Doctoral thesis, KTH, Physics, 2002. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-3366.
Full textChoi, Yam-ming Kelvin, and 蔡任明. "Use of block theory in tunnel stability analysis." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2006. http://hub.hku.hk/bib/B45014358.
Full textRogers, Thomas Alexander. "Feedback and stability theory for linear multipass processes." Thesis, University of Sheffield, 1989. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.385814.
Full textCoombs-Reyes, Jerome D. "Customer allocation policies in a two server network stability and exact asymptotics /." Diss., Available online, Georgia Institute of Technology, 2004:, 2003. http://etd.gatech.edu/theses/available/etd-03292004-141826/unrestricted/coombs-reyes%5Fjerome%5Fd%5F200312%5Fphd.pdf.
Full textAlva, Samson. "Essays on Matching Theory and Networks." Thesis, Boston College, 2013. http://hdl.handle.net/2345/bc-ir:104379.
Full textThis dissertation is composed of three essays in microeconomic theory. The first and second essays are in the theory of matching, with hierarchical organizations and complementarities being their respective topic. The third essay is in on electoral competition and political polarization as a result of manipulation of public opinion through social influence networks. Hierarchies are a common organizational structure in institutions. In the first essay, I offer an explanation of this fact from a matching-theoretic perspective, which emphasizes the importance of stable outcomes for the persistence of organizational structures. I study the matching of individuals (talents) via contracts with institutions, which are aggregate market actors, each composed of decision makers (divisions) enjoined by an institutional governance structure. Conflicts over contracts between divisions of an institution are resolved by the institutional governance structure, whereas conflicts between divisions across institutions are resolved by talents' preferences. Stable market outcomes exist whenever institutional governance is hierarchical and divisions consider contracts to be bilaterally substitutable. In contrast, when governance in institutions is non-hierarchical, stable outcomes may not exist. Since market stability does not provide an impetus for reorganization, the persistence of markets with hierarchical institutions can thus be rationalized. Hierarchies in institutions also have the attractive incentive property that in a take-it-or-leave-it bargaining game with talents making offers to institutions, the choice problem for divisions is straightforward and realized market outcomes are pairwise stable, and stable when divisions have substitutable preferences. Complementarity has proved to be a challenge for matching theory, because the core and group stable matchings may fail to exist. Less well understood is the more basic notion of pairwise stability. In a second essay, I define a class of complementarity, asymmetric complements, and show that pairwise stable matchings are guaranteed to exist in matching markets where no firm considers workers to be asymmetric complements. The lattice structure of the pairwise stable matchings, familiar from the matching theory with substitutes, does not survive in this more general domain. The simultaneous-offer and sequential-offer versions of the worker-proposing deferred acceptance algorithm can produce different matchings when workers are not necessarily substitutable. If no firm considers workers to be imperfect complements, then the simultaneous-offer version produces a pairwise stable matching, but this is not necessarily true otherwise. If no firm considers workers to be asymmetric complements, a weaker restriction than no imperfect complements, then the sequential-offer version produces a pairwise stable matching, though the matching produced is order-dependent. In a third essay, I examine electoral competition in which two candidates compete through policy and persuasion, and using a tractable two-dimensional framework with social learning provide an explanation for increasing political polarization. Voters and candidates have policy preferences that depend upon the state of the world, which is known to candidates but not known to voters, and are connected through a social influence network that determines through a learning process the final opinion of voters, where the voters' initial opinions and the persuasion efforts of the candidates affect final opinions, and so voting behavior. Equilibrium level of polarization in policy and opinion (of both party and population) increases when persuasion costs decrease. An increase in homophily increases the equilibrium level of policy polarization and population opinion polarization. These comparative static results help explain the increased polarization in both the policy and opinion dimensions in the United States
Thesis (PhD) — Boston College, 2013
Submitted to: Boston College. Graduate School of Arts and Sciences
Discipline: Economics
Sallam, M. H. M. "Aspects of stability and bifurcation theory for multiparameter problems." Thesis, University of Strathclyde, 1985. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.371969.
Full textWei, Mengyang. "Study of the banking system's stability using control theory." Thesis, University of Kent, 2017. https://kar.kent.ac.uk/61734/.
Full textTakahashi, Tomohiro. "Stability Analysis of Black Hole Solutions in Lovelock Theory." 京都大学 (Kyoto University), 2013. http://hdl.handle.net/2433/175117.
Full textHuertas, Chacon Marco Antonio. "Applications of effective field theory/density functional theory to ground-state properties of nuclei far from stability." W&M ScholarWorks, 2003. https://scholarworks.wm.edu/etd/1539623424.
Full textFeyzbakhsh, Soheyla. "Bridgeland stability conditions, stability of the restricted bundle, Brill-Noether theory and Mukai's program." Thesis, University of Edinburgh, 2018. http://hdl.handle.net/1842/31485.
Full textXue, Licun. "Coalitional stability in strategic situations." Thesis, McGill University, 1996. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=40287.
Full textChapter 1 provides an overview of the theoretical background and motivates the analysis undertaken.
Chapter 2 analyzes strategic situations with diverse coalitional interactions to ascertain the "stable" outcomes that will not be replaced by any rational (hence farsighted) coalition of individuals, and the coalitions that are likely to form. The analysis takes into full account the perfect foresight of rational individuals, which has been overlooked in the literature.
Chapter 3 defines "negotiation-proof Nash equilibrium", a notion that applies to environments where players can negotiate openly and directly prior to the play of a noncooperative game. The merit of the notion of negotiation-proof Nash equilibrium is twofold: (1) It resolves the nestedness and myopia embedded in the notion of coalition-proof Nash equilibrium. (2) The negotiation process, which is formalized by a "graph", serves as a natural alternative to the approach that models pre-play communication by an extensive form game.
Chapter 4 examines the notion of "renegotiation-proofness" in infinitely repeated games. It is shown that imposing renegotiation in all contingencies creates both conceptual and technical difficulties. A notion of self-enforcing agreements is offered: an agreement is self-enforcing if it is immune to any deviation by any coalition which cannot (confidently) count on renegotiation.
Ranjan, Pawas. "Discrete Laplace Operator: Theory and Applications." The Ohio State University, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=osu1343832381.
Full textWadee, Mohammad Khurram. "Elements of a Lagrangian theory of localized buckling." Thesis, Imperial College London, 1993. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.325494.
Full textAugust, Elias. "Stability and dissipativity theory for nonnegative and compartmental dynamical systems." Thesis, Georgia Institute of Technology, 2001. http://hdl.handle.net/1853/13068.
Full textStonier, D. J., and mikewood@deakin edu au. "Stability theory and numerical analysis of non-autonomous dynamical systems." Deakin University. School of Information Technology, 2003. http://tux.lib.deakin.edu.au./adt-VDU/public/adt-VDU20051125.113243.
Full textPearce, S. P. "Bifurcation and stability of elastic membranes : theory and biological applications." Thesis, Keele University, 2010. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.518311.
Full textFörster, Annette. "Decent peace, stability and justice : John Rawls's international theory applied." Thesis, London School of Economics and Political Science (University of London), 2012. http://etheses.lse.ac.uk/470/.
Full textO'Rourke, Colm J. "Decentralized power systems : reference-frame theory and stability region generation." Thesis, Massachusetts Institute of Technology, 2020. https://hdl.handle.net/1721.1/127082.
Full textCataloged from the official PDF of thesis.
Includes bibliographical references (pages 87-91).
Electricity provides the foundation for many of today's technological advances. The desire for energy security, a reduction in carbon dioxide emissions and a diversification of resources are all motivations for changes in how electricity is generated and transmitted. Recent alternatives to traditional centralized power-plants include technologies that are decentralized and intermittent, such as solar photovoltaic and wind power. This trend poses considerable challenges in the hardware making up these systems, the software that control and monitor power networks and their mathematical modelling. This thesis presents a set of contributions that address some of the aforementioned challenges. Firstly, we examine the fundamental theories used in modelling and controlling power systems. We expand previous work on reference-frame theory, by providing an alternative interpretation and derivation of the commonly used Park and Clarke transformations. We present a geometric interpretation that has applications in power quality. Secondly, we introduce a framework for producing regions of stability for power systems using conditional generative adversarial neural networks. This provides transmission and distribution operators with an accurate set of control options even as the system changes significantly.
by Colm J. O'Rourke.
Ph. D.
Ph.D. Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science
Mulzet, Alfred Kenric. "Exponential Stability for a Diffusion Equation in Polymer Kinetic Theory." Diss., Virginia Tech, 1997. http://hdl.handle.net/10919/30473.
Full textPh. D.
Mihirig, Ali Mohamed. "Transient stability analysis of multimachine power systems by catastrophe theory." Thesis, University of British Columbia, 1987. http://hdl.handle.net/2429/29022.
Full textApplied Science, Faculty of
Electrical and Computer Engineering, Department of
Graduate
Matros, Alexander. "Stochastic stability and equilibrium selection in games." Doctoral thesis, Stockholm : Economic Research Institute, Stockholm School of Economics (Ekonomiska forskningsinstitutet vid Handelshögsk.) (EFI), 2001. http://www.hhs.se/efi/summary/571.htm.
Full text徐善強 and Sin-keung Chui. "Stability and bifurcation in flow induced vibration." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1997. http://hub.hku.hk/bib/B31235724.
Full textChui, Sin-keung. "Stability and bifurcation in flow induced vibration /." Hong Kong : University of Hong Kong, 1997. http://sunzi.lib.hku.hk/hkuto/record.jsp?B1904155X.
Full textAtalayer, Senem Hayriye. "Analysis Of Stability And Transition In Flat Plate Compressible Boundary Layers Using Linear Stability Theory." Master's thesis, METU, 2004. http://etd.lib.metu.edu.tr/upload/2/12605366/index.pdf.
Full textChow, Po Chung. "Moral stability and liberal justification : an examination of the notion of stability in Rawls' theory." Thesis, London School of Economics and Political Science (University of London), 2006. http://etheses.lse.ac.uk/2802/.
Full textJennings, Otis Brian. "Multiclass queueing networks with setup delays : stability analysis and heavy traffic approximation." Diss., Georgia Institute of Technology, 2000. http://hdl.handle.net/1853/25190.
Full textHasenbein, John Jay. "Stability, capacity, and scheduling of multiclass queueing networks." Diss., Georgia Institute of Technology, 1998. http://hdl.handle.net/1853/24836.
Full textLiu, Fang. "Forced convection in curved ducts multiplicity and stability /." Click to view the E-thesis via HKUTO, 2006. http://sunzi.lib.hku.hk/hkuto/record/B37015837.
Full textKubelec, Christopher J. "Macroeconomic policy and stability in international financial markets." Thesis, University of Warwick, 2005. http://wrap.warwick.ac.uk/2458/.
Full textGalanis, Giorgos. "Heterogeneous economies : implications for inequality and financial stability." Thesis, University of Warwick, 2017. http://wrap.warwick.ac.uk/92769/.
Full textAsık, Gunes. "Empirical essays on employment, financial development and stability." Thesis, London School of Economics and Political Science (University of London), 2014. http://etheses.lse.ac.uk/1077/.
Full textPu, Bing-Yin. "Studies on the stability of liquid/liquid dispersions : theory and practice /." Zürich, 1995. http://e-collection.ethbib.ethz.ch/show?type=diss&nr=11315.
Full textAssaf, Noura. "Consociational theory and democratic stability : a re-examination : case study, Lebanon." Thesis, University of Warwick, 2004. http://wrap.warwick.ac.uk/1203/.
Full textThomas, Neil B. "The analysis and control of nonlinear systems using Lyapunov stability theory." Thesis, This resource online, 1996. http://scholar.lib.vt.edu/theses/available/etd-08292008-063459/.
Full textDe, Brito Cardeliquio Caetano. "Contributions to the Theory of Time-Delay Systems : Stability and Stabilisation." Thesis, Université Paris-Saclay (ComUE), 2019. http://www.theses.fr/2019SACLC080/document.
Full textThe aim of this dissertation is to present new results on analysis and control design of time-delay systems. On the first part, we extend the use of a finite order LTI system, called 'comparison system', to design a controller which depends not only on the output at the present time and maximum delay, but also on an arbitrary number of values between those. This approach allows us to increase the maximum stable delay without requiring any additional information. The methods presented here consider time-delay systems control design with classical numeric routines based on Hoo theory. The second part of this work deals with a new approach to develop an envelope that engulfs all poles of a time-delay system. Through LMIs, we are able to determine envelopes for retarded and neutral time-delay systems. The envelopes proposed are not only tighter than the ones in the literature but, with our procedure, they can also be applied to verify the stability of the system and design state-feedback controllers which cope with design requirements regarding alpha-stability and are robust in face of parametric uncertainties. Fractional systems are also discussed for both chapters mentioned above. The third and last part studies stochastic time-delay systems.First we discuss continuous-time systems that are subjected to Markov jumps. We define stability and obtain LMIs for the state-feedback control in such a way that the relation with the transition rates between the modes is affine, allowing, therefore, to treat the case in which the rates are uncertain. We then discuss positive systems with delays, both for the continuous case as for the discrete case. Equivalent systems are obtained and delay dependent stability is addressed. A fair amount of examples are presented throughout the dissertation