Information Flow: The Logic of Distributed SystemsCambridge University Press, 28.07.1997 - 274 Seiten Information is a central topic in computer science, cognitive science, and philosophy. In spite of its importance in the "information age," there is no consensus on what information is, what makes it possible, and what it means for one medium to carry information about another. Drawing on ideas from mathematics, computer science, and philosophy, this book addresses the definition and place of information in society. The authors, observing that information flow is possible only within a connected distribution system, provide a mathematically rigorous, philosophically sound foundation for a science of information. They illustrate their theory by applying it to a wide range of phenomena, from file transfer to DNA, from quantum mechanics to speech act theory. |
Inhalt
An Overview | 21 |
2 | 28 |
State Spaces | 56 |
Classifications and Infomorphisms | 69 |
9 | 117 |
Operations on Theories | 132 |
Boolean Operations and Theories | 138 |
Local Logics | 149 |
Logics and State Spaces | 195 |
Speech Acts | 203 |
Vagueness | 211 |
Commonsense Reasoning | 221 |
Representation | 235 |
Quantum Logic | 243 |
Answers to Selected Exercises | 256 |
268 | |
Reasoning at a Distance | 165 |
Representing Local Logics | 174 |
Distributed Logics | 182 |
Andere Ausgaben - Alle anzeigen
Information Flow: The Logic of Distributed Systems Jon Barwise,Jerry Seligman Keine Leseprobe verfügbar - 2008 |
Information Flow: The Logic of Distributed Systems Jon Barwise,Department of Mathematics Jon Barwise,Jerry Seligman Keine Leseprobe verfügbar - 1997 |
Häufige Begriffe und Wortgruppen
a₁ assume background condition binary channel binary relation Boolean operations bulb carries the information carry information circuit Cla(T codomain components conjunction connected consequence relation consistent partition constraints core Corollary counterexample defined Definition disjunction distributed logic distributed system Dretske's equivalent event classification Evt(S example function given Global Cut height classification Hence Hilbert space idealized token identity indexed family inference infomorphism f information channel information flow inverse image isomorphic Lecture Let f local logic Log(A Log(S logic infomorphism manual mathematical minimal cover negation normal tokens notion possible projection Proof Proposition prove quantum logic quotient r₁ real numbers regular theory represents result S₁ satisfies sentences sequent set of types set theory slider sorites paradox sound and complete space Ssp(A state-space subsets subspace Suppose surjective switch Th(A Th(M Theorem theory interpretation tok(A tok(B typ(A typ(B typ(T Weakening Ziel