About 14,100 results
James F. Peters, Ivo Düntsch, Jerzy Grzymala-Busse - 2007 - 498 pages
|We may also define join-sublattices, meet-sublattices, complete join-sublattices, |
and complete meet-sublattices in a similar ... Every order-isomorphism is a
complete morphism, and every complete join- morphism, as well as every
|Coq). This book give an introduction to parts of proof theory and related aspects of type theory relevant for the Curry-Howard isomorphism. It can serve as an introduction to any or both of typed lambda-calculus and intuitionistic logic.|
Eduard Čech, Zdeněk Frolík, Miroslav Katětov - 1966 - 893 pages
|In view of these facts, it is convenient to consider mappings which preserve joins |
or meets or both. ... A bijective mapping F of si onto ^ is called a join-isomorphism
or a join-isomorphic mapping if it satisfies the above conditions (1) — (3).
|Join epimorphisms between join semilattices with zeros do not necessarily map |
atoms to elements which are either zero or atoms, as the ... Every join-
isomorphism between atomic semilattices maps atoms to atoms in the < y
|is called a complete join-semilattice isomorphism (complete meet-semilattice |
isomorphism, complete lattice isomorphism respectively), if / is bijective and, both
/ : LO - * LI and f~l : LI -4 LQ are complete join preserving (complete meet ...
Leonid A. Bokut, Anatoliĭ Ivanovich Malʹt︠s︡ev, Alekseĭ Ivanovich Kostrikin - 1992 - 666 pages
|In this case the above isomorphism between cops, and the congruence lattice of |
the free Boolean algebra does not, in view of Theorem 1.7, preserve the property
of being a join-endomorphism induced by a substitution of finite support. It is an ...
Kenneth H. Rosen - 1999 - 1248 pages
|isomorphic (pair of graphs): a pair of graphs with identical mathematical structure; |
formally, a pair of graphs such that ... in the other graph. isomorphism type: given
a graph [digraph] G, the class of all graphs [digraphs] isomorphic to G. join: ...
|Produce C1A to C&, 0^D^ to 05; make ACn = D&0&=ACr Join 0505, A0B. Then it |
will be found that Ojd5 produced will cut 0505 in 05. Let Cfj(Zjoj(Z2 (fig. 39) be
the face of the twenty-four-faced trapezohedron derived from (fig. 31, Plate IV.).
|... 48 intuitionistic logic, 28, 32 intnitionistic sequent, 165 inversion principle, 33, |
100 invertible rule, 387 IPG, 32 Isabelle, 98 isomorphism, 365 It, an iterator, 255,
266 Jnékowski, S., 49 join, 35 judgement, 32, 5'7, 328 jump, 134 K, 2, 11 Kalmfir,
|The mapping V : (%n(L\o) = dn<L)l% is a lattice isomorphism which is also a |
morphism of multiplication. Proof, y is ... Hence the mapping hQ : &n(L)/Q-> M
given by hQ(AQ) =//(A) is a join isomorphism and preseives multiplication. It
follows that ...