• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 17
  • 8
  • 5
  • 2
  • 2
  • 2
  • 2
  • 1
  • Tagged with
  • 39
  • 7
  • 7
  • 6
  • 6
  • 6
  • 6
  • 5
  • 4
  • 4
  • 4
  • 4
  • 4
  • 4
  • 4
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
11

La logique ordinale de Turing

Potvin, Benoit 08 1900 (has links)
Le sujet visé par cette dissertation est la logique ordinale de Turing. Nous nous référons au texte original de Turing «Systems of logic based on ordinals» (Turing [1939]), la thèse que Turing rédigea à Princeton sous la direction du professeur Alonzo Church. Le principe d’une logique ordinale consiste à surmonter localement l’incomplétude gödelienne pour l’arithmétique par le biais de progressions d’axiomes récursivement consistantes. Étant donné son importance considérable pour la théorie de la calculabilité et les fondements des mathématiques, cette recherche méconnue de Turing mérite une attention particulière. Nous retraçons ici le projet d’une logique ordinale, de ses origines dans le théorème d’incomplétude de Gödel jusqu'à ses avancées dans les développements de la théorie de la calculabilité. Nous concluons par une discussion philosophique sur les fondements des mathématiques en fonction d’un point de vue finitiste. / The main subject of this dissertation is Turing’s ordinal logic, i.e. Turing’s attempt to locally overcome Gödel’s incompleteness by means of transfinite recursive progressions. We shall refer to the original 1939 text «Systems of logic based on ordinals» which is, in fact, Turing’s Ph.D thesis at Princeton University under the direction of Professor Alonzo Church. Considering its importance for the theory of computability and the foundations of mathematics, Turing’s paper certainly didn’t get enough attention in the literature. Therefore, we want to retrace Turing’s project of an ordinal logic from its very foundation in Gödel’s incompleteness theorem to its further development in calculability theory. A discussion on the foundations of mathematics from a computational point of view will conclude this memoir.
12

Reputation, informal dealings and contractual dynamics : four essays on contract economics / Réputation, relations informelles et dynamique contractuelle : quatre essais sur l'économie du contrat

Beuve, Jean 08 November 2011 (has links)
Cette thèse cherche à étudier les liens existants entre les contrats formels et les comportements coopératifs. Les contrats formels étant censés faciliter la collaboration et éviter des incompréhensions coûteuses entre les parties, nous nous intéressons dans un premier temps à la manière dont le contrat formel impacte sur la capacité des parties à coopérer. Nous analysons ensuite, dans un même ordre d’idée, la coopération à travers le prisme des renégociations contractuelles. L’objectif est alors d’étudier la façon dont les contrats s’adaptent à un environnement changeant à travers le temps. Enfin, l’étude se porte sur l’impact de l’existence de rapports informels, considérés par la littérature antérieure comme, de manière alternative, substitut ou complément aux contrats formels. Plus précisément, nous étudions comment l’existence de mécanismes relationnels influe sur les choix contractuels. Ainsi, l’objectif est d’améliorer la compréhension du rôle joué par les contrats formels et la coopération informelle dans les relations et d’enrichir la théorie sur les déterminants de l’incomplétude contractuelle. Nos résultats suggèrent que le rôle du contrat formel dans les relations dépend fortement du contexte et de l’identité des parties concernées. Nos résultats permettent également d’identifier la capacité des parties à soutenir un accord relationnel comme une nouvelle source endogène d’incomplétude contractuelle. Enfin, nous obtenons également que les adaptations contractuelles, par le biais des renégociations, ne sont pas nécessairement nocives pour les parties. Au final, nous pensons que cette thèse contribue à la littérature sur le débat entre complémentarité et / ou substituabilité des modes de gouvernance formels et informels ainsi qu’à la littérature sur le lien entre contrat relationnel et l’incomplétude contractuelle endogène. Par conséquent, l’implication majeure de ce travail de thèse est illustrée par la nécessité pour les parties de réfléchir attentivement au contrat initial et aux efforts consentis pour sa rédaction. En premier lieu car le contrat formel impacte sur leur capacité à coopérer ex post et, en second lieu, car le contrat formel peut se révéler être trop complet par rapport au niveau de complétude optimal. / This Ph.D. dissertation seeks to investigate the existing links between cooperative behavior and formal contracts. First, because formal agreements are supposed to facilitate smooth collaboration and avoid costly misunderstandings, we are interested in how formal contracts impact on the ability of parties to cooperate. Following the same intuition, we also analyze cooperation through the lens of renegotiations in order to investigate how contracts adapt themselves through time in a changing environment. Second, we also study the impact of the existence of informal dealings, alternatively considered in previous literature as substitute or complement to formal contracting. More precisely, we aim to investigate how the existence of relational mechanisms may impact on contractual choices. Our goal is thus to improve the understandings of the role played by formal contract and informal cooperation in relationships and to enrich the theory of the determinants of incomplete contract. Our results suggest that the role of formal contract in relationships strongly depends on the context and the identity of parties. Our results also identify the ability of the parties to sustain a relational agreement as a new source of endogenous contractual incompleteness. Finally, we also find that adaptations through contractual renegotiations are not necessarily harmful for the contracting parties. We believe that this Ph.D. dissertation contributes to the literature on the debate of complementarity and/or the substitutability of formal and informal governance and to the literature on the link between relational contract and endogenous contractual completeness. In the end, the overall implication is the necessity for parties to carefully think about the initial contract they draft. Because it has an impact on their ability to cooperate ex post and also because contracts can be over-complete compared to the efficient (i.e. socially optimal) level of completeness.
13

The Soft Budget Constraint and Internally Financed R&D Investment: the Difference of R&D Efficiency within China's Industries

Ko, Chao-pin 02 July 2007 (has links)
Abstract R&D investment differs from general investments due to more and greater uncertainties. Once the R&D technique is selected and the investment turns into sunk cost, a path dependence of the R&D investment will occur that locks in the involved parties in the R&D cooperation relationship and the determined cost path. Due to information asymmetry, whether the executer honestly provides information about the project type will be critical to the profit or loss of the R&D investment. If a high cost type project be confesses, the financier can immediately terminate the project to avoid more losses. On the contrary, if the cost type is concealed, the financier will sink more costs into it. Thus, soft budget constraint should be seriously considered in R&D investments. First, we capture the intrinsic uncertainty in R&D investment by introducing both cost and outcome uncertainties of R&D investment. Furthermore, we introduce the financier type and the executor¡¦s expectation of the probability that a high cost project would be refinanced ex post to establish a dynamic game of incomplete information. With this setup, we develop reputation effects from repeated R&D games. The incentive for the financier to avoid executor¡¦s opportunism by establishing reputation makes the commitment to hard budget constraint credible. Second, we attempt to develop a foundation for the concept of the SBC and to extend the analysis of SBCs to the contractual relationship of R&D investment. Information asymmetry is one important cause for contractual incompleteness, and the only one cause makes two legal contract theories unhelpful. Instead of relying on court enforcement, it is possible for the financier to leave contract terms unspecified and rely on a private self-enforcement mechanism. Writing down explicit contract terms can define the self-enforcing range by imposing a private sanction on the executer perceived to be violating the contract understanding. Such a self-enforcing relationship is a useful framework in which to analyze the SBC of R&D investment. In Chapter 5, we describe industrial R&D activities in China and uses statistics to calculate the softness of budget constraint. The main point of the R&D investment model is that the incentive for the financier to establish reputation increases as the probability of success decreases. With this point of view, given the probability of success for R&D projects in high-tech industries being lower than that in conventional industries, refinancing should be relatively more common in conventional industries than in high-tech industries. Statistics of R&D activities in China confirm the above proposition in that the computer-related industry has the hardest budget constraint compared to other industries within the state-controlled sector.
14

La logique ordinale de Turing

Potvin, Benoit 08 1900 (has links)
Le sujet visé par cette dissertation est la logique ordinale de Turing. Nous nous référons au texte original de Turing «Systems of logic based on ordinals» (Turing [1939]), la thèse que Turing rédigea à Princeton sous la direction du professeur Alonzo Church. Le principe d’une logique ordinale consiste à surmonter localement l’incomplétude gödelienne pour l’arithmétique par le biais de progressions d’axiomes récursivement consistantes. Étant donné son importance considérable pour la théorie de la calculabilité et les fondements des mathématiques, cette recherche méconnue de Turing mérite une attention particulière. Nous retraçons ici le projet d’une logique ordinale, de ses origines dans le théorème d’incomplétude de Gödel jusqu'à ses avancées dans les développements de la théorie de la calculabilité. Nous concluons par une discussion philosophique sur les fondements des mathématiques en fonction d’un point de vue finitiste. / The main subject of this dissertation is Turing’s ordinal logic, i.e. Turing’s attempt to locally overcome Gödel’s incompleteness by means of transfinite recursive progressions. We shall refer to the original 1939 text «Systems of logic based on ordinals» which is, in fact, Turing’s Ph.D thesis at Princeton University under the direction of Professor Alonzo Church. Considering its importance for the theory of computability and the foundations of mathematics, Turing’s paper certainly didn’t get enough attention in the literature. Therefore, we want to retrace Turing’s project of an ordinal logic from its very foundation in Gödel’s incompleteness theorem to its further development in calculability theory. A discussion on the foundations of mathematics from a computational point of view will conclude this memoir.
15

Embracing Incompleteness in Schema Mappings

Rodriguez-Gianolli, Patricia 09 August 2013 (has links)
Various forms of information integration have become ubiquitous in current Business Intelligence (BI) technologies. In many cases, the semantic relationship between heterogeneous data sources is specified using high-level declarative rules, called schema mappings. For decades, Skolem functions have been regarded as an important tool in schema mappings as they permit a precise representation of incomplete information. The powerful mapping language of second-order tuple generating dependencies (SO tgds) permits arbitrary Skolem functions and has been proven to be the right class for modeling many integration problems, such as composition and correlation of mappings. This language is strictly more powerful than the languages used in many integration systems, including source-to-target and nested tgds which are both first-order (FO) languages (commonly known as GLAV and nested GLAV mappings). An important class of GLAV mappings are Local-As-View (LAV) tgds, which has found important application in data integration. These FO mapping languages are known to have more desirable programmatic and computational properties. In this thesis, we present a number of techniques for translating some SO tgds into equivalent, more manageable FO schema mappings. Our results rely on understanding and controlling the presence of incompleteness in mappings. We show that the composition of LAV mappings is not only FO, but can always be expressed as a LAV mapping. As a byproduct, we show that the problem of recovery checking for LAV mappings becomes tractable, in contrast to the case of GLAV mappings for which it is known to be undecidable. We introduce two approaches for transforming SO tgds into equivalent nested GLAV mappings. Our approach considers the presence of source constraints, and provides sufficient conditions for when the rich Skolem functions in SO tgds are well-behaved and have an FO semantics. We experimentally show that these conditions are able to handle a very large number of real schema mappings. Last, we propose a first-step for embracing incompleteness in the context of BI applications. Specifically, we present elements of a formal framework for vivifying data with respect to a business model. We view the task of discovering data-to-business interpretations as one of removing incompleteness from these mappings.
16

Embracing Incompleteness in Schema Mappings

Rodriguez-Gianolli, Patricia 09 August 2013 (has links)
Various forms of information integration have become ubiquitous in current Business Intelligence (BI) technologies. In many cases, the semantic relationship between heterogeneous data sources is specified using high-level declarative rules, called schema mappings. For decades, Skolem functions have been regarded as an important tool in schema mappings as they permit a precise representation of incomplete information. The powerful mapping language of second-order tuple generating dependencies (SO tgds) permits arbitrary Skolem functions and has been proven to be the right class for modeling many integration problems, such as composition and correlation of mappings. This language is strictly more powerful than the languages used in many integration systems, including source-to-target and nested tgds which are both first-order (FO) languages (commonly known as GLAV and nested GLAV mappings). An important class of GLAV mappings are Local-As-View (LAV) tgds, which has found important application in data integration. These FO mapping languages are known to have more desirable programmatic and computational properties. In this thesis, we present a number of techniques for translating some SO tgds into equivalent, more manageable FO schema mappings. Our results rely on understanding and controlling the presence of incompleteness in mappings. We show that the composition of LAV mappings is not only FO, but can always be expressed as a LAV mapping. As a byproduct, we show that the problem of recovery checking for LAV mappings becomes tractable, in contrast to the case of GLAV mappings for which it is known to be undecidable. We introduce two approaches for transforming SO tgds into equivalent nested GLAV mappings. Our approach considers the presence of source constraints, and provides sufficient conditions for when the rich Skolem functions in SO tgds are well-behaved and have an FO semantics. We experimentally show that these conditions are able to handle a very large number of real schema mappings. Last, we propose a first-step for embracing incompleteness in the context of BI applications. Specifically, we present elements of a formal framework for vivifying data with respect to a business model. We view the task of discovering data-to-business interpretations as one of removing incompleteness from these mappings.
17

Quefazeres necessários à docência : imperativos à formação permanente / Quefazeres necessary for teaching: the mandatory continuing education

SILVA, Rogeria Novo da 22 March 2013 (has links)
Made available in DSpace on 2014-08-20T13:47:54Z (GMT). No. of bitstreams: 1 Rogeria Novo da Silva_Dissertacao.pdf: 1148133 bytes, checksum: 476e8231ecdfabb5e0790e9deaec9ba7 (MD5) Previous issue date: 2013-03-22 / This dissertation is the result of research that sought to find the quefazeres necessitated the ongoing training process in order to promote a move Creation , by teachers in ways to teach scientifically organized knowledge and considering the cognitive reality of learners . The Freirian categories (1991 , 1996, 1997 , 2005, 2009 ) for ongoing formation , incompleteness quefazeres and supported the theoretical and methodological organization of this research . In the investigation we sought to examine the records of reflections nine teachers from a public school in Pelotas / RS and the training process produced between the years 2009-2012 records . It is worth noting that at first the data were thematized , pointing to a set of considered indicative bounds of teachers in their professional practice, for , in a second moment , be returned to the group for which broaden them. Finally , we performed a semi - structured interview in order to glimpse the possibility of advancing the limits indicated . The reflection data allowed the construction of a conceptual framework in order to support the work of engineers have aimed to consider the process of teacher learning . He excelled as needed quefazeres a) knowledge of the reality of the student, b ) knowledge of the object of knowledge itself , c) knowledge about the learning process ; d ) knowledge about the process of teaching and e ) knowledge of ways of coordinating the processes of teaching and learning in the classroom . From references Paulo Freire , the research allowed still point to ongoing formation as a possibility to consider the ontological vocation of the subjects to be more , and placed with their centrality condition incompleteness , thus advancing to obtaining the necessary autonomy to the professional practice of teaching. / Esta dissertação é o resultado da pesquisa que buscou encontrar os quefazeres que se tornam necessários ao processo de formação permanente com vistas a promover um movimento de criação, por parte dos professores, de formas de ensinar os conhecimentos cientificamente organizados considerando a realidade cognitiva e concreta dos educandos. As categorias freirianas (1991, 1996, 1997, 2005, 2009) de formação permanente, inacabamento e quefazeres sustentaram a organização teórico-metodológica desta pesquisa. Na investigação buscou-se analisar os registros de reflexões de nove professoras de uma escola municipal de Pelotas/RS e dos registros do processo de formação produzidos entre os anos de 2009-2012. Cabe destacar, que em um primeiro momento os dados foram tematizados, apontando um conjunto de indicativos considerados como limites dos professores em sua atuação profissional, para, em um segundo momento, serem devolvidos ao grupo para que se ampliasse os mesmos. Por fim, realizou-se uma entrevista semi-estruturada a fim de vislumbrar possibilidade de avançar nos limites indicados. A reflexão realizada permitiu a construção de um quadro conceitual com vistas a subsidiar o trabalho de coordenadores que possuam como objetivo considerar o processo de aprendizagem do professor. Destacou-se como quefazeres necessários a) o conhecimento da realidade do aluno; b) o conhecimento do próprio objeto de conhecimento; c) o conhecimento sobre o processo de aprendizagem; d) o conhecimento sobre o processo de ensino; e e) o conhecimento das formas de coordenar os processos de ensino-aprendizagem na sala de aula. A partir de referenciais freirianos, a pesquisa permitiu ainda apontar a formação permanente como possibilidade de considerar a vocação ontológica dos sujeitos de ser mais, bem como colocou com centralidade sua condição de inacabamento, avançando assim à obtenção da autonomia necessária ao exercício profissional da docência.
18

La construction de la mémoire dans les œuvres de Charles Baudelaire et de Stéphane Mallarmé : De l’acte de discours à l’inachèvement et à la fragmentation / The Construction of memory in the works of Charles Baudelaire and Stéphane Mallarmé : from speech acts to incompletness and fragmentation

Bedoui, Ramla 17 January 2014 (has links)
Avec Charles Baudelaire, nous situons le texte poétique comme un lieu où se cristallise la mémoire collective puisqu’il a largement défini la relation de la postérité au souvenir, à la modernité et même à la ville. Dans la mémoire urbaine que nous héritons de son texte, Paris est ainsi transformé en un lieu de mémoire fictif, habité par des personnages de flâneurs. Ceux-ci, devenus à présent archétypaux, incarnent le spleen et décortiquent la société. En introduisant notre second poète, Stéphane Mallarmé, nous approchons le texte poétique comme le lieu où l’anxiété d’influence est dépassée, et où le disciple doit se libérer de la mémoire paralysante de son maître en démantelant la mémoire collective à laquelle il était sujet. Il laisse place à de nouvelles constructions du langage qui produit une mémoire individuelle différente. La mémoire est donc subvertie et constamment déplacée grâce à deux éléments majeurs qui définissent la poésie de Mallarmé : l’inachèvement et la fragmentation. / With Charles Baudelaire, we locate the poetic text as a place where collective memory is crystallized, as he largely defined the relationship of posterity to remembering, modernity, and even to the city. In the urban memory that we inherit from his text, Paris itself is at stake and becomes transformed into a fictional memory place, populated by now archetypal spleen-filled characters and melancholy flâneurs heading toward artificial paradises. In introducing our second poet, Stéphane Mallarmé, we approach the poetic text as the location where the anxiety of influence is worked through, where the disciple must liberate himself from the paralyzing memory of his master by dismantling the collective memory to which he had been subject. The latter now gives way to new constructions of language that bring about a different individual memory. Memory is therefore subverted and constantly displaced thanks to two major elements that define Mallarméen poetry: incompleteness and fragmentation.
19

Uma prova de incompletude da aritmética baseada no teorema das definições recursivas / A proof of incompleteness for arithmetic by means of the Theorem of the Definion by Recursion

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

Uma prova de incompletude da aritmética baseada no teorema das definições recursivas / A proof of incompleteness for arithmetic by means of the Theorem of the Definion by Recursion

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

Page generated in 0.078 seconds