Number of the records: 1  

Gleason's theorem and its applications

  1. View book information on page www.obalkyknih.cz

    book


     Dvurečenskij, Anatolij, 1949- - Author
    Dordrecht : Ister science press ; Bratislava : Kluwer, 1993 - 325 s.
    ISBN 0-7923-1990-7 (Kluwer academic publishers), ISBN 80-900486-1-7 (Ister science press)
    Mathematics and its applications (east european series) ;
    Call numberC 278.211
    Umístění
    BranchPlaceInfoSignature
    Lidická ( příruční sklad )k vypůjčeníC 278.211   

    InfoRETRO-CATALOGUING - SHORT RECORD
    Title statementGleason's theorem and its applications
    Main entry-name Dvurečenskij, Anatolij, 1949- (Author)
    Issue dataDordrecht : Ister science press ; Bratislava : Kluwer, 1993
    Phys.des.325 s.
    ISBN0-7923-1990-7 (Kluwer academic publishers)
    80-900486-1-7 (Ister science press)
    Edition Mathematics and its applications (east european series) ; 60
    CountryNizozemsko
    Languageangličtina
    Document kindBOOKS
    This volume deals with Gleason's theorem and Gleason's measures and indicates the many ways in which they can be applied. The book comprises five chapters. Chapter 1 is devoted to elements of Hilbert space theory. Chapter 2 is devoted to quantum logic theory. Gleason's theorem is described and proved in Chapter 3, together with proofs for measures that can attain infinite values. In Chapter 4 the possibility of applying Gleason's theorem to the completeness criteria of inner product spaces is addressed. Chapter 5 discusses orthogonal measures and the unexpected possibility of describing states on Keller spaces, as well as other applications. Throughout the book, important facts and concepts are illustrated exercises. For mathematicians and physicists interested in the mathematical foundations of quantum mechanics, and those whose work involves noncommutative measure theory, orthomodular lattices. Hilbert space theory and probability theory. Zdroj anotace: Web obalkyknih.cz
    Loading…

Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.