About a logic of measurability
نویسندگان
چکیده
منابع مشابه
Measurability Is Not About Information
We comment on the relation between models of information based on signals/partitions, and those based on σ-algebras. We show that more informative signals need not generate finer σ-algebras, hence that Blackwell’s theorem fails if information is modeled as σ-algebras. The reason is that the σ-algebra generated by a partition does not contain all the events that can be known from the information...
متن کاملA Puzzle about Laws, Symmetries and Measurability
I describe a problem about the relations among symmetries, laws andmeasurable quantities. I explain why several ways of trying to solve it will not work, and I sketch a solution that might work. I discuss this problem in the context of Newtonian theories, but it also arises for many other physical theories. The problem is that there are two ways of defining the space-time symmetries of a physic...
متن کاملInformation is not about measurability
We present a simple example where the use of σ-algebras as a model of information leads to a paradoxical conclusion: a decision maker prefers less information to more. We then explain that the problem arises because the use of σ-algebras as the informational content of a signal is inadequate. We provide a characterization of the different models of information in the literature in terms of Blac...
متن کاملA Classical Propositional Logic for Reasoning About Reversible Logic Circuits
We propose a syntactic representation of reversible logic circuits in their entirety, based on Feynman’s control interpretation of Toffoli’s reversible gate set. A pair of interacting proof calculi for reasoning about these circuits is presented, based on classical propositional logic and monoidal structure, and a natural order-theoretic structure is developed, demonstrated equivalent to Boolea...
متن کاملTowards a Logic for Reasoning About Logic Programs Transformation
We give a proof-theoretic analysis of logic programs transformations , viewed as operations on proof trees in the sense of 3, 4, 9, 10]. We present a logic for reasoning about (equivalence preserving) transformations of logic programs. Our main tool is the usage of inference rules; the target program may be obtained as a set of clause introduction proofs with axioms from the source program. The...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: E-LOGOS
سال: 2010
ISSN: 1211-0442,1211-0442
DOI: 10.18267/j.e-logos.274