Intuitionistic Logic III Subschemas and Topologies
summary
Explains how Grothendieck topologies are implemented as closure operations on the subobject classifier Omega and uses small categories/diagrams as concrete schemas so predicates are actual morphisms. Shows closure builds local logics (e.g. caring only about “today”) and that finite temporal categories give 2^n topologies while loops collapse to trivial boolean behavior. Demonstrates the closure on Omega → pullback construction for subobjects, contrasts set-theoretic topologies with the double-negation topology, and points to worked examples on schema diagrams and temporal KL A+ style categories.
AI-written summary · about
chapters (20)
- 0:00Introduction
- 1:07Categories
- 5:05Database schema
- 7:25Intuitionistic logic
- 10:16Subobject classifier
- 20:51Boolean logic
- 22:13Simplifying logic
- 24:31Explanation
- 25:08Heritage
- 26:30Closure Operations
- 29:38Closure of Truth
- 32:26Local Predicate
- 33:39Today Tomorrow
- 34:34Set Objects
- 38:38Partial Orders
- 39:48Groundhog Day
- 42:30Database
- 43:26Logical Operations
- 44:35Subobjects
- 45:10Boolean
related talks
01h 02mAlgebraic Structures in Logic and Query Evaluation 3
01h 08mAlgebraic Structures in Logic and Query Evaluation 4
38mConsistency, Acyclicity, and Positive Semirings
01h 05mAlgebraic Structures in Logic and Query Evaluation 2
21mGenerating Collection Transformations from Proofs
01h 01mDatalog and Equality Saturation
36mOptimizing Relational Programs II
42mCategories for the Working Hacker
