Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
102
click to vote
ORDER
2008
86
views
more
ORDER 2008
»
Comparison of MacNeille, Canonical, and Profinite Completions
15 years 2 months ago
Download
www.math.nmsu.edu
Using duality theory, we give necessary and sufficient conditions for the MacNeille, canonical, and profinite completions of distributive lattices, Heyting algebras, and Boolean algebras to be isomorphic. Keywords MacNeille completion
Guram Bezhanishvili, Jacob Vosmaer
Real-time Traffic
Duality Theory
|
Keywords MacNeille Completion
|
ORDER 2008
|
Profinite Completion
|
claim paper
Post Info
More Details (n/a)
Added
14 Dec 2010
Updated
14 Dec 2010
Type
Journal
Year
2008
Where
ORDER
Authors
Guram Bezhanishvili, Jacob Vosmaer
Comments
(0)
Researcher Info
ORDER 2000 Study Group
Computer Vision