Heyting algebra
短语词形变化
释义与例句
-
1.
A bounded lattice, L, modified to serve as a model for a logical calculus by being equipped with a binary operation called "implies", denoted → (sometimes ⊃ or ⇒), defined such that (a→b)∧a ≤ b and, moreover, that x = a→b is the greatest element such that x∧a ≤ b (in the sense that if c∧a ≤ b then c ≤ a→b).
数学which is just obvious.
1997, J. G. Stell, M. W. Worboys, The Algebraic Structure of Sets and Regions, Stephen C. Hirtle, Andrew U. Frank (editors), Spatial Information Theory A Theoretical Basis for GIS: International Conference, Proceedings, Springer, LNCS 1329, page 163, The main contention of this paper is that Heyting algebras, and related structures, provide elegant and natural theories of parthood and boundary which have close connections to the above three ontologies.
词源
After Dutch mathematician Arend Heyting, who developed the theory as a way of modelling his intuitionistic logic.
来源：wiktionary