Muutke küpsiste eelistusi
  • Formaat - PDF+DRM
  • Hind: 25,99 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Lisa ostukorvi
  • Lisa soovinimekirja
  • See e-raamat on mõeldud ainult isiklikuks kasutamiseks. E-raamatuid ei saa tagastada.

DRM piirangud

  • Kopeerimine (copy/paste):

    ei ole lubatud

  • Printimine:

    ei ole lubatud

  • Kasutamine:

    Digitaalõiguste kaitse (DRM)
    Kirjastus on väljastanud selle e-raamatu krüpteeritud kujul, mis tähendab, et selle lugemiseks peate installeerima spetsiaalse tarkvara. Samuti peate looma endale  Adobe ID Rohkem infot siin. E-raamatut saab lugeda 1 kasutaja ning alla laadida kuni 6'de seadmesse (kõik autoriseeritud sama Adobe ID-ga).

    Vajalik tarkvara
    Mobiilsetes seadmetes (telefon või tahvelarvuti) lugemiseks peate installeerima selle tasuta rakenduse: PocketBook Reader (iOS / Android)

    PC või Mac seadmes lugemiseks peate installima Adobe Digital Editionsi (Seeon tasuta rakendus spetsiaalselt e-raamatute lugemiseks. Seda ei tohi segamini ajada Adober Reader'iga, mis tõenäoliselt on juba teie arvutisse installeeritud )

    Seda e-raamatut ei saa lugeda Amazon Kindle's. 

Quantum Logic deals with the foundations of quantum mechanics and, related to it, the behaviour of finite, discrete deterministic systems. The quantum logical approach is particulalry suitable for the investigation and exclusion of certain hidden parameter models of quantum mechanics. Conversely, it can be used to embed quantum universes into classical ones. It is also highly relevant for the characterization of finite automation. This book has been written with a broad readership in mind. Great care has been given to the motivation of the concepts and to the explicit and detailed discussions of examples.
Preface v
Hilbert space quantum mechanics
1(6)
Comeasurable observables
7(16)
Elementary propositions
7(2)
Operations and order relations among propositions
9(2)
Subspace operations and order relation (implication)
10(1)
Projection operations and order relation (implication)
11(1)
Definition of comeasurability
11(2)
Spin one-half
13(2)
Spin one
15(4)
Mutually commuting operators as functions of a single ``Ur''-operator
19(2)
Dynamics
21(2)
Complementarity
23(18)
Blocks
23(3)
Pasting of quasi-classical logics
26(1)
Spin one-half
26(3)
Spin one
29(1)
Pastings of higher complexity
30(11)
Finite subalgebras in two dimensions
30(1)
Finite subalgebras of three-dimensional Hilbert logic
31(5)
Finite subalgebras of n-dimensional Hilbert logics
36(3)
Leaving the finite subalgebra case
39(2)
Hilbert lattices
41(10)
Review of basic definitions
42(1)
Algebraic characterization
42(3)
Identities in ``classical'' and quantum logic
42(1)
Nondistributivity
43(1)
Modularity
44(1)
Orthomodularity
44(1)
Algebraic properties
45(1)
Complete Hilbert lattice for spin one-half
45(1)
Hilbert lattice for spin one measurements
46(1)
One-dimensional subspaces in three dimensions
46(5)
Composite systems
51(8)
Tensor products
51(1)
Cartesian product of lattices
51(8)
Probabilities
59(20)
Probabilities in blocks
61(2)
Probabilities in pastings
63(1)
Interlude: two-valued measures and embeddings
64(3)
Spin one-half
67(3)
Nongleason type probability measures
70(2)
Spin one
72(3)
Counter-intuitive probabilities
75(4)
Contextuality
79(32)
Infuturabilities and counterfactuals
79(6)
Kochen-Specker construction
85(6)
Nonfull set of two-valued probability measures
85(2)
Nonseparating set of two-valued probability measures
87(2)
Nonexistence of two-valued probability measures
89(2)
Bell construction
91(2)
Nonfull set of probability measures
91(1)
Nonexistent set of probability measures
92(1)
Peres construction
93(7)
Nonlocality
100(5)
Peres-Mermin construction
101(1)
Greenberger-Horne-Zeilinger-Mermin construction
102(3)
Physical realizability
105(6)
Counterfactuality of the argument
105(3)
Consequences of counterfactual reasoning
108(3)
Quantum tautologies
111(12)
What price value-definiteness?
123(16)
Varieties of embeddings
124(11)
Injective lattice homomorphism
125(1)
Injective order homomorphism preserving lattice operations among comeasurable propositions
126(1)
Injective order homomorphism
126(9)
Surjective extensions
135(1)
Outlook
136(3)
Quasi-classical analogies
139(44)
``Firefly-in-a-box'' and generalized urn models
141(4)
Automaton logic
145(33)
Moore and Mealy automata, state machines and combinatorial circuits
147(1)
Machine isomorphism, serial and parallel decompositions, networks and universality
148(2)
Construction of automation partition logics
150(5)
Varieties
155(5)
Embeddings and characterization
160(8)
Reversibility
168(10)
Elements of generalized probability theory on nonboolean propositional structures
178(5)
Fundamentals
178(1)
Conditional probabilities and interference
178(2)
Examples
180(1)
Counter-intuitive probabilities
181(2)
A Lattice theory 183(18)
A.1 Relations
183(1)
A.2 Partial order relation
184(2)
A.3 Lattice
186(11)
A.3.1 Distributive lattice
188(1)
A.3.2 Boolean lattice
188(1)
A.3.3 Modular lattice
189(1)
A.3.4 Orthomodular lattice
190(1)
A.3.5 Commutator and Center of orthomodular lattice
191(1)
A.3.6 Prime ideal, state
191(1)
A.3.7 Block pasting of orthomodular lattices
192(5)
A.4 Examples
197(4)
A.4.1 Set of subsets of a set
197(1)
A.4.2 Partition logic
197(1)
A.4.3 Greatest common divisor and least common multiplier
198(1)
A.4.4 Lattices defined by Hasse diagrams
198(1)
A.4.5 Lattice of classical propositional calculus
198(3)
References 201(12)
Index 213