Physical content of preparation-question structures and Brouwer-Zadeh lattices (original) (raw)
Related papers
Lattices and Their Consistent Quantification
Annalen der Physik, 2018
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 ordertheoretic 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.
On the Mathematics of Higher Structures
2018
In this paper we will relate hyperstructures and the general H-principle to known mathematical structures, and also discuss how they may give rise to new mathematical structures. The main purpose is to point out new ideas and directions of investigation.
Generalizations of lattices via non-deterministic operators
Discrete Mathematics, 2005
Benado (Čehoslovak. Mat. Ž. 79(4) (1954) 105-129) and later Hansen (Discrete Math. 33(1) (1981) 99-101) have offered an algebraic characterization of multilattice (i.e., a poset where every pair of elements satisfies that any upper bound is greater than or equal to a minimal upper bound, and also satisfies the dual property). To that end, they introduce two algebraic operators that are a generalization of the operators ∧ and ∨ in a lattice. However, in Martinez et al. (Math. Comput. Sci. Eng. (2001) 238-248), we give the only algebraic characterization of the multisemilattice structure that exists in the literature. Moreover, this characterization allows us to give a more adequate characterization of the multilattice structure. The main advantage of our algebraic characterizations is that they are natural generalizations of the semilattice and lattice structures.
What Are Structural Properties?
Informally, structural properties are usually characterized in one of two ways: either as the properties expressible purely in terms of the primitive relations of mathematical theories, or as the properties that hold of all structurally similar mathematical objects. In this paper we present two formal explications of structural properties, corresponding to these two informal characterizations. We wish to reach two goals: First, we want to get clear on the metaphysical interpretation of the notion of structural properties. Second, we wish to understand the relation between the two explications. As will be shown, the two characterizations do not determine the same class of properties. From this observation we draw some philosophical conclusions about the possibility of a “correct” analysis of structural properties.
Lattice-theoretic models of conjectures, hypotheses and consequences
Artificial Intelligence, 2002
Trillas, Cubillo and Castiñeira [Artificial Intelligence 117 (2000) 255-275] defined several interesting operators in orthocomplemented lattices. These operators give a quite general algebraic model for conjectures, consequences and hypotheses. We present some properties of conjectures, consequences and hypotheses in orthocomplemented lattices, which complement or improve the results by Trillas, Cubillo and Castiñeira. Furthermore, we introduce the graded versions of these notions in the setting of residuated lattices and derive some of their properties. These graded notions provide certain mathematical tools for modelling conjectures, consequences and hypotheses in the environment where uncertain and vague information is involved.
arXiv (Cornell University), 2023
Complemented lattices and uniquely complemented lattices are very important, not only in mathematics, but also in physics, biology, and even in social sciences. They have been investigated for a long time, especially by Huntington, Birkhoff, Dilworth and others. And yet, on some of these structures-namely, uniquely complemented nondistributive lattices-, despite the many existing articles concerning them, we basically know very little. In this article, we situate these lattest structures in the context of complemented and uniquely complemented lattices, offering a general overview of the links between these lattices and others, close to them, such as the orthocomplemented lattices of physics as well as various other partially ordered sets. We finally show how uniquely complemented nondistributive lattices have been constructed with the technique of free lattices.
Some nonstandard methods applied to distributive lattices
Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 1990
In memory of Abraham Robinson, on the occasion of his 70th birthday Distributive lattices are locally finite algebras, i.e. their finitely generated sublattices are finite. The general theory of finite distributive lattices is remarkably transparent, due to one or both of the following principles: (i) Any filter (or ideal) is principal. (ii) The lattice is join-generated by its join-irreducible elements, namely by those elements z for which x v y = z implies x = z or y = z .
Lecture Notes in Computer Science, 2011
We present a view of abstraction based on a structure preserving reduction of the Galois connection between a language L of terms and the powerset of a set of instances O. Such a relation is materialized as an extension-intension lattice, namely a concept lattice when L is the powerset of a set P of attributes. We define and characterize an abstraction A as some part of either the language or the powerset of O, defined in such a way that the extension-intension latticial structure is preserved. Such a structure is denoted for short as an abstract lattice. We discuss the extensional abstract lattices obtained by so reducing the powerset of O, together together with the corresponding abstract implications, and discuss alpha lattices as particular abstract lattices. Finally we give formal framework allowing to define a generalized abstract lattice whose language is made of terms mixing abstract and non abstract conjunctions of properties.