Pair algebras and Galois connections.
From MaRDI portal
Publication:293350
DOI10.1016/S0020-0190(98)00107-0zbMATH Open1341.06004OpenAlexW2145058725MaRDI QIDQ293350FDOQ293350
Authors: Roland C. Backhouse
Publication date: 9 June 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019098001070?np=y
Recommendations
Partial orders, general (06A06) Galois correspondences, closure operators (in relation to ordered sets) (06A15) Applications of universal algebra in computer science (08A70)
Cites Work
- Galois Connexions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- An axiomatic basis for computer programming
- Some Galois connections in elementary number theory
- Unifying theories for logic programming
- The Mathematics of Sentence Structure
- Title not available (Why is that?)
- Title not available (Why is that?)
- Temporal algebra
- Pair algebra and its application to automata theory
- Title not available (Why is that?)
Cited In (5)
This page was built for publication: Pair algebras and Galois connections.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q293350)