The Azimuth Project
Applied Category Theory - Chapter 1 - Puzzles (Rev #1)
Skip the Navigation Links
|
Home Page
|
All Pages
|
Recently Revised
|
Authors
|
Feeds
|
Applied Category Theory
Ex 1.1 : property preservation
Ex 1.2 : joining systems
Ex 1.3 : partitions
Ex 1.4 : meet join
Ex 1.5 :
Ex 1.9 :
Ex 1.12 :
Ex 1.15 : What is a function?
Ex 1.18 : Surjection = Partion
Ex 1.26 : Hasse
Ex 1.28 : preorder of partions
Ex 1.30 : divison preorder
Ex 1.31 : total order
Ex 1.35 : Simple Hasse
Ex 1.37 :
Ex 1.39 : upper sets
Ex 1.41 : poset product
Ex 1.49 : monotone maps vs. discrete posets
Ex 1.50 : monotone maps & their inverses
Ex 1.52 : monotone maps between posets
Ex 1.54 : skeletal dagger = poset
Ex 1.57 : binary surjection on preorder on partion
Ex 1.57 : pullback map
Ex 1.65 : meets and joins
Ex 1.65 : meets and joins
Ex 1.67 : meets and joins
Ex 1.72 : adjunctions
Ex 1.75 : adjunctions
Ex 1.77 :
Ex 1.79 :
Ex 1.80 : Galois connections
Ex 1.82 : Galois connections
Ex 1.83 :
Ex 1.85 :
Ex 1.87 :
Ex 1.90 :
Ex 1.91 :
Ex 1.96 :
Ex 1.97 :
Revision from April 4, 2018 01:20:14 by
fred.eisele
Forward in time
(5 more)
|
See current
|
History
|
Rollback
| View:
Source
| Linked from:
Applied Category Theory Course