Professional Documents
Culture Documents
ESSLLI’08
11-15.VIII.2008
Spectral duality
Short outline of lecture 4
Spectral duality
Distributive lattices in logic
Short outline of lecture 4
Spectral duality
Distributive lattices in logic
Relational completeness of IPC and CPC
Short outline of lecture 4
Spectral duality
Distributive lattices in logic
Relational completeness of IPC and CPC
Topological completeness of IPC and CPC
Spectral topology
We show that τS is T0 .
Spectral spaces
It is a tradeoff;
Spectral duality
ϕ`ϕ
ϕ`ϕ
Γ1 ` ∆1 , ϕ ϕ, Γ2 ` ∆2
.
Γ1 , Γ2 ` ∆1 , ∆2
Algebraic semantics
As a simple example, the inference rule
ϕ`ϕ
Γ1 ` ∆1 , ϕ ϕ, Γ2 ` ∆2
.
Γ1 , Γ2 ` ∆1 , ∆2
ϕ`ϕ
Γ1 ` ∆1 , ϕ ϕ, Γ2 ` ∆2
.
Γ1 , Γ2 ` ∆1 , ∆2
P − ↓(ν(ϕ) − ν(ψ))
= {w ∈ P : for all w0 > w, if w0 ∈ ν(ϕ), then w0 ∈ ν(ψ) },
Relational completeness
Similarly, the representation of Heyting lattices provides us with
the following completeness of IPC:
Relational completeness of IPC: If we interpret formulæ of IPC
as upsets, ∧ as set-theoretic intersection, ∨ as set-theoretic
union, and φ → ψ as
P − ↓(ν(ϕ) − ν(ψ))
= {w ∈ P : for all w0 > w, if w0 ∈ ν(ϕ), then w0 ∈ ν(ψ) },
P − ↓(ν(ϕ) − ν(ψ))
= {w ∈ P : for all w0 > w, if w0 ∈ ν(ϕ), then w0 ∈ ν(ψ) },
P − ↓(ν(ϕ) − ν(ψ))
= {w ∈ P : for all w0 > w, if w0 ∈ ν(ϕ), then w0 ∈ ν(ψ) },
P − ↓(ν(ϕ) − ν(ψ))
= {w ∈ P : for all w0 > w, if w0 ∈ ν(ϕ), then w0 ∈ ν(ψ) },
To summarize:
Summary
To summarize:
To summarize:
To summarize:
To summarize:
So
Summary
So
THANK YOU!!!