DeepAI AI Chat
Log In Sign Up

Lattices and Their Consistent Quantification

by   Kevin H. Knuth, et al.

This paper introduces the order-theoretic concept of lattices along with the concept of consistent quantification where lattice elements are mapped to real numbers in such a way that preserves some aspect of the order-theoretic structure. Symmetries, such as associativity, constrain consistent quantification, and lead to a constraint equation known as the sum rule. Distributivity in distributive lattices also constrains consistent quantification and leads to a product rule. The sum and product rules, which are familiar from, but not unique to, probability theory, arise from the fact that logical statements form a distributive (Boolean) lattice, which exhibits the requisite symmetries.


page 1

page 2

page 3

page 4


Foundations of Inference

We present a simple and clear foundation for finite inference that unite...

Quantifying Rational Belief

Some criticisms that have been raised against the Cox approach to probab...

Isomorphism Revisited

Isomorphism is central to the structure of mathematics and has been form...

Puzzles of Existential Generalisation from Type-theoretic Perspective

The present paper addresses several puzzles related to the Rule of Exist...

On the Conditional Independence Implication Problem: A Lattice-Theoretic Approach

A lattice-theoretic framework is introduced that permits the study of th...

Computing the Minkowski Sum of Convex Polytopes in ^d

We propose a method to efficiently compute the Minkowski sum, denoted by...

PSD Representations for Effective Probability Models

Finding a good way to model probability densities is key to probabilisti...