OnlineWoerterBuecher.de
Internes

Lexikon


embedding


1. One instance of some mathematical object contained with in another instance, e.g. a group which is a subgroup. 2. (domain theory) A complete partial order F in [X -> Y] is an embedding if (1) For all x1, x2 in X, x1 <= x2 <=> F x1 <= F x2 and (2) For all y in Y, x | F x <= y is directed. ("<=" is written in LaTeX as sqsubseteq). (1995-03-27)

In addition suitable contents:
[ 2 ] [ = ] [ ai ] [ al ] [ am ] [ an ] [ ar ] [ arc ] [ as ] [ at ] [ b ] [ be ] [ bg ] [ bj ] [ bs ] [ ca ] [ ch ] [ co ] [ com ] [ complete ] [ con ] [ dd ] [ de ] [ ding ] [ do ] [ domain ] [ domain theory ] [ du ] [ ec ] [ ed ] [ er ] [ et ] [ fi ] [ file ] [ gr ] [ group ] [ h ] [ hr ] [ id ] [ il ] [ in ] [ instance ] [ ir ] [ is ] [ it ] [ LaTeX ] [ Lex ] [ ma ] [ mo ] [ mod ] [ module ] [ mp ] [ na ] [ nc ] [ ne ] [ ng ] [ no ] [ ns ] [ O ] [ object ] [ om ] [ pa ] [ ph ] [ pl ] [ query ] [ rc ] [ re ] [ ro ] [ se ] [ set ] [ so ] [ sqsubseteq ] [ st ] [ su ] [ subseteq ] [ T ] [ th ] [ theory ] [ tt ] [ up ] [ X ] [ Y ]






Go Back ]

Free On-line Dictionary of Computing

Copyright © by OnlineWoerterBuecher.de - (3506 Reads)

All logos and trademarks in this site are property of their respective owner.

Page Generation in 0.1981 Seconds, with 17 Database-Queries
Zurück zur Startseite