Sökning: "flexible algebra"

Visar resultat 1 - 5 av 8 avhandlingar innehållade orden flexible algebra.

  1. 1. Problems in the Classification Theory of Non-Associative Simple Algebras

    Författare :Erik Darpö; Ernst Dieterich; Karl-Heinz Fieseler; William Crawley-Boevey; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Division algebra; flexible algebra; normal form; composition algebra; absolute valued algebra; vector product; rotation.; MATHEMATICS; MATEMATIK;

    Sammanfattning : In spite of its 150 years history, the problem of classifying all finite-dimensional division algebras over a field k is still unsolved whenever k is not algebraically closed. The present thesis concerns some different aspects of this problem, and the related problems of classifying all composition and absolute valued algebras. LÄS MER

  3. 2. Contributions to the Metamathematics of Arithmetic: Fixed Points, Independence, and Flexibility

    Författare :Rasmus Blanck; Göteborgs universitet; []
    Nyckelord :HUMANIORA; HUMANITIES; NATURVETENSKAP; NATURAL SCIENCES; arithmetic; incompleteness; flexibility; independence; non-standard models; partial conservativity; interpretability;

    Sammanfattning : This thesis concerns the incompleteness phenomenon of first-order arithmetic: no consistent, r.e. theory T can prove every true arithmetical sentence. The first incompleteness result is due to Gödel; classic generalisations are due to Rosser, Feferman, Mostowski, and Kripke. LÄS MER

  4. 3. On Induction, Coinduction and Equality in Martin-Löf and Homotopy Type Theory

    Författare :Andrea Vezzosi; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Conversion; Parametricity; Higher Inductive Types; Sized Types; Dependent Types; Type Theory; Guarded Types;

    Sammanfattning : Martin Löf Type Theory, having put computation at the center of logical reasoning, has been shown to be an effective foundation for proof assistants, with applications both in computer science and constructive mathematics. One ambition though is for MLTT to also double as a practical general purpose programming language. LÄS MER

  5. 4. Hierarchical Control and Restart of Flexible Manufacturing Systems

    Författare :Kristin Andersson; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Restart; Flexible manufacturing; Finite state automata; Petri nets; Supervisory control theory; Process algebra; Discrete event systems; Hierarchical control; Supervisor synthesis;

    Sammanfattning : Product life-cycles are constantly shortening, and the amount of new product types increases, for example in the automotive industry. Growing demands on flexibility and ability to decrease time to market has made it increasingly important to find methods for fast and accurate development of control programs for flexible manufacturing cells. LÄS MER

  7. 5. Structural Reformulations in System Identification

    Författare :Christian Lyzell; Martin Enqvist; Lennart Ljung; Alessandro Chiuso; Linköpings universitet; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; System identification; Dimension reduction; Subspace identification; Difference algebra;

    Sammanfattning : In system identification, the choice of model structure is important and it is sometimes desirable to use a flexible model structure that is able to approximate a wide range of systems. One such model structure is the Wiener class of systems, that is, systems where the input enters a linear time-invariant subsystem followed by a time-invariant nonlinearity. LÄS MER