To see the other types of publications on this topic, follow the link: Transfini.
Dissertations / Theses on the topic 'Transfini'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 41 dissertations / theses for your research on the topic 'Transfini.'
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.
1
Lauria, Philippe. "Philosophie du transfini : essai sur la signification des nombres transfinis et l'ontologie de Georg Cantor." Lyon 3, 2003. http://www.theses.fr/2003LYO31004.
Full textAbstract:
G. Cantor, fondateur de la théorie des ensembles et des nombres transfinis, assignait à ses découvertes une portée philosophique. S'affirmant " aristotélo-platonicien ", il considérait la nature des nombres à la fois comme objet d'une création libre et d'une nécessité issue d'une réalité ontologique, redécouvrant une thèse néo-scolastique ; comparant les transfinis à l'idée platonicienne, il envisageait la possibilité pour son arithmétique transfinie de redonner à l'ontologie, arrêtée à Spinoza et Leibniz selon lui, un nouvel élan susceptible de dépasser le kantisme, voire d'étayer une ontologie formelle. Sur ces trois questions : nature des nombres, à retour à l'ontologie métaphysique, arithmétique transfinie, l'essai tente de montrer l'importance de l'intuition cantorienne quant à l'existence d'un noyau onto-logique au fondement de la connaissance, dans le fil d'une philosophia perennis, mais aussi les limites des transfinis eu égard à l'ambition formaliste en philosophie en raison du caractère apparemment virtuel des nombres transfinisSet and transfinite theory has been founded by Georg Cantor who gave a philosophical purpose to his creation. Presenting his own conception as a plato-aritstotelian epistemology, he considered the actual nature of numbers as a free creation of mind but simultaneously as a necessary result from reality, finding out a thesis defended by scholastic philosophers. Identifying transfinite concept with the "Idea" as defined in Plato, he call for a transfinite algebra, which could give a new start to ontology, interrupted, as he noticed, with Spinoza and Leibniz, so as to tide over kantian metaphysical criticism, and possibly building a formal ontology. On these three questions : the nature of transfinite numbers, the turn back to ontology and the viability of a transfinite calculus, this essay shows the importance of cantorian vision concerning a paradoxal kern at the basis of knowledge, following here a perennial philosophy, but also the problems of formalism in philosophy related to the fact that transfinite numbers are proabably virtual entities
2
Flammang, Valérie. "Mesures de polynômes : application au diamètre transfini entier." Metz, 1994. http://docnum.univ-lorraine.fr/public/UPV-M/Theses/1994/Flammang.Valerie.SMZ9457.pdf.
Full textAbstract:
Le but de ce travail est l'étude de différentes mesures de polynômes ou encore mesures absolues de polynômes (on désigne par ce terme la normalisation de la mesure par le degré du polynôme). Nous nous intéressons principalement à la mesure de Mahler, la longueur et la mesure de Zhang-Zagier. Poursuivant des travaux de C. J. Smyth, nous avons étudié le spectre de la mesure de Mahler absolue puis, en adaptant la méthode, le spectre de la longueur absolue. À travers ces deux exemples, nous verrons comment l'étude du spectre d'une mesure est directement en relation avec l'optimisation d'une fonction liée à la mesure considérée. Ce problème d'optimisation se résout à l'aide de la technique des fonctions auxiliaires. En général, la résolution n'est pas exacte: une méthode de programmation linéaire semi infinie en fournit une approximation numérique qui permet tout de même d'aboutir à un résultat. Cependant, nous rencontrerons quelques exemples de solutions exactes que nous appellerons fonctions auxiliaires exactes. Par ailleurs, nous avons lie la majoration du diamètre transfini entier d'un intervalle dont les bornes sont deux éléments consécutifs d'une suite de Farey et la minoration de certaines mesures de polynômes. Enfin, l'étude du spectre d'une mesure conduit tout naturellement à la recherche de polynômes petits pour cette mesure. Nous avons mis au point un procédé pour trouver effectivement tous ces polynômes et l'avons utilisé pour la mesure de Zhang-Zagier et la longueurWe are interesting in different measures of polynomials ; especially Mahler measure, length and Zhang-Zagier measure. We will see that the study of the spectrum of a measure is closely connected with the optimisation of a function depending on the considered measure. This optimisation problem is solved with the technique of auxiliairy functions. In general, the solution is not exact : a semi-infinte linear programming method gives a good numerical approximation. However, we meet some examples of exact solutions called exact auxiliairy functions. We also associate the upper bound of the integer transfinite diameter of an interval which end points are two consecutive elements of a Farey sequence with the lower bound of some measures of polynomials. At last, we present a procedure to find explicitly all polynomials of fixed degree and small measure and we apply it to the Zhang-Zagier measure and to the length
3
FLAMMANG, VALERIE RHIN G. "MESURES DE POLYNOMES. APPLICATION AU DIAMETRE TRANSFINI ENTIER /." [S.l.] : [s.n.], 1994. ftp://ftp.scd.univ-metz.fr/pub/Theses/1994/Flammang.Valerie.SMZ9457.pdf.
Full text
4
Wu, Qiang. "Mesure d'indépendance linéaire de logarithmes et diamètre transfini entier." Metz, 2000. http://docnum.univ-lorraine.fr/public/UPV-M/Theses/2000/Wu.Qiang.SMZ0011.pdf.
Full textAbstract:
Nous étudions la mesure d'indépendance linéaire de plusieurs logarithmes de nombres rationnels. Nous donnons tout d'abord des mesures d'indépendance linéaire de 1, log (1-1/a), et log (1+1/a) par deux méthodes différentes et nous généralisons ce résultat pour 1, log (1-1/a), log (1+1/a), log (1+2/a). Nous généralisons le travail de G. Rhin concernant l'indépendance linéaire de 1, log 2, et log 3 a 1, log 2, log 3, log 5 et à 1, log 2, log 3, log 5, log 7 pour lesquels nous donnons des petites mesures d'indépendance linéaire. Nous donnons la définition de (f, [delta])-diamètre transfini entier et l'appliquons au calcul d'une mesure d'indépendance linéaire de plusieurs logarithmes de nombres rationnels. Nous donnons une généralisation des polynomes de Muntz-Legendre. Ceci nous permet de calculer les polynômes de Z[x] de plus petite norme sur [0, 1] et [0, 1/4], étendant ainsi les résultats précédents de Borwein, Habsieger et Salvy ainsi que des résultats sur les polynômes critiques de Flammang, Rhin et Smyth. Nous donnons un algorithme qui utilise l'algorithme LLL, les polynômes de Muntz-Legendre généralisés et une méthode dérivée de la méthode du simplexe pour résoudre des systèmes d'inéquations linéaires à inconnues entières
5
WU, QIANG RHIN GEORGES. "MESURE D'IDEPENDANCE LINEAIRE DE LOGARITHMES ET DIAMETRE TRANSFINI ENTIER /." [S.l.] : [s.n.], 2000. ftp://ftp.scd.univ-metz.fr/pub/Theses/2000/Wu.Qiang.SMZ0011.pdf.
Full text
6
Girardot, Johan. "Toward higher-order and many-symbol infinite time Turing machines." Electronic Thesis or Diss., Institut polytechnique de Paris, 2024. http://www.theses.fr/2024IPPAX028.
Full textAbstract:
Ce travail traite des machines de Turing infinies (ITTM) telles que développées par Hamkins et Lewis au début des années 2000. Plus particulièrement il s'intéresse à leur généralisation. Un aspect notable de ces machines infinies est que, en comparaison du modèle classique de Turing, celles-ci sont presque aussi simple. Une ITTM a la même structure qu'une machine de Turing à trois rubans. Elle fait des calculs en temps ordinaux et à n'importe quelle étape, l'instantané de la machine permet de calculer, comme dans le modèle classique, l'instantané à l'étape suivant. Le seule différence est aux étapes limites: la tête de lecture est remise au début, la machine est dans un certain état spécial et la valeur de chaque cellule est la limite supérieure de l'historique de ses valeurs précédentes. Si le choix pour la tête de lecture et pour l'état limite sont d'une façon logique, le choix de la valeur limite pour les cellules peut apparaître arbitraire. Pourquoi pas une liminf ? Ou encore quelque chose de plus compliqué ? Finalement, la justification de cette règle limite est une corroboration : avec cette règle, Hamkins et Lewis ont montré que le modèle de machines qu'ils ont développé est robuste, puissant et se comporte bien.L'objectif est de proposer des règles limites différentes de la règle limsup produisant donc des généralisations de ce modèle de machines.%La plupart de preuves portant sur les ITTMs utilise une « machine universelle », c'est-à-dire une machine qui simule en parallèle toutes les autres ITTMs. Une une telle machine est en fait simple à définir ; mais cette simplicité est fortuite : il pourrait y avoir de nombreuses difficultés qui sont évitées grâce à plusieurs propriétés implicite des ITTMs. Nous avons ainsi mis en lumière un ensemble de quatre propriétés, satisfaites par la règle de limsup. Elles nous permettent de définir un concept plus général de machine simulationnelles : des modèles de machines dont la règle limite satisfait ces propriétés et pour lesquelles on prouve qu'il existe une machine universelle. Le premier résultat de ce travail est un théorème qui établit, pour ces modèles de machines auxquelles deux contraintes sont rajoutées, une égalité entre les temps de calcul et les ordinaux qui peuvent être écrits.Le second résultat principal se base sur ce premier résultat. Un corollaire immédiat de la première partie est le suivant : il n'existe que deux modèles de machines simulationnelles (et non pathologiques), à savoir les ITTM avec la règle limsup et leur symétrique avec la règle liminf. Ainsi, pour produire des machines infinies d'ordre supérieur, il faut construire des machines à n symboles. C'est le second résultat : nous avons construit un modèle de machines simulationnelles à 3 symboles, strictement plus puissant que celui des ITTMs et pour lequel nous parvenons à établir les principaux résultats mettant en relation les ITTMs avec la théorie des ensemblesThis thesis studies infinite time Turing machines (ITTM) as developed by Hamkins and Lewis at the beginning of the years 2000. In particular, it aims at providing new generalizations of this model of infinite computation, or the tools and the results to develop those.A notable aspect of this model of infinite computation is that it is simple enough when compared to the usual finite model of Turing machines: an ITTM has the same structure as a three tapes Turing machine, it computes through the ordinals and at any successor stage, the next snapshot of the machine is a function of its machine code and the actual snapshot, as done in the classical setting. The only difference being that, at limit, tape heads are back on their first cells, the state is set to some distinguished limit state and the value of any cell is set to the limit superior of its previous values. While the choices for the heads and the states at limit stages may appear somewhat canonical, the principal justification for the rule of the limsup is actually a corroboration: with this rule, Hamkins and Lewis showed how this produces a robust, powerful and well-behaved model of infinite computation.So this work was focused on devising limit rules that would yield more powerful but equally well-behaved models of generalized infinite Turing machines.Most of the proofs done on ITTMs use a universal machine: an ITTM which simulates in parallel all other ITTMs. It happens to be straightforward to define such an universal ITTM.But its definition is only fortuitously straightforward. This construction rests on strong but implicit properties of the limsup rule. Hence, we exhibit a set of four properties satisfied by the limsup rule that allow us to define the more general concept of simulational machine: a model of infinite machines whose machines compute with a limit rule that satisfy this set of four properties, for which we prove that there exists a universal machine. The first main result is that the machines in this class of infinite machines satisfy (with two other constraints) an important equality satisfied by the usual ITTM, relating the time of computations and the ordinals that are writable.The second main result builds on the previous result. An immediate corollary is the following: there exists only two 2-symbol simulational and "well-behaved" model of ITTM; namely the limsup ITTM and the liminf ITTM. So, to produce higher-order machines, we need to consider n-symbols machine. And this is the second result: we construct a 3-symbol ITTM, strictly more powerful that the previous one and for which we establish the same set-theoretic results that were established for it
7
Vieugué, Dominique. "Problèmes de linéarisation dans des familles de germes analytiques." Phd thesis, Université d'Orléans, 2005. http://tel.archives-ouvertes.fr/tel-00069473.
Full textAbstract:
Nous nous intéressons à la linéarisation de certaines familles de germes analytiques. En généralisant les définitions et propriétés du diamètre transfini, nous obtenons un théorème de majoration polynomiale valable à la fois pour les nombres complexes et p-adiques. Nous utilisons ensuite ces outils pour donner une nouvelle démonstration du théorème de Perez-Marco concernant la linéarisation des familles non résonantes de germes analytiques qui subissent une perturbation polynomiale. Cette nouvelle preuve permet de démontrer un analogue du théorème de Perez-Marco dans le cadre p-adique. De plus, cette nouvelle technique nous permet de récupérer une information diophantienne et donne de nouveaux exemples de germes non linéarisables. Nous généralisons ensuite ce théorème au cas des perturbations par des fractions rationnelles et finissons par étudier un cas résonant et retrouvons, de façon élémentaire, certaines propriétés concernant le centralisateur des germes tangents à l'identité.
8
Carpani, Giacomo. "Cantor e l'aritmetica transfinita." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2017. http://amslaurea.unibo.it/13445/.
Full textAbstract:
In quest’elaborato poniamo l’attenzione in particolare sul concetto di “numero transfinito” riferendoci direttamente alle intuizioni fondamentali di Georg Cantor. Punto di partenza sono quindi le idee e i risultati del matematico tedesco, che hanno aperto la strada alle teorie dei numeri ordinali e dei numeri cardinali, che noi esponiamo in chiave moderna assumendo la teoria degli insiemi Zermelo-Fraenkel.
Nelle conclusioni, per illustrare gli sviluppi e l’importanza delle riflessioni di Cantor al giorno d’oggi, diamo alcuni accenni in merito all’ipotesi generalizzata del continuo e ai grandi cardinali.
9
Amrane, Amazigh. "Posets série-parallèles transfinis : automates, logiques et théories équationnelles." Thesis, Normandie, 2020. http://www.theses.fr/2020NORMR102.
Full textAbstract:
Nous étudions dans cette thèse des structures généralisant la notion classique de mot. Elles sont construites à partir d’un ensemble partiellement ordonné (partially ordered set ou poset) vérifiant les propriétés suivantes : — elles ne contiennent pas 4 éléments distincts x, y, z, t dont l’ordre relatif est exactement x < y, z < y, z < t (posets dits sans N) ; — les chaînes sont des ordres linéaires dénombrables et dispersés ; — les antichaînes sont finies ; et chaque élément est étiqueté par une lettre d’un alphabet fini. De manière équivalente, la classe des posets que nous considérons est la plus petite construite à partir du poset vide et du singleton, fermée par les produits séquentiel et parallèle finis, et le produit ω et son renversé −ω (posets série-parallèles). Elle est une généralisation à la fois des posets série-parallèles finis étiquetés, en y ajoutant l’infinitude, et des mots transfinis, en affaiblissant l’ordre total des éléments en ordre partiel. En informatique, les posets série-parallèles finis trouvent leur intérêt dans la modélisation des processus concurrents basés sur les primitives fork/join, et les mots transfinis dans l’étude de la récursivité. Les langages rationnels de ces posets étiquetés sont définis à partir d’expressions et d’automates équivalents introduits par Bedon et Rispal, qui généralisent le cas des mots transfinis (Bruyère et Carton) et celui des posets finis (Lodaya et Weil). Dans cette thèse nous les étudions du point de vue de la logique. Nous généralisons en particulier le théorème de Büchi, Elgot et Trakhtenbrot, établissant pour le cas des langages de mots finis l’égalité entre la classe des langages rationnels et celle des langages définissables en logique monadique du second ordre (MSO). La logique mise en oeuvre est une extension de MSO par de l’arithmétique de Presburger. Nous nous intéressons également à certaines variétés d’algèbres de posets. Nous montrons que l’algèbre dont l’univers est la classe des posets série-parallèles transfinis et dont les opérations sont les produits séquentiel et parallèle finis et les produits (resp. puissances) ω et − ω est libre dans la variété correspondante V (resp. V 0). Nous en déduisons la liberté de la même algèbre sans le produit parallèle ou le produit − ω. Enfin, nous montrons que la théorie équationnelle de V 0 est décidable. Ce sont notamment des généralisations de résultats similaires de Bloom et Choffrut pour la variété d’algèbres de mots de longueur inférieure à ω!, de Choffrut et Ésik pour la variété d’algèbres de posets sans N dont les antichaînes sont finies et les chaînes sont de longueur inférieure à ω! et ceux de Bloom et Ésik pour la variété d’algèbres de mots sur les ordres linéaires dénombrables et dispersésWe study in this thesis structures extending the classical notion of word. They are built from a partially ordered set (poset) verifying the following properties : — they do not contain 4 distinct elements x, y, z, t whose relative order is exactly x < y, z < y, z < t (posets called N-free) ; — their chains are countable and scattered linear orderings ; — their antichains are finite ; and each element is labeled by a letter of a finite alphabet. Equivalently, the class of posets which we consider is the smallest one built from the empty poset and the singleton, and being closed under sequential and parallel products, and ω product and its backward ordering −ω (series-parallel posets). It is a generalization of both of finite series-parallel labeled posets, by adding infinity, and transfinite words, by weakening the total ordering of the elements to a partial ordering. In computer science, series-parallel posets find their interest in modeling concurrent processes based on fork/join primitives, and transfinite words in the study of recursion. The rational languages of these labeled posets are defined from expressions and equivalent automata introduced by Bedon and Rispal, which generalize thecase of transfinite words (Bruyère and Carton) and the one of finite posets (Lodaya and Weil). In this thesis we study such structures from the logic point of view. In particular, we generalize the Büchi-Elgot-Trakhtenbrot theorem, establishing in the case of finite words the correspondence between the class of rational languages and the one of languages definable in monadic second order logic (MSO). The implemented logic is an extension of MSO by Presburger arithmetic. We focus on some varieties of posets algebras too. We show that the algebra whose universe is the class of transfinite series-parallel posets and whose operations are the sequential and parallel products and the ω and −ω products (resp. powers) is free in the corresponding variety V (resp. V 0). We deduce the freeness of the same algebra without parallel or −ω product. Finally, we showthat the equational theory of V 0 is decidable. These results are, in particular, generalizations of similar results of Bloom and Choffrut on the variety of algebras of words whose length are less than ω!, of Choffrut and Ésik on the variety of algebras of N-free posets whose antichains are finite and whose chains are less than ω! and those of Bloom and Ésik on the variety of algebras of words indexed by countable and scattered linear orderings
10
Lucci, Paulo Cesar de Alvarenga 1974. "Descrição matematica de geometrias curvas por interpolação transfinita." [s.n.], 2009. http://repositorio.unicamp.br/jspui/handle/REPOSIP/258706.
Full textAbstract:
Orientador: Philippe Remy Bernard DevlooDissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Civil, Arquitetura e Urbanismo
Made available in DSpace on 2018-08-13T10:14:35Z (GMT). No. of bitstreams: 1 Lucci_PauloCesardeAlvarenga_M.pdf: 6661587 bytes, checksum: b77bb456093ce1f153056c6b2fa89626 (MD5) Previous issue date: 2009
Resumo: Este trabalho é dedicado ao desenvolvimento de uma metodologia específica de mapeamento curvo aplicável a qualquer tipo de elemento geométrico regular. Trata-se de uma generalização do modelo matemático de representação geométrica apresentado em 1967 por Steven Anson Coons, denominado "Bilinearly Blended Coons Patches", o qual ajusta uma superfície retangular em um contorno delimitado por quatro curvas arbitrárias. A generalização proposta permitirá a utilização deste tipo de interpolação geométrica em elementos de qualquer topologia, através de uma sistemática única e consistente.
Abstract: In this work a methodology is developed for mathematical representation of curved domains, applicable to any type of finite element geometry. This methodology is a generalization of the mathematical model of a geometric representation presented in 1967 by Steven Anson Coons, called "Bilinearly Blended Coons Patches", which patch a rectangular surface in four arbitrary boundary curves. The proposed methodology is a kind of geometric transfinite interpolation applicable to elements of any topology, using a single and consistent systematic.
Mestrado
Estruturas
Mestre em Engenharia Civil
11
PITTELOUD, DANIEL. "Le produit dans les corps de series transfinies." Paris 7, 1998. http://www.theses.fr/1998PA077129.
Full textAbstract:
Le but principal de ce travail est de decrire le produit dans les corps de series transfinies, ou le groupe des exposants n'est plus forcement archimedien. Nous demontrons que la formule de berarducci ne se generalise que partiellement, et exhibons une famille tres importante de groupes, des puissances lexicographiques convenables de r, ou la formule est en defaut.
12
Kaya, İmren Gül Songül Sallan. "Yoksullukla mücadelede eğitimin rolü: şartlı nakit transferi-ŞNT örneği /." Isparta : SDÜ Sosyal Bilimler Enstitüsü, 2008. http://tez.sdu.edu.tr/Tezler/TS00616.pdf.
Full text
13
Carey, Patrick Hatfield. "Beyond Infinity: Georg Cantor and Leopold Kronecker's Dispute over Transfinite Numbers." Thesis, Boston College, 2005. http://hdl.handle.net/2345/481.
Full textAbstract:
Thesis advisor: Patrick ByrneIn the late 19th century, Georg Cantor opened up the mathematical field of set theory with his development of transfinite numbers. In his radical departure from previous notions of infinity espoused by both mathematicians and philosophers, Cantor created new notions of transcendence in order to clearly described infinities of different sizes. Leading the opposition against Cantor's theory was Leopold Kronecker, Cantor's former mentor and the leading contemporary German mathematician. In their lifelong dispute over the transfinite numbers emerge philosophical disagreements over mathematical existence, consistency, and freedom. This thesis presents a short summary of Cantor's controversial theories, describes Cantor and Kronecker's philosophical ideas, and attempts to state clearly their differences of opinion. In the end, the author hopes to present the shock caused by Cantor's work and an appreciation of the two very different philosophies of mathematics represented by Cantor and Kronecker
Thesis (BA) — Boston College, 2005
Submitted to: Boston College. College of Arts and Sciences
Discipline: Philosophy
Discipline: College Honors Program
14
Bartolini, Annachiara. "La teoria dei numeri transfiniti nei suoi aspetti matematici e filosofici." Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2015. http://amslaurea.unibo.it/8690/.
Full textAbstract:
La presente tesi si occupa, da un punto di vista matematico e filosofico, dello studio dei numeri transfiniti introdotti da Georg Cantor. Vengono introdotti i concetti di numero cardinale ed ordinale, la loro aritmetica ed i principali risultati riguardo al concetto di insieme numerabile. Si discutono le nozioni di infinito potenziale ed attuale e quella di esistenza secondo la concezione di Cantor. Viene infine presentata l'induzione transfinita, una generalizzazione al caso transfinito del principio di induzione matematica.
15
Nestra, Härmel. "Iteratively defined transfinite trace semantics and program slicing with respect to them /." Online version, 2006. http://dspace.utlib.ee/dspace/bitstream/10062/1109/5/nestraharmel.pdf.
Full text
16
Wessel, Daniel. "Choice, extension, conservation. From transfinite to finite proof methods in abstract algebra." Doctoral thesis, Università degli studi di Trento, 2018. https://hdl.handle.net/11572/368524.
Full textAbstract:
Maximality principles such as the ones going back to Kuratowski and Zorn ensure the existence of higher type ideal objects the use of which is commonly held indispensable for mathematical practice. The modern turn towards computational methods, which can be witnessed to have a strong influence on contemporary foundational studies, encourages a reassessment within a constructive framework of the methodological intricacies that go along with invocations of maximality principles. The common thread that can be followed through the chapters of this thesis is explained by the attempt to put the widespread use of ideal objects under constructive scrutiny. It thus walks the tracks of a revised Hilbert’s programme which has inspired a reapproach to constructive algebra by finitary means, and for which Scott’s entailment relations have already shown to provide a vital and utmost versatile tool. In this thesis several forms of the Kuratowski-Zorn Lemma are introduced and proved equivalent over constructive set theory; the notion of Jacobson radical is brought from commutative rings to a general ideal theory for single-conclusion entailment relations; a flexible conservation criterion of Scott for multi-conclusion entailment relations is put into action; elementary and constructive variants for algebraic extension theorems such as Sikorski’s on the injectivity of complete atomic Boolean algebras are phrased and proved in terms of entailment relations; and a point-free version of Sikora’s theorem on spaces of orderings of groups is obtained by a revisitation with syntactical means of some of the classical criteria for groups to be orderable.
17
Wessel, Daniel. "Choice, extension, conservation. From transfinite to finite proof methods in abstract algebra." Doctoral thesis, University of Trento, 2018. http://eprints-phd.biblio.unitn.it/2759/1/Wessel_thesis_final.pdf.
Full textAbstract:
Maximality principles such as the ones going back to Kuratowski and Zorn ensure the existence of higher type ideal objects the use of which is commonly held indispensable for mathematical practice. The modern turn towards computational methods, which can be witnessed to have a strong influence on contemporary foundational studies, encourages a reassessment within a constructive framework of the methodological intricacies that go along with invocations of maximality principles. The common thread that can be followed through the chapters of this thesis is explained by the attempt to put the widespread use of ideal objects under constructive scrutiny. It thus walks the tracks of a revised Hilbert’s programme which has inspired a reapproach to constructive algebra by finitary means, and for which Scott’s entailment relations have already shown to provide a vital and utmost versatile tool. In this thesis several forms of the Kuratowski-Zorn Lemma are introduced and proved equivalent over constructive set theory; the notion of Jacobson radical is brought from commutative rings to a general ideal theory for single-conclusion entailment relations; a flexible conservation criterion of Scott for multi-conclusion entailment relations is put into action; elementary and constructive variants for algebraic extension theorems such as Sikorski’s on the injectivity of complete atomic Boolean algebras are phrased and proved in terms of entailment relations; and a point-free version of Sikora’s theorem on spaces of orderings of groups is obtained by a revisitation with syntactical means of some of the classical criteria for groups to be orderable.
18
Hilmar, Jan. "Intersection of algebraic plane curves : some results on the (monic) integer transfinite diameter." Thesis, University of Edinburgh, 2008. http://hdl.handle.net/1842/3843.
Full textAbstract:
Part I discusses the problem of determining the set of intersection points, with corresponding multiplicities, of two algebraic plane curves. We derive an algorithm based on the Euclidean Algorithm for polynomials and show how to use it to find the intersection points of two given curves. We also show that an easy proof of Bézout’s Theorem follows. We then discuss how, for curves with rational coefficients, this algorithm can bemodified to find the intersection points with coordinates expressed in terms of algebraic extensions of the rational numbers. Part II deals with the problem of determining the (monic) integer transfinite diameter of a given real interval. We show how this problem relates to the problem of determining the structure of the spectrum of normalised leading coefficients of polynomials with integer coefficients and all roots in the given interval. We then find dense regions of this spectrum for a number of intervals and discuss algorithms for finding discrete subsets of the spectrum for the interval [0,1]. This leads to an improvement in the known upper bound for the integer transfinite diameter. Finally, we discuss the connection between the infimum of the spectrum and the monic integer transfinite diameter.
19
JUNIOR, WALTER GOMIDE DO NASCIMENTO. "THE INFINITE COUNTED BY GOD: A DEDEKINDIAN INTERPRETATION OF CANTOR S TRANSFINITE ORDINAL NUMBER CONCEPT." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2006. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=9031@1.
Full textAbstract:
CONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICOSubjacente à teoria dos números ordinais transfinitos de Cantor, há uma perspectiva finitista. Segundo tal perspectiva, Deus pode bem ordenar o infinito usando, para tanto, de procedimentos similares ao ato de contar, entendido como o ato de bem ordenar o finito. Desta maneira, um diálogo natural entre Cantor e Dedekind torna-se possível, dado que Dedekind foi o primeiro a tratar o ato de contar como sendo, em sua essência, uma forma de bem ordenar o mundo espáciotemporal pelos números naturais. Nesta tese, o conceito de número ordinal transfinito, de Cantor, é entendido como uma extensão do conceito dedekindiano de número natural.
Underlying Cantor s transfinite ordinal numbers theory, there is a finistic perspective. Accordingly that perspective, God can well order the infinite using, for that, similar procedures to the act of counting, understood as the act of well order the finite. That s why a natural dialog between Cantor and Dedekind becomes possible, since Dedekind was the first to consider the act of counting as being, in its essence, a way of well order the spatial-temporal world by natural numbers. In this thesis, the concept of Cantor´s transfinite ordinal number is understood as an extension of dedekindian concept of natural number.
20
Benkaddour, Saïd. "Relation entre ensembles totalement flous et ensembles ordonnés." Lyon 1, 1986. http://www.theses.fr/1986LYO11714.
Full textAbstract:
Le present travail fait suite aux recherches menees sur la theorie des ensembles flous. D. Ponasse a defini la categorie jtf des j-ensembles totalement flous. Dans sa these de 3eme cycle g. Mycek a demontre que cette categorie est un topos lorsque j est un anti-ordinal (c. A. D. : j est un ordinal lorsqu'il est muni de l'ordre inverse). Il a exhibe tous les objets elementaires de ce topos. Wu tao, lui, a fait une etude detaillee de ce topos avec j antiordinal. Dans leurs articles j. Coulon et j. L. Coulon montrent que pour j un treillis de heyting complet la categorie jtf est equivalente a la categorie jtf et que jtf n'est pas un topos lorsque j n'est pas un anti-ordinal. Dans la premiere partie de ce travail je continue l'etude de la categorie jtf. Je demontre qu'elle est isomorphe a la categorie notee jid dont les objets sont des ensembles ordonnes et les morphismes sont des applications verifiant certaines conditions. J'ai traduit les notions de mono, epi et iso (morphisme) dans jid en notions de surjection, injection et bijection. Dans la deuxieme partie j'etudie les proprietes categoriques de jid: objet final (resp. Initial), produit (resp. Coproduit), pulback (resp. Pushout), noyau de paire (resp. Conoyau) et l'exponentielle. 1**(o)) je demontre que la plus grande famille de monomorphismes qu'on peut classer c'est la famille des monomorphismes dits forts. 2**(o)) je prouve que dans le cas ou j est un anti-ordinal tout monomorphisme est fort donc jid est un topos. 3**(o)) lorsque j n'est pas un anti-ordinal il existe des monomorphismes non forts donc non classifiables. Donc jid n'est pas un topos.
21
Pachito, Ernesto de Souza. "O Haroldo de Campos transfinito : espírito, signo e matéria num possível (neo)romantismo em A máquina do mundo repensada." Universidade Federal do Espírito Santo, 2015. http://repositorio.ufes.br/handle/10/3183.
Full textAbstract:
Made available in DSpace on 2016-08-29T14:11:05Z (GMT). No. of bitstreams: 1
tese_8924_Tese de Ernesto de Souza Pachito.pdf: 1806785 bytes, checksum: e4f4db814ed58caeac602c5e873e73d2 (MD5)
Previous issue date: 2015-06-25Após a grande operação de se conferir maior materialidade à linguagem das artes, iniciada com consciência de luta de classes em torno da época de Courbet, intensificada em várias alas do modernismo, inclusive literário, no fim do século XX e início do século XXI, Haroldo de Campos empreende um poema passadista, A Máquina do mundo repensada, de 2000, que faz a revisão das cosmovisões, científicas em maior ou menor grau, de Ptolomeu à física contemporânea, e se detém numa oposição complementar que não se subsume num termo superior. Pura materialidade ou não? O físico ou o além do físico? Um Deus imanente ou presença de alguma transcendência divina? Ou o agnosticismo? A construção de um poema, por parte de Haroldo de Campos, pleno de revérberos sonoros e imagéticos dotado igualmente de concreção e imponderabilidade nesses revérberos e em símbolos (no sentido do artista e pensador alemão Wolfgang von Goethe) de profundidade semântica no mínimo incerta. Peirce, seu conceito de quale-consciênscia, sua doutrina do sinequismo e sua concepção de monismo. A possível ou desejável reabilitação de um sentido ético para as artes, após os relativismos ditos pós-modernistas.
Since Courbet times, many artists tried to suppress metaphysics from the language of arts in general, including poetry. Many of them made this wide and deep movement with a sense of struggle of classes, being marxists or not. In XXth century, many wings of modernism intensified the search for this goal. At the end of the same century, in the turning to XXIst century, Haroldo de Campos wrote his poem A Máquina do mundo repensada (2000) a work where the lyric subject finds himself caught between complementary oppositions that didn't go to a superior term, at the end of the writting. These dualities were not subsumed under any general term. Metaphysics or not? A world constituted only by matter or there would be something more beyond matter? In this work Haroldo de Campos made the historical and philosophical review of practically all cosmology since Ptolomeu to contemporary times. At the end of the poem he is still in a dilemma between an immanent and a transcendental God, or agnosticism. A Máquina do mundo repensada is a construction full of reverberations of sounds and images, these echoes make fields that project themselves and all signs beyond mere phonetic and imagetic matter, and they operate with symbols (in Wolfgang von Goethe's sense) whose semantic field vanishes into uncertainty and infinity. Peirce, his concept of quale-counsciousness, his monism and his sinechism. The possibility and/or the importance of a sense of ethics in arts after so called relativistic post-modernism.
22
Gast, Alexandra [Verfasser]. "Vergleichende Untersuchungen nach Rekonstruktion des vorderen Kreuzbandes in Single-Bundle-, Double-Bundle- und TransFix AM-Technik / Alexandra Gast." Berlin : Medizinische Fakultät Charité - Universitätsmedizin Berlin, 2021. http://d-nb.info/1234984709/34.
Full text
23
Beltr?o, Maria Cecilia Gomes. "Influ?ncia da transfixa??o horizontal por um pino de fibra de vidro na resist?ncia ? fratura de molares endodonticamente tratados." Pontif?cia Universidade Cat?lica do Rio Grande do Sul, 2006. http://tede2.pucrs.br/tede2/handle/tede/1046.
Full textAbstract:
Made available in DSpace on 2015-04-14T13:29:35Z (GMT). No. of bitstreams: 1
347433.pdf: 2385324 bytes, checksum: b30cdf7cb8df14803e76ba57e57535bb (MD5)
Previous issue date: 2006-01-13A proposta deste estudo foi avaliar o efeito, na resist?ncia ? fratura, de um pino de fibra de vidro transfixando horizontalmente as paredes, de um preparo MOD, de dentes molares tratados endodonticamente restaurados ou n?o com resina composta. Setenta e cinco dentes terceiros molares humanos h?gidos foram extra?dos e montados em blocos de resina acr?lica, sendo distribu?dos aleatoriamente em cinco grupos (n=15). No Grupo A, os dentes foram mantidos h?gidos (controle). Os Grupos B, C, D e E, com tratamento endod?ntico, receberam os seguintes procedimentos: Grupo B preparo MOD; Grupo C preparo MOD e pino transfixado; Grupo D preparo MOD e restaura??o com resina composta; Grupo E preparo MOD, pino transfixado e restaura??o com resina composta. As amostras foram armazenadas em soro fisiol?gico a 37?C durante 24 horas. Ap?s o procedimento, foi aplicada uma for?a compressiva paralela ao longo eixo dos dentes at? a fratura, conduzida por meio de uma m?quina de ensaio universal (EMIC DL-2000) com velocidade de 1mm/min. As m?dias em Newtons dos resultados (desvio padr?o) seguidas de mesma letra n?o apresentaram diferen?a estat?stica para ANOVA e Tukey, p=0,05: Grupo A = 4289,8 (? 1128,9)a, Grupo B = 549,6 (?120,7)b, Grupo C = 1474,8 (? 338,1)c, Grupo D = 1224,7 (? 236,0)c, Grupo E = 2645,4 (?675,1)d. Na an?lise das vari?veis qualitativas, predominou a fratura de c?spide em 56%, o diagn?stico recuper?vel em todos os grupos, com exce??o do Grupo C e o preparo da c?spide palatina predominou em todos os grupos, a exce??o do Grupo A. Concluiu-se que um pino de fibra de vidro transfixando horizontalmente as paredes de uma cavidade MOD elevou significativamente a resist?ncia ? fratura e quando associado ? restaura??o de resina composta determinou um padr?o de fratura compat?vel com a recupera??o da pe?a dent?ria.
24
Randrianarivony, Maharavo. "Software pertaining to the preparation of CAD data from IGES interface for mesh-free and mesh-based numerical solvers." Universitätsbibliothek Chemnitz, 2007. http://nbn-resolving.de/urn:nbn:de:swb:ch1-200700267.
Full textAbstract:
We focus on the programming aspect of the treatment of digitized
geometries for subsequent use in mesh-free and mesh-based numerical
solvers. That perspective includes the description of our C/C++ implementations
which use OpenGL for the visualization and MFC classes for the user
interface. We report on our experience about implementing with the IGES
interface which serves as input for storage of geometric information. For
mesh-free numerical solvers, it is helpful to decompose the boundary of a
given solid into a set of four-sided surfaces. Additionally, we will describe
the treatment of diffeomorphisms on four-sided domains by using transfinite
interpolations. In particular, Coons and Gordon patches are appropriate for
dealing with such mappings when the equations of the delineating curves
are explicitly known. On the other hand, we show the implementation of
the mesh generation algorithms which invoke the Laplace-Beltrami operator.
We start from coarse meshes which one refine according to generalized
Delaunay techniques. Our software is also featured by its ability of treating
assembly of solids in B-Rep scheme.
25
Stirton, William R. "Provable and unprovable cases of transfinite induction in a theory obtained by adding to HAω so-called 'term-forms' of the kind introduced by M. Yasugi." Thesis, University of Edinburgh, 1995. http://hdl.handle.net/1842/26976.
Full text
26
Randrianarivony, Maharavo. "The ITL programming interface toolkit." Universitätsbibliothek Chemnitz, 2007. http://nbn-resolving.de/urn:nbn:de:swb:ch1-200700254.
Full textAbstract:
This document serves as a reference for the beta version of our evaluation
library ITL. First, it describes a library which gives an easy way for
programmers to evaluate the 3D image and the normal vector corresponding to
a parameter value which belongs to the unit square. The API functions which
are described in this document let programmers make those
evaluations without the need to understand the underlying CAD complica-
tions. As a consequence, programmers can concentrate on their own scien-
tific interests. Our second objective is to describe the input which is a set
of parametric four-sided surfaces that have the structure required by some
integral equation solvers.
27
Krämer, Markus [Verfasser]. "Ergebnisse nach arthroskopisch assistiert durchgeführter transtibialen vorderen Kreuzbandrekonstruktion mit bioresorbierbarem TransFix-Implantat und Interferenzschraube in modifizierter ovalärer Einkanal-Technik mit Hamstringsehnen als Vierfach-Implantat / Markus Krämer." Köln : Deutsche Zentralbibliothek für Medizin, 2010. http://d-nb.info/1005350132/34.
Full text
28
Meier, Laura [Verfasser], Andrea [Akademischer Betreuer] Tipold, and Jasmin [Akademischer Betreuer] Neßler. "Untersuchung zur Stabilität von caninen und felinen Liquorproben in Bezug auf Zellzahl und Zellpopulationen in „TransFix®/EDTA CSF Sample Storage Tubes“ / Laura Meier ; Andrea Tipold, Jasmin Neßler." Hannover : Stiftung Tierärztliche Hochschule Hannover, 2019. http://d-nb.info/1202271774/34.
Full text
29
Peters, Tom. ""Jag är både och och ingenting, mitt emellan och runtomkring" : En jämförande studie om binära och ickebinära transpersoners vardagliga erfarenheter." Thesis, Södertörns högskola, Institutionen för samhällsvetenskaper, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:sh:diva-29488.
Full textAbstract:
This is a comparative study between binary and nonbinary transgender people based on their everyday experience of difficulties. Previous studies show that many transpeople experience violence, infringement and oppression. Studies also show that suicide rate among transgender people is much higher than among the common (cisgender) population. Those studies rarely make an analysis based on specific gender identity, which shows the diversity among transgender people.To analyse the individual experiences, this study made four interviews with binary and nonbinary transgender people. The interviews were analysed with a queer-theoratical perspective to show and focus on the oppressional mechanics that heteronormativity has. The results show clear differences and similarities between binary and nonbinary transgender people's experiences of everyday life difficulties and oppression. Nonbinary transgender people elucidate their nonexistence in the majorities knowledge as a big difficulty; that people in their everyday surroundings and society in general are not aware of them. Binary transgender people's experiences have instead been focusing on their bodies and social context of their transitions.Denna studie avser att undersöka och jämföra transpersoners erfarenheter kring svårigheter i vardagen. Jämförelsen görs mellan binära och ickebinära transpersoner. Tidigare forskning visar att många transpersoner blir utsatta för våld, kränkningar och förtryck. Den visar även att självmordsfrekvensen bland transpersoner är mycket högre än hos populationen i övrigt. I dessa undersökningar kring transpersoners hälsa och situation görs det sällan eller aldrig analyser baserade på den mångfald gällande identitet som finns inom gruppen transpersoner. För att undersöka dessa individuella erfarenheter genomfördes ett antal intervjuer med binära och ickebinära transpersoner. Intervjuerna analyserades utifrån en queerteoretisk utgångspunkt för att belysa de förtryckande mekanismer som heteronormen medför. Resultatet visar att det finns tydliga likheter och skillnader i binära och ickebinära transpersoners erfarenheter kring svårigheter och förtryck. Ickebinära transpersoner tar upp omgivningens omedvetenhet kring deras existens som en stor svårighet, att personer i deras vardagliga omgivning och i samhället i stort inte känner till att de finns medan svårigheterna för binära transpersoner snarare har varit i förhållande till deras kroppar och sociala sammanhang.
30
Veelo, Bastiaan Niels. "Variations of Shape in Industrial Geometric Models." Doctoral thesis, Norwegian University of Science and Technology, Department of Product Design, 2004. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-240.
Full textAbstract:
This thesis presents an approach to free-form surface manipulations, which conceptually improves an existing CAD system that constructs surfaces by smoothly interpolating a network of intersecting curves. There are no regularity requirements on the network, which already yields superior modelling capabilities compared to systems that are based on industry-standard NURBS surfaces.
Originally, the shape of such a surface can be modified only locally by manipulating a curve in the network. In this process there is an inherent danger that the curve is being pulled away from intersections that it has with other curves. When this happens, the network is invalidated as a surface representation, and many curves may have to be adjusted to restore network consistency and surface quality. This thesis contributes a method that solves these problems by propagating changes that are made in one curve to curves in its vicinity. How and to what extent curves react to changes is controlled by two parameters that can be varied along the curve that is being manipulated. Any curve may be constrained in one or more degrees of freedom. The integrity of the curve network is implicitly conserved, as well as the geometric continuity of the surface.
The result is a tool for the modification of curve-interpolating surfaces, which can easily be applied to large areas on models with any level of detail. This allows designers to concentrate on the creative process, rather than on planning chains of actions. They can explore different design variations, optimise shapes further, and generally be more productive.
Dette doktorgradsarbeidet presenterer en fremgangsmåte for formgivning og modifisering av datamaskinbaserte, skulpturerte flater. Metoden forbedrer et eksisterende system for data-assistert konstruksjon (DAK) som bygger dobbeltkrummede flater ved å interpolere et nettverk av skjærende kurver. Nettverket trenger ikke være regelmessig, noe som allerede gir bedre modelleringsmuligheter sammenliknet med systemer som er basert på standard NURBS flater.
En slik flate kan opprinnelig bare endres lokalt ved å dra i en kurve. I denne prosessen er det fare for at kurven blir dratt fra skjæringspunkter den har med andre kurver. Hvis dette skjer, representerer ikke nettverket en flate lenger, og mange kurver må justeres for å få tilbake integriteten i nettverket og kvaliteten i formen. Denne avhandlingen bidrar med en metode som løser disse problemene ved å spre endringer som blir gjort i en kurve til andre kurver i nærheten. Hvordan og i hvilken utstrekning kurvene reagerer på endringen styres av to parametre som kan varieres langs kurven som blir endret. Enhver kurve kan låses i en eller flere frihetsgrader. Integriteten til nettverket samt glattheten i formen blir bevart automatisk.
Resultatet er et redskap for modifikasjon av kurve-interpolerende flater som med letthet kan brukes på større områder av modeller med hvilken som helst grad av detalj. Dette gir designere muligheten til å konsentrere seg om det kreative, istedenfor å planlegge handlingsrekker. De kan utforske forskjellige designvariasjoner, optimalisere former ytterligere, og i det hele tatt være mer produktive.
31
Mejia, Humberto. "Modeling of a Heat-Induced Buckling of Plates Using the Mesh-free Method." FIU Digital Commons, 2014. http://digitalcommons.fiu.edu/etd/1512.
Full textAbstract:
In the process of engineering design of structural shapes, the flat plate analysis results can be generalized to predict behaviors of complete structural shapes. In this case, the purpose of this project is to analyze a thin flat plate under conductive heat transfer and to simulate the temperature distribution, thermal stresses, total displacements, and buckling deformations. The current approach in these cases has been using the Finite Element Method (FEM), whose basis is the construction of a conforming mesh. In contrast, this project uses the mesh-free Scan Solve Method. This method eliminates the meshing limitation using a non-conforming mesh. I implemented this modeling process developing numerical algorithms and software tools to model thermally induced buckling. In addition, convergence analysis was achieved, and the results were compared with FEM. In conclusion, the results demonstrate that the method gives similar solutions to FEM in quality, but it is computationally less time consuming.
32
Randrianarivony, Maharavo. "Geometric processing of CAD data and meshes as input of integral equation solvers." Doctoral thesis, [S.l. : s.n.], 2006. http://nbn-resolving.de/urn:nbn:de:swb:ch1-200601972.
Full text
33
Liu, Yu. "Algorithmes pour la méthode des éléments finis et pour la méthode de continuation : application à la contrôlabilité exacte." Compiègne, 1989. http://www.theses.fr/1989COMPD197.
Full textAbstract:
Cette thèse comporte trois parties distinctes. La première partie est consacrée à la génération automatique du maillage pour l'analyse des éléments finis. La méthode est basée sur les fonctions de transformation transfinie. En établissant une relation entre les fonctions d'interpolation de Lagrange et les fonctions d'interpolation transfinie, un procédé systématique de construction est proposé. Par ce procédé, les fonctions transfinies en dimension deux et trois sont construites. Dans la deuxième partie on propose d'abord un nouvel algorithme de continuation d'un système algébrique. La méthode de la prédiction, de la correction, du contrôle du pas de déplacement, et de la localisation des points de retournement sont originales. On présente ensuite deux applications intéressantes de la méthode de continuation. La première consiste à la résolution des équations différentielles et en particulier de celles à solution non unique. La deuxième est l'optimisation des systèmes non linéaires à états multiples. La troisième partie traite d'un problème de contrôlabilité exacte. Il s'agit de la résolution numérique du problème de Cauchy pour l'équation de Laplace. La méthode HUM est d'abord exposée et est analysée. Après avoir démontré deux difficultés de cette méthode nous proposons la méthode RHUM et RHUMS
34
Segura, Lorena. "Consideraciones epistemológicas sobre algunos ítems de los fundamentos de las matemáticas." Doctoral thesis, Universidad de Alicante, 2018. http://hdl.handle.net/10045/80507.
Full textAbstract:
Tomando como punto de partida el proceso revisión de los fundamentos matemáticos llevado a cabo durante el siglo XIX, este estudio se centra en uno de los conceptos matemáticos más importantes: el infinito. Es innegable la importancia de este concepto en el avance de las Matemáticas y es fácil encontrar ejemplos matemáticos en los que interviene (definición de límite, definición de derivada, definición de integral de Riemann, entre otras). Debido a que algunas de las paradojas y contradicciones originadas por la falta de rigor en las Matemáticas están relacionadas con este concepto, se comienza con el estudio epistemológico del concepto matemático del infinito revisando la bipolaridad que presentan algunos conceptos semánticos, definidos de forma inseparable y conjunta, constituyendo un único concepto como si representaran los polos de un imán. En este estudio se concluye que la bipolaridad revela que una lógica conceptual que puede asumir la comprensión de la negación, debe ser una lógica dialéctica, es decir que admite como verdaderas algunas contradicciones. En el caso del concepto matemático de lo finito-infinito, nos encontramos de nuevo con una bipolaridad lógica. Por todo lo expuesto se presenta una teoría no cantoriana para el infinito potencial y actual, basada en la imprecisión lingüística del concepto de infinito, y utilizando el concepto de conjunto homógono, formado por una sucesión convergente y su límite, previamente introducido por Leibniz, que permite aunar los dos polos del concepto de infinito en un único conjunto. Esta nueva teoría de conjuntos permitirá presentar en lenguaje homogónico, algunos de los conceptos fundamentales del análisis tales como, la diferencial y la integral, así como algunas aplicaciones a la Óptica y a la Mecánica Cuántica. Posteriormente se presenta la categoría lógica de la oposición cualitativa a través de diferentes ejemplos de diversas áreas de la ciencia, y se define, a través de tres reglas o normas básicas, el paso de la lógica aristotélica o analítica a la lógica sintética, que incluye al neutro como parte de la oposición cualitativa. Con la aplicación de estas normas a la oposición cualitativa y, en particular, a su neutro, se demuestra que la lógica sintética permite la verdad de algunas contradicciones. Esta lógica sintética es dialéctica y multivaluada y da a cada proposición un valor de verdad en el intervalo [0,1], que coincide con el cuadrado del módulo de un número complejo. Esto marca una notable novedad respecto de la lógica aristotélica o analítica que otorga valores de verdad reales, o incluso a la lógica difusa que, a pesar de ser una lógica multivaluada otorga valores de verdad reales en el intervalo [0,1]. En esta lógica dialéctica, las contradicciones del neutro de una oposición pueden ser verdaderas. Finalmente se plantea la aplicación de la lógica dialéctica, a la Mecánica Cuántica, cuyo carácter es no determinista y en la que es posible encontrar ejemplos de situaciones contradictorias debido a la dualidad onda-corpúsculo. Para ello se establece un isomorfismo entre la lógica dialéctica y la teoría de la probabilidad, a la que se añade el concepto de fortuidad, precisamente para reflejar el carácter no determinista.
35
Strömbeck, Wendel. "Error i cisblicken : en normkritisk studie om cisnormen." Thesis, Konstfack, Institutionen för Bildpedagogik (BI), 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:konstfack:diva-7690.
Full textAbstract:
The cis norm could be described as the norm that forces everyone to be either female or male and that genitals, gender identity and juridical sex should be constant throughout a person’s lifetime. “Cis” means “on the same side” in Latin, and in this study Wendel Strömbeck, student at the Pedagogy Institution of Konstfack, University College of Arts, Crafts and Design, has coined the notion “the cis gaze”. “The cis gaze” refer to a performative act of sorting bodies into a female or male category. Wendel study how people with trans* experiences could experience gazes and pictures in relation to the cis norm. The study is based on the queer community that Wendel is a part of, and includes interviews and self-reflections. “Trans” means “to move over” in Latin and “trans*” refers to the whole spectra of possible ways of transgressing the cis norm. The study is devided into two parallel works, an essay and an artistic figuration, a comic book. The comic book includes rendering of the interviews that Wendel has carried out and an irreverent study of cis gendered persons. The essay also includes rendering of the same interviews and an analysis of a poster for the Hollywood movie Glen or Glenda from 1953
36
Chen, Yi-Ju, and 陳憶茹. "Two-directional Transfinite DLG Surface Generation." Thesis, 2005. http://ndltd.ncl.edu.tw/handle/62894191358379854489.
Full textAbstract:
碩士逢甲大學
應用數學所
93
This thesis develops a surface generation method that is based on the two-directional transfinite interpolation and the DLG interpolation. A corresponding software is constructed by combining “Borland C++ builder” and “Matlab”. “Borland C++ builder” is used to generate the surface points and “Matlab” is used to construct the user interfaces and the graphic interface. At first, the theory of subdivision was introduced. This includes both the approximating scheme and interpolating scheme. Different averaging masks have distinct performances. Because of the pretty good effect on smoothing the curves and the surfaces, we choose DLG as our main scheme. The Boolean sum that combines the DLG interpolation and the two-directional transfinite interpolation was used to generate the two-directional 3D surfaces. Several examples are represented in a special software in order to show the success of this thesis. Within the process of surface generation, it does not only reveal the effect of DLG schemes on distinct surfaces but also explain the procedure of DLG interpolation. The main purpose of this thesis is to construct a software that could combine the DLG interpolation and transfinite interpolation to form a two-directional DLG surface generation. This software also includes several special functions that could reveal the advantages of this new scheme.
37
Lin, Wen-Hsiang, and 林文鄉. "Improvement of Transfinite Interpolation Type Grid by Least Square Method and Application on Transonic Flow Problems." Thesis, 1993. http://ndltd.ncl.edu.tw/handle/75999683409276157741.
Full text
38
Jiang, Chung-Yu, and 江宗諭. "A Study of the China's Economic United Front Strategies toward Taiwan from the Perspective of Transfinite War." Thesis, 2018. http://ndltd.ncl.edu.tw/handle/hj5j8r.
Full textAbstract:
碩士國防大學
中共軍事事務研究所
106
Abstract The CCP’s united front work is the main weapon for maintaining its leadership and national integrity. As time background and the leaders are different, there are differences in the way they are used, including political, cultural, ethnic, economic level and etc . After the reform and opening-up policy in China was carried out, the two sides of the Taiwan Strait exchanged frequently through economic and trade activities. Currently,the economic united front is one of the most important methods of the united front work . The "Transfinite Warfare -Scenarios of War and Fighting in the Age of Globalization" was a military book released by the senior colonel of People's Liberation Army ,Qiao Liang (current Major General) and Wang Xiangsui in 1999. The "transfinite" idea in the book comes from the asymmetric operations of the US military , the Art of War of China and the People's War thinking of PLA, which not only brings brand new aspects for CCP's national defense but also makes special definitions for the forms and types of modern warfare.The "non-military level" and "super-military level" tactics mentioned are different from the military operations emphasized by traditional warfare. They believe that "the type of weapons will evolve and change with the environment. There are possibilities for any methods and ways to be weapons for war as long as it is for the victory ; there are any different possible forms of battlefield and they can be without absolute limits and rules." Therefore, this study uses the thinking and definition of the “Transfinite Warfare” as a approach to further explore how the Chinese Communist Party apply the transfinite warfare on the united front work, and use the “economy” as a weapon of united front for Taiwan and how does Taiwan take appropriate measures for response? The research methods used in the study are''Literature Analysis''and ''Positive Research''. After collecting topics and empirical evidence of the united front , transfinite warfare, economic united front, cross-strait relations, and economic and trade exchanges, it was deduced that the Chinese Communist Party is conducting economic united front work against Taiwan through the thinking and method of transfinite warfare .
39
"Finitism and the Cantorian theory of numbers." 2008. http://library.cuhk.edu.hk/record=b5896870.
Full textAbstract:
Lie, Nga Sze.Thesis (M.Phil.)--Chinese University of Hong Kong, 2008.
Includes bibliographical references (leaves 103-111).
Abstracts in English and Chinese.
Abstract --- p.i
Chapter 1 --- Introduction and Preliminary Discussions --- p.1
Chapter 1.1 --- Introduction --- p.1
Chapter 1.1.1 --- Overview of the Thesis --- p.2
Chapter 1.1.2 --- Background --- p.3
Chapter 1.1.3 --- About Chapter 3: Details of the Theory --- p.4
Chapter 1.1.4 --- About Chapter 4: Defects of the Theory --- p.7
Chapter 1.2 --- Preliminary Discussions --- p.12
Chapter 1.2.1 --- number --- p.12
Chapter 1.2.2 --- mathematical existence and abstract reality --- p.12
Chapter 1.2.3 --- finite/infinite --- p.12
Chapter 1.2.4 --- actually/potentially infinite --- p.13
Chapter 1.2.5 --- denumerability --- p.13
Chapter 1.3 --- Concluding Remarks --- p.14
Chapter 2 --- Mapping Mathematical Philosophies --- p.15
Chapter 2.1 --- Preview --- p.15
Chapter 2.1.1 --- Nominalism --- p.16
Chapter 2.1.2 --- Conceptualism --- p.16
Chapter 2.1.3 --- Intuitionism --- p.17
Chapter 2.1.4 --- Realism --- p.18
Chapter 2.1.5 --- Empiricism --- p.19
Chapter 2.1.6 --- Logicism --- p.19
Chapter 2.1.7 --- Neo-logicism --- p.21
Chapter 2.1.8 --- Formalism --- p.21
Chapter 2.1.9 --- Practicism --- p.23
Chapter 2.2 --- Central Problem of Philosophy of Mathematics --- p.23
Chapter 2.3 --- Metaphysics --- p.24
Chapter 2.3.1 --- Abstractism --- p.24
Chapter 2.3.2 --- Abstractist Schools --- p.25
Chapter 2.3.3 --- Non-abstractism --- p.25
Chapter 2.3.4 --- Non-abstractist Schools --- p.26
Chapter 2.4 --- Semantics --- p.26
Chapter 2.4.1 --- Literalism --- p.26
Chapter 2.4.2 --- Literalistic schools --- p.27
Chapter 2.4.3 --- Non-literalism --- p.27
Chapter 2.4.4 --- Non-literalistic schools --- p.27
Chapter 2.5 --- Epistemology --- p.28
Chapter 2.5.1 --- Scepticism --- p.28
Chapter 2.5.2 --- Scepticist Schools --- p.28
Chapter 2.5.3 --- Non-scepticism --- p.29
Chapter 2.5.4 --- Non-scepticist Schools --- p.29
Chapter 2.6 --- Foundations of Mathematics --- p.30
Chapter 2.6.1 --- Foundationalism --- p.31
Chapter 2.6.2 --- Foundationalist Schools --- p.32
Chapter 2.6.3 --- N on-foundationalism --- p.33
Chapter 2.6.4 --- Non-foundationalist schools --- p.33
Chapter 2.7 --- Finitistic Considerations --- p.33
Chapter 2.7.1 --- Finitism --- p.41
Chapter 2.7.2 --- Finitist Schools --- p.42
Chapter 2.7.3 --- Non-finitism --- p.44
Chapter 2.7.4 --- Non-finitist Schools --- p.44
Chapter 2.8 --- Finitistic Reconsiderations --- p.44
Chapter 2.8.1 --- C-finitism --- p.45
Chapter 2.8.2 --- C-finitist Schools --- p.45
Chapter 2.8.3 --- Non-C-finitism --- p.46
Chapter 2.8.4 --- Non-C-finitist Schools --- p.46
Chapter 2.9 --- Concluding Remarks --- p.47
Chapter 3 --- Principles of Transfinite Theory --- p.48
Chapter 3.0.1 --- Historical Notes on Infinity --- p.48
Chapter 3.0.2 --- Cantor´ةs Proof --- p.49
Chapter 3.1 --- The Domain Principle --- p.51
Chapter 3.1.1 --- Variables and Domain --- p.53
Chapter 3.1.2 --- Attack and Defense --- p.54
Chapter 3.2 --- The Enumeral Principle --- p.56
Chapter 3.2.1 --- Cantor´ةs Ordinal Theory of Numbers --- p.58
Chapter 3.2.2 --- A Well-ordered Set --- p.59
Chapter 3.2.3 --- An Enumeral --- p.59
Chapter 3.2.4 --- An Ordinal Number --- p.60
Chapter 3.2.5 --- Attack and Defense --- p.60
Chapter 3.3 --- The Abstraction Principle --- p.63
Chapter 3.3.1 --- Cantor´ةs Cardinal Theory of Numbers --- p.64
Chapter 3.3.2 --- An Abstract One --- p.65
Chapter 3.3.3 --- One-one Correspondence --- p.65
Chapter 3.3.4 --- A Cardinal Number --- p.65
Chapter 3.3.5 --- Attack and Defense --- p.65
Chapter 3.4 --- Concluding Remarks --- p.68
Chapter 4 --- Problems in Transfinite Theory --- p.70
Chapter 4.1 --- Structure and Procedure --- p.70
Chapter 4.1.1 --- Free Mathematics --- p.72
Chapter 4.1.2 --- Non-constructive Proof --- p.75
Chapter 4.2 --- Number and Numerosity --- p.85
Chapter 4.2.1 --- Weak Reductionism --- p.85
Chapter 4.2.2 --- Non-Cantorian Sets --- p.87
Chapter 4.2.3 --- Intension in an Extensional Theory --- p.89
Chapter 4.3 --- Conceivability and Comparability --- p.95
Chapter 4.3.1 --- Tension with Absolute Infinity --- p.95
Chapter 4.4 --- Conclusion --- p.100
Bibliography --- p.103
40
Slávik, Alexander. "Třídy modulů motivované algebraickou geometrií." Doctoral thesis, 2020. http://www.nusl.cz/ntk/nusl-436934.
Full textAbstract:
This thesis summarises the author's results in representation theory of rings and schemes, obtained with several collaborators. First, we show that for a quasicompact semiseparated scheme X, the derived category of very flat quasicoherent sheaves is equivalent to the derived category of flat quasicoherent sheaves, and if X is affine, this is further equivalent to the homotopy category of projectives. Next, we prove that if R is a commutative Noetherian ring, then every countably generated flat module is quite flat, i.e., a direct summand of a transfinite extension of localizations of R in countable multiplicative subsets. Further, we investigate the relations between the geometric and categorical purity in categories of sheaves; we give a characterization of indecomposable geometric pure-injectives in both the quasicoherent and non-quasicoherent case. In partic- ular, we describe the Ziegler spectrum and its geometric part for the category of quasicoherent sheaves on the projective line over a field. The final result is the equivalence of the following statements for a quasicompact quasiseparated scheme X: (1) the category QCoh(X) of all quasicoherent sheaves on X has a flat generator; (2) for every injective object E of QCoh(X), the internal Hom functor into E is exact; (3) for some injective...
41
Röhl, Claudius. "Das Auswahlaxiom." 2016. https://ul.qucosa.de/id/qucosa%3A16622.
Full textAbstract:
In dieser Arbeit möchte ich dem Wesen des Auswahlaxioms auf den Grund gehen und verstehen, inwieweit es problematisch sein könnte, es zu benutzen, aber auch wie nützlich es ist, dieses mächtige Instrument als Mathematiker zu besitzen.