![]() |
boundedly complete * 1.In domain theory, a complete partial order is boundedly complete if every bounded subset has a least upper bound. Also called consistently complete English Related Words* absolutely complete * accepted complete liability * army complete penetration * cannot complete * carry complete signal * complete * complete a cycle * complete a task * complete a transaction * complete abortion * complete again * complete amnesty * complete annihilation * complete answer * complete ass |
WEZ Format +3. Şuan Saat: 01:25 PM. |
Powered by vBulletin® Version 3.8.8
Copyright ©2000 - 2025, Jelsoft Enterprises Ltd.