• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 80
  • 11
  • 7
  • 5
  • 5
  • 5
  • 5
  • 5
  • 5
  • 5
  • 3
  • 2
  • 1
  • 1
  • 1
  • Tagged with
  • 143
  • 143
  • 44
  • 24
  • 21
  • 13
  • 13
  • 11
  • 11
  • 11
  • 11
  • 10
  • 10
  • 10
  • 9
  • 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

Prikry-Forcing und einige Verallgemeinerungen

Löffelmann, Jochen. January 1900 (has links)
Thesis (doctoral)--Rheinische Friedrich-Wilhelms-Universität Bonn, 2001. / Includes bibliographical references (p. 107-109).
12

Topics in the model theory of set theory

Enayat, Ali. January 1983 (has links)
Thesis (Ph. D.)--University of Wisconsin--Madison, 1984. / Typescript. Vita. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references (leaves 91-94).
13

Model theory of probability logic

Hoover, Douglas Neil. January 1978 (has links)
Thesis--Wisconsin. / Vita. Includes bibliographical references (leaves 98-99).
14

Normalisation techniques in proof theory and category theory

Hamza, Taher Tawfik Ahmed January 1986 (has links)
The word problem for the free categories with some structure generated by a category X can be solved using proof-theoretical means. These free categories give a semantics in which derivations of GENTZEN's propositional sequent calculus can be interpreted by means of arrows of those categories. In this thesis we describe, implement and document the cut-elimination and the normalization techniques in proof theory as outlined in SZABO [1978]: we show how these are used in order to solve, mechanically, the word problem for the free categories with structure of : cartesian, bicartesian, distributive bicartesian, cartesian closed, and bicartesian closed. This implementation is extended by a procedure to interpret intuitionistic propositional sequent derivations as arrows of the above categories. Implementation of those techniques has forced us to modify the techniques in various inessential ways. The description and the representation in the syntax of our implementation of the above categories is contained in chapters 1 - 5, where each chapter describes one theory and concludes with examples of the system In use to represent concepts and solve simple word problems from category theory ( of various typos ). Appendix 1 contains some apparent printing errors we have observed in the work done by SZABO. The algorithms used in the proof of the cut-elimination theorems and normalization through chapters 1 - 5 are collected in appendices 2 - 4. Appendices 5 - 8 concern the implementation and its user manual.
15

Applications of Stability-Theoretical Methods to Theories of Modules

Kucera, Thomas Glen 08 1900 (has links)
No description available.
16

Continuous Model Theory and Finite-Representability Between Banach Spaces

Conley, Sean 05 1900 (has links)
In this thesis, we consider the problem of capturing finite-representability between Banach spaces using the tools of continuous model theory. We introduce predicates and additional sorts to capture finite-representability and show that these can be used to expand the language of Banach spaces. We then show that the class of infinite-dimensional Banach spaces expanded with this additional structure forms an elementary class K_G , and conclude that the theory T_G of K_G is interpretable in T^{eq} , where T is the theory of infinite-dimensional Banach spaces. Finally, we show that existential equivalence in a reduct of the language implies finite-representability. Relevant background on continuous model theory and Banach space theory is provided. / Thesis / Master of Science (MSc)
17

On generalized Jónsson classes.

Sevee, Denis Edward January 1972 (has links)
No description available.
18

Model theory of holomorphic functions in an o-minimal setting

Utreras Alarcon, Javier Antonio January 2015 (has links)
Given an o-minimal structure on the real field, we consider an elementary extension to a non-archimedean field R, and interpret the algebraically closed field K=R[sqrt(-1)] on this extension. We construct two pregeometries on K: one by considering images under C-definable holomorphic functions, and the other by considering images under proper restrictions of C-definable holomorphic functions together with algebraic functions (i.e. zeros of polynomials).We show that these two pregeometries are the same, generalising a result of A. Wilkie for complex holomorphic functions. We also do some work towards generalising another result of his on local definability of complex holomorphic functions to our non-archimedean setting.
19

Interpolation theorems for many-sorted infinitary languages.

Sharkey, Robert John January 1972 (has links)
No description available.
20

Automatic generation of interference-free geometric models of spatial mechanisms /

Keil, Mitchel J., January 1990 (has links)
Thesis (Ph. D.)--Virginia Polytechnic Institute and State University, 1990. / Vita. Abstract. Includes bibliographical references (leaves 100-109). Also available via the Internet.

Page generated in 0.0491 seconds