logic as a tool for building theories
TRANSCRIPT
![Page 1: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/1.jpg)
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 1 / 29
Logic As A Tool For Building Theories
Samson AbramskyOxford University Computing Laboratory
![Page 2: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/2.jpg)
Introduction
Introduction
• Overview
• The Plan
Case Study I: Modaland Temporal Logic
Case Study II:λ-calculus
Case Study III:Category Theory andCoalgebra
Basic Concepts
Final Remarks
Logic For Building Theories
![Page 3: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/3.jpg)
Overview
Introduction
• Overview
• The Plan
Case Study I: Modaland Temporal Logic
Case Study II:λ-calculus
Case Study III:Category Theory andCoalgebra
Basic Concepts
Final Remarks
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 3 / 29
Practice-based Philosophy of Logic?
![Page 4: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/4.jpg)
Overview
Introduction
• Overview
• The Plan
Case Study I: Modaland Temporal Logic
Case Study II:λ-calculus
Case Study III:Category Theory andCoalgebra
Basic Concepts
Final Remarks
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 3 / 29
Practice-based Philosophy of Logic?
What is the practice?
![Page 5: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/5.jpg)
Overview
Introduction
• Overview
• The Plan
Case Study I: Modaland Temporal Logic
Case Study II:λ-calculus
Case Study III:Category Theory andCoalgebra
Basic Concepts
Final Remarks
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 3 / 29
Practice-based Philosophy of Logic?
What is the practice?
Huge effect of Computer Science on Logic over the past 5 decades:
• new ways of using logic
• new attitudes to logic
• new questions
• new methods
![Page 6: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/6.jpg)
Overview
Introduction
• Overview
• The Plan
Case Study I: Modaland Temporal Logic
Case Study II:λ-calculus
Case Study III:Category Theory andCoalgebra
Basic Concepts
Final Remarks
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 3 / 29
Practice-based Philosophy of Logic?
What is the practice?
Huge effect of Computer Science on Logic over the past 5 decades:
• new ways of using logic
• new attitudes to logic
• new questions
• new methods
Hence new perspective on the question:
What logic is — and should be!
![Page 7: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/7.jpg)
The Plan
Introduction
• Overview
• The Plan
Case Study I: Modaland Temporal Logic
Case Study II:λ-calculus
Case Study III:Category Theory andCoalgebra
Basic Concepts
Final Remarks
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 4 / 29
Before (and while) trying to extract general points, some case studies:
![Page 8: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/8.jpg)
The Plan
Introduction
• Overview
• The Plan
Case Study I: Modaland Temporal Logic
Case Study II:λ-calculus
Case Study III:Category Theory andCoalgebra
Basic Concepts
Final Remarks
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 4 / 29
Before (and while) trying to extract general points, some case studies:
• modal and temporal logic: verification and model-checking
![Page 9: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/9.jpg)
The Plan
Introduction
• Overview
• The Plan
Case Study I: Modaland Temporal Logic
Case Study II:λ-calculus
Case Study III:Category Theory andCoalgebra
Basic Concepts
Final Remarks
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 4 / 29
Before (and while) trying to extract general points, some case studies:
• modal and temporal logic: verification and model-checking
• λ-calculus
![Page 10: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/10.jpg)
The Plan
Introduction
• Overview
• The Plan
Case Study I: Modaland Temporal Logic
Case Study II:λ-calculus
Case Study III:Category Theory andCoalgebra
Basic Concepts
Final Remarks
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 4 / 29
Before (and while) trying to extract general points, some case studies:
• modal and temporal logic: verification and model-checking
• λ-calculus
• coalgebra
![Page 11: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/11.jpg)
The Plan
Introduction
• Overview
• The Plan
Case Study I: Modaland Temporal Logic
Case Study II:λ-calculus
Case Study III:Category Theory andCoalgebra
Basic Concepts
Final Remarks
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 4 / 29
Before (and while) trying to extract general points, some case studies:
• modal and temporal logic: verification and model-checking
• λ-calculus
• coalgebra
Aims: not to put forward any philosophical theses, but to provide some
materials and raise some questions.
![Page 12: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/12.jpg)
Case Study I: Modal andTemporal Logic
Introduction
Case Study I: Modaland Temporal Logic
• ChangingPerspectives
• Some Issues• Some Remarks andQuestions for P-B PoL• The ‘Next 700’Problem
Case Study II:λ-calculus
Case Study III:Category Theory andCoalgebra
Basic Concepts
Final Remarks
Logic For Building Theories
![Page 13: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/13.jpg)
Changing Perspectives
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 6 / 29
![Page 14: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/14.jpg)
Changing Perspectives
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 6 / 29
• From ‘philosophical logic’ to computer-assisted verification. From metaphysics
to (not just potentially but actually ) applied mathematics.
![Page 15: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/15.jpg)
Changing Perspectives
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 6 / 29
• From ‘philosophical logic’ to computer-assisted verification. From metaphysics
to (not just potentially but actually ) applied mathematics.
• From the ‘sacred’ to the ‘profane’. From logic as Guardian of The Truth to logicout in the world, to be used as a tool for understanding many aspects of our
world.
![Page 16: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/16.jpg)
Changing Perspectives
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 6 / 29
• From ‘philosophical logic’ to computer-assisted verification. From metaphysics
to (not just potentially but actually ) applied mathematics.
• From the ‘sacred’ to the ‘profane’. From logic as Guardian of The Truth to logicout in the world, to be used as a tool for understanding many aspects of our
world.
• More concretely: from ‘possible worlds’ and ‘accessibility’ to states and
transitions . Systems of states evolving under discrete transitions turn up in a
huge variety of situations. (Communications protocols, hardware circuits,
software, nowadays biological and physical systems . . . ). Modal and temporal
logics are canonical formalisms for expressing and reasoning about properties
of such systems.
![Page 17: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/17.jpg)
Changing Perspectives
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 6 / 29
• From ‘philosophical logic’ to computer-assisted verification. From metaphysics
to (not just potentially but actually ) applied mathematics.
• From the ‘sacred’ to the ‘profane’. From logic as Guardian of The Truth to logicout in the world, to be used as a tool for understanding many aspects of our
world.
• More concretely: from ‘possible worlds’ and ‘accessibility’ to states and
transitions . Systems of states evolving under discrete transitions turn up in a
huge variety of situations. (Communications protocols, hardware circuits,
software, nowadays biological and physical systems . . . ). Modal and temporal
logics are canonical formalisms for expressing and reasoning about properties
of such systems.
A transition system:
1 2b ca
![Page 18: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/18.jpg)
Some Issues
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 7 / 29
![Page 19: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/19.jpg)
Some Issues
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 7 / 29
• Note the reverse engineering here. Historically, formal systems of modal logic
were developed to study notions of necessity. Then Kripke semantics was
developed to shed light on these formal systems. Now we think of the
structures as the naturally occurring objects of study, the logics as tools for
reasoning about them.
![Page 20: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/20.jpg)
Some Issues
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 7 / 29
• Note the reverse engineering here. Historically, formal systems of modal logic
were developed to study notions of necessity. Then Kripke semantics was
developed to shed light on these formal systems. Now we think of the
structures as the naturally occurring objects of study, the logics as tools for
reasoning about them.
• New questions: algorithmic feasibility. New methods:
![Page 21: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/21.jpg)
Some Issues
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 7 / 29
• Note the reverse engineering here. Historically, formal systems of modal logic
were developed to study notions of necessity. Then Kripke semantics was
developed to shed light on these formal systems. Now we think of the
structures as the naturally occurring objects of study, the logics as tools for
reasoning about them.
• New questions: algorithmic feasibility. New methods:
• model-checking . Given a system description (a transition system) S,
and a property φ we wish the system to satisfy, check if S |= φ. This has
become an enormously influential paradigm over the past 25 years.
Much of the real value lies in cases where the property is not satisfied,
and we get a trace which can lead us to the bug.
![Page 22: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/22.jpg)
Some Issues
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 7 / 29
• Note the reverse engineering here. Historically, formal systems of modal logic
were developed to study notions of necessity. Then Kripke semantics was
developed to shed light on these formal systems. Now we think of the
structures as the naturally occurring objects of study, the logics as tools for
reasoning about them.
• New questions: algorithmic feasibility. New methods:
• model-checking . Given a system description (a transition system) S,
and a property φ we wish the system to satisfy, check if S |= φ. This has
become an enormously influential paradigm over the past 25 years.
Much of the real value lies in cases where the property is not satisfied,
and we get a trace which can lead us to the bug.
• The automata-theoretical paradigm. Encode formulas as automata,
reduce satisfaction to language inclusion, ultimately to graph reachability.
![Page 23: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/23.jpg)
Some Issues
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 7 / 29
• Note the reverse engineering here. Historically, formal systems of modal logic
were developed to study notions of necessity. Then Kripke semantics was
developed to shed light on these formal systems. Now we think of the
structures as the naturally occurring objects of study, the logics as tools for
reasoning about them.
• New questions: algorithmic feasibility. New methods:
• model-checking . Given a system description (a transition system) S,
and a property φ we wish the system to satisfy, check if S |= φ. This has
become an enormously influential paradigm over the past 25 years.
Much of the real value lies in cases where the property is not satisfied,
and we get a trace which can lead us to the bug.
• The automata-theoretical paradigm. Encode formulas as automata,
reduce satisfaction to language inclusion, ultimately to graph reachability.
• Huge expansion to cover real-time, probabilistic and hybrid systems, and ofapplications to include biological systems, security, networks, agent-based
modelling, control systems etc.
![Page 24: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/24.jpg)
Some Remarks and Questions for P-B PoL
Introduction
Case Study I: Modaland Temporal Logic
• ChangingPerspectives
• Some Issues• Some Remarks andQuestions for P-B PoL• The ‘Next 700’Problem
Case Study II:λ-calculus
Case Study III:Category Theory andCoalgebra
Basic Concepts
Final Remarks
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 8 / 29
![Page 25: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/25.jpg)
Some Remarks and Questions for P-B PoL
Introduction
Case Study I: Modaland Temporal Logic
• ChangingPerspectives
• Some Issues• Some Remarks andQuestions for P-B PoL• The ‘Next 700’Problem
Case Study II:λ-calculus
Case Study III:Category Theory andCoalgebra
Basic Concepts
Final Remarks
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 8 / 29
• The attitude that is is just ‘grubby engineering’ — engineers in
overalls infringing on the sacred groves — just won’t wash.
![Page 26: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/26.jpg)
Some Remarks and Questions for P-B PoL
Introduction
Case Study I: Modaland Temporal Logic
• ChangingPerspectives
• Some Issues• Some Remarks andQuestions for P-B PoL• The ‘Next 700’Problem
Case Study II:λ-calculus
Case Study III:Category Theory andCoalgebra
Basic Concepts
Final Remarks
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 8 / 29
• The attitude that is is just ‘grubby engineering’ — engineers in
overalls infringing on the sacred groves — just won’t wash.(Cf. 17th century vis-a-vis the Greeks. McCarthy!).
![Page 27: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/27.jpg)
Some Remarks and Questions for P-B PoL
Introduction
Case Study I: Modaland Temporal Logic
• ChangingPerspectives
• Some Issues• Some Remarks andQuestions for P-B PoL• The ‘Next 700’Problem
Case Study II:λ-calculus
Case Study III:Category Theory andCoalgebra
Basic Concepts
Final Remarks
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 8 / 29
• The attitude that is is just ‘grubby engineering’ — engineers in
overalls infringing on the sacred groves — just won’t wash.(Cf. 17th century vis-a-vis the Greeks. McCarthy!).
• Concrete interpretations grounded in tangible applications whichhave an independent existence for their own reasons transform the
possibilities and give the subject new depth and new energies.
![Page 28: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/28.jpg)
Some Remarks and Questions for P-B PoL
Introduction
Case Study I: Modaland Temporal Logic
• ChangingPerspectives
• Some Issues• Some Remarks andQuestions for P-B PoL• The ‘Next 700’Problem
Case Study II:λ-calculus
Case Study III:Category Theory andCoalgebra
Basic Concepts
Final Remarks
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 8 / 29
• The attitude that is is just ‘grubby engineering’ — engineers in
overalls infringing on the sacred groves — just won’t wash.(Cf. 17th century vis-a-vis the Greeks. McCarthy!).
• Concrete interpretations grounded in tangible applications whichhave an independent existence for their own reasons transform the
possibilities and give the subject new depth and new energies.
• There are passionate methodological debates within this applied
field, e.g. ‘linear time vs. branching time’, which are fertile ground
for conceptual and philosophical analysis. Feasibility becomes a
major new criterion, and approximate answers must be considered.
Such issues are already deeply embedded in physics, but rarely
studied philosophically — they should be!
![Page 29: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/29.jpg)
Some Remarks and Questions for P-B PoL
Introduction
Case Study I: Modaland Temporal Logic
• ChangingPerspectives
• Some Issues• Some Remarks andQuestions for P-B PoL• The ‘Next 700’Problem
Case Study II:λ-calculus
Case Study III:Category Theory andCoalgebra
Basic Concepts
Final Remarks
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 8 / 29
• The attitude that is is just ‘grubby engineering’ — engineers in
overalls infringing on the sacred groves — just won’t wash.(Cf. 17th century vis-a-vis the Greeks. McCarthy!).
• Concrete interpretations grounded in tangible applications whichhave an independent existence for their own reasons transform the
possibilities and give the subject new depth and new energies.
• There are passionate methodological debates within this applied
field, e.g. ‘linear time vs. branching time’, which are fertile ground
for conceptual and philosophical analysis. Feasibility becomes a
major new criterion, and approximate answers must be considered.
Such issues are already deeply embedded in physics, but rarely
studied philosophically — they should be!
• A deep conceptual issue of logic in CS: the ‘next 700 . . . problem’.
![Page 30: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/30.jpg)
The ‘Next 700’ Problem
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 9 / 29
![Page 31: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/31.jpg)
The ‘Next 700’ Problem
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 9 / 29
After Peter Landin. ‘The next 700 Programming Languages’ (in 1966!)
![Page 32: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/32.jpg)
The ‘Next 700’ Problem
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 9 / 29
After Peter Landin. ‘The next 700 Programming Languages’ (in 1966!)
A profusion of possibilities, in e.g.
• programming languages
• type systems
• process calculi
• behavioural equivalences
• logics
![Page 33: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/33.jpg)
The ‘Next 700’ Problem
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 9 / 29
After Peter Landin. ‘The next 700 Programming Languages’ (in 1966!)
A profusion of possibilities, in e.g.
• programming languages
• type systems
• process calculi
• behavioural equivalences
• logics
Is this profusion a ‘scandal’ of our subject?
Or are the underlying paradigms and templates, the methodological toolkits,
sufficient providers of unity?
![Page 34: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/34.jpg)
The ‘Next 700’ Problem
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 9 / 29
After Peter Landin. ‘The next 700 Programming Languages’ (in 1966!)
A profusion of possibilities, in e.g.
• programming languages
• type systems
• process calculi
• behavioural equivalences
• logics
Is this profusion a ‘scandal’ of our subject?
Or are the underlying paradigms and templates, the methodological toolkits,
sufficient providers of unity?
The jury is still out . . .
![Page 35: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/35.jpg)
The ‘Next 700’ Problem
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 9 / 29
After Peter Landin. ‘The next 700 Programming Languages’ (in 1966!)
A profusion of possibilities, in e.g.
• programming languages
• type systems
• process calculi
• behavioural equivalences
• logics
Is this profusion a ‘scandal’ of our subject?
Or are the underlying paradigms and templates, the methodological toolkits,
sufficient providers of unity?
The jury is still out . . .
Cf. Andre Weil: he compared finding the right definitions in algebraic number theory
— which was like carving adamantine rock — to making definitions in the theory of
uniform spaces (which he founded), which was like sculpting with snow.
![Page 36: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/36.jpg)
Case Study II: λ-calculus
Introduction
Case Study I: Modaland Temporal Logic
Case Study II:λ-calculus
• The λ-calculus
• Remarks• Types andCurry-HowardCorrespondence
• Developments
• Domain Theory
• Some Remarks andQuestions for P-B PoL
Case Study III:Category Theory andCoalgebra
Basic Concepts
Final Remarks
Logic For Building Theories
![Page 37: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/37.jpg)
The λ-calculus
Introduction
Case Study I: Modaland Temporal Logic
Case Study II:λ-calculus
• The λ-calculus
• Remarks• Types andCurry-HowardCorrespondence
• Developments
• Domain Theory
• Some Remarks andQuestions for P-B PoL
Case Study III:Category Theory andCoalgebra
Basic Concepts
Final Remarks
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 11 / 29
λ-calculus: a pure calculus of functions.
![Page 38: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/38.jpg)
The λ-calculus
Introduction
Case Study I: Modaland Temporal Logic
Case Study II:λ-calculus
• The λ-calculus
• Remarks• Types andCurry-HowardCorrespondence
• Developments
• Domain Theory
• Some Remarks andQuestions for P-B PoL
Case Study III:Category Theory andCoalgebra
Basic Concepts
Final Remarks
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 11 / 29
λ-calculus: a pure calculus of functions.
Variables x, y, z, . . .
Terms
t ::= x | tu︸︷︷︸
application
| λx. t︸︷︷︸
abstraction
![Page 39: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/39.jpg)
The λ-calculus
Introduction
Case Study I: Modaland Temporal Logic
Case Study II:λ-calculus
• The λ-calculus
• Remarks• Types andCurry-HowardCorrespondence
• Developments
• Domain Theory
• Some Remarks andQuestions for P-B PoL
Case Study III:Category Theory andCoalgebra
Basic Concepts
Final Remarks
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 11 / 29
λ-calculus: a pure calculus of functions.
Variables x, y, z, . . .
Terms
t ::= x | tu︸︷︷︸
application
| λx. t︸︷︷︸
abstraction
The basic equation governing this calculus is β-conversion :
(λx. t)u = t[u/x]
E.g.
(λf. λx. f(fx))(λx. x + 1)0 = · · · 2.
![Page 40: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/40.jpg)
The λ-calculus
Introduction
Case Study I: Modaland Temporal Logic
Case Study II:λ-calculus
• The λ-calculus
• Remarks• Types andCurry-HowardCorrespondence
• Developments
• Domain Theory
• Some Remarks andQuestions for P-B PoL
Case Study III:Category Theory andCoalgebra
Basic Concepts
Final Remarks
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 11 / 29
λ-calculus: a pure calculus of functions.
Variables x, y, z, . . .
Terms
t ::= x | tu︸︷︷︸
application
| λx. t︸︷︷︸
abstraction
The basic equation governing this calculus is β-conversion :
(λx. t)u = t[u/x]
E.g.
(λf. λx. f(fx))(λx. x + 1)0 = · · · 2.
By orienting this equation, we get a ‘dynamics’ — β-reduction
(λx. t)u → t[u/x]
![Page 41: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/41.jpg)
Remarks
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 12 / 29
![Page 42: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/42.jpg)
Remarks
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 12 / 29
This calculus, encapsulated in one slide, is incredibly rich .
![Page 43: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/43.jpg)
Remarks
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 12 / 29
This calculus, encapsulated in one slide, is incredibly rich .
• A universal model of computation — incomparably more wieldy than Turingmachines.
![Page 44: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/44.jpg)
Remarks
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 12 / 29
This calculus, encapsulated in one slide, is incredibly rich .
• A universal model of computation — incomparably more wieldy than Turingmachines. (Caveats: Church’s thesis, resources).
![Page 45: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/45.jpg)
Remarks
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 12 / 29
This calculus, encapsulated in one slide, is incredibly rich .
• A universal model of computation — incomparably more wieldy than Turingmachines. (Caveats: Church’s thesis, resources).
• Indeed, in sugared form the basis of all contemporary functional programming
languages (e.g. ML, Haskell).
![Page 46: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/46.jpg)
Remarks
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 12 / 29
This calculus, encapsulated in one slide, is incredibly rich .
• A universal model of computation — incomparably more wieldy than Turingmachines. (Caveats: Church’s thesis, resources).
• Indeed, in sugared form the basis of all contemporary functional programming
languages (e.g. ML, Haskell).
• Kleene translated the basic results of recursion theory out of lambda calculus
into the familiar φn form.
![Page 47: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/47.jpg)
Remarks
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 12 / 29
This calculus, encapsulated in one slide, is incredibly rich .
• A universal model of computation — incomparably more wieldy than Turingmachines. (Caveats: Church’s thesis, resources).
• Indeed, in sugared form the basis of all contemporary functional programming
languages (e.g. ML, Haskell).
• Kleene translated the basic results of recursion theory out of lambda calculus
into the familiar φn form.
• The untyped calculus allows e.g. terms like ω ≡ λx. xx — self-application.
![Page 48: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/48.jpg)
Remarks
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 12 / 29
This calculus, encapsulated in one slide, is incredibly rich .
• A universal model of computation — incomparably more wieldy than Turingmachines. (Caveats: Church’s thesis, resources).
• Indeed, in sugared form the basis of all contemporary functional programming
languages (e.g. ML, Haskell).
• Kleene translated the basic results of recursion theory out of lambda calculus
into the familiar φn form.
• The untyped calculus allows e.g. terms like ω ≡ λx. xx — self-application.
Hence also Ω ≡ ωω, which diverges :
Ω → Ω → · · ·
![Page 49: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/49.jpg)
Remarks
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 12 / 29
This calculus, encapsulated in one slide, is incredibly rich .
• A universal model of computation — incomparably more wieldy than Turingmachines. (Caveats: Church’s thesis, resources).
• Indeed, in sugared form the basis of all contemporary functional programming
languages (e.g. ML, Haskell).
• Kleene translated the basic results of recursion theory out of lambda calculus
into the familiar φn form.
• The untyped calculus allows e.g. terms like ω ≡ λx. xx — self-application.
Hence also Ω ≡ ωω, which diverges :
Ω → Ω → · · ·
Also, Y ≡ λf. (λx. f(xx))(λx. f(xx)) — recursion.
Yt → (λx. t(xx))(λx. t(xx)) → t((λx. t(xx))(λx. t(xx))) = t(Yt).
![Page 50: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/50.jpg)
Remarks
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 12 / 29
This calculus, encapsulated in one slide, is incredibly rich .
• A universal model of computation — incomparably more wieldy than Turingmachines. (Caveats: Church’s thesis, resources).
• Indeed, in sugared form the basis of all contemporary functional programming
languages (e.g. ML, Haskell).
• Kleene translated the basic results of recursion theory out of lambda calculus
into the familiar φn form.
• The untyped calculus allows e.g. terms like ω ≡ λx. xx — self-application.
Hence also Ω ≡ ωω, which diverges :
Ω → Ω → · · ·
Also, Y ≡ λf. (λx. f(xx))(λx. f(xx)) — recursion.
Yt → (λx. t(xx))(λx. t(xx)) → t((λx. t(xx))(λx. t(xx))) = t(Yt).
Historically, Curry extracted Y from an analysis of Russell’s Paradox .
![Page 51: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/51.jpg)
Types and Curry-Howard Correspondence
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 13 / 29
Simple Type System for ×, →.
VariableΓ, x : t ⊢ x : T
Product
Γ ⊢ t : T Γ ⊢ u : UΓ ⊢ 〈t, u〉 : T × U
Γ ⊢ v : T × UΓ ⊢ π1v : T
Γ ⊢ v : T × UΓ ⊢ π2v : U
FunctionΓ, x : U ⊢ t : T
Γ ⊢ λx. t : U → TΓ ⊢ t : U → T Γ ⊢ u : U
Γ ⊢ tu : T
![Page 52: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/52.jpg)
Types and Curry-Howard Correspondence
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 13 / 29
Natural Deduction System for ∧, ⊃Identity
Γ, A ⊢ AId
Conjunction
Γ ⊢ A Γ ⊢ BΓ ⊢ A ∧ B
∧-introΓ ⊢ A ∧ B
Γ ⊢ A∧-elim-1
Γ ⊢ A ∧ BΓ ⊢ B
∧-elim-2
Implication
Γ, A ⊢ B
Γ ⊢ A ⊃ B⊃-intro
Γ ⊢ A ⊃ B Γ ⊢ AΓ ⊢ B
⊃-elim
![Page 53: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/53.jpg)
Types and Curry-Howard Correspondence
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 13 / 29
If we equate∧ ≡ ×⊃ ≡ →
they are the same!
![Page 54: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/54.jpg)
Developments
Introduction
Case Study I: Modaland Temporal Logic
Case Study II:λ-calculus
• The λ-calculus
• Remarks• Types andCurry-HowardCorrespondence
• Developments
• Domain Theory
• Some Remarks andQuestions for P-B PoL
Case Study III:Category Theory andCoalgebra
Basic Concepts
Final Remarks
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 14 / 29
![Page 55: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/55.jpg)
Developments
Introduction
Case Study I: Modaland Temporal Logic
Case Study II:λ-calculus
• The λ-calculus
• Remarks• Types andCurry-HowardCorrespondence
• Developments
• Domain Theory
• Some Remarks andQuestions for P-B PoL
Case Study III:Category Theory andCoalgebra
Basic Concepts
Final Remarks
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 14 / 29
• ‘The stone the builders rejected . . . ’
![Page 56: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/56.jpg)
Developments
Introduction
Case Study I: Modaland Temporal Logic
Case Study II:λ-calculus
• The λ-calculus
• Remarks• Types andCurry-HowardCorrespondence
• Developments
• Domain Theory
• Some Remarks andQuestions for P-B PoL
Case Study III:Category Theory andCoalgebra
Basic Concepts
Final Remarks
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 14 / 29
• ‘The stone the builders rejected . . . ’The λ-calculus and combinatory logic were a neglected corner of
logic studied by a handful of people until Computer Science —
initially Strachey and Landin, with a part played by Roger Penrose
— put it centre stage in logical methods in CS.
![Page 57: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/57.jpg)
Developments
Introduction
Case Study I: Modaland Temporal Logic
Case Study II:λ-calculus
• The λ-calculus
• Remarks• Types andCurry-HowardCorrespondence
• Developments
• Domain Theory
• Some Remarks andQuestions for P-B PoL
Case Study III:Category Theory andCoalgebra
Basic Concepts
Final Remarks
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 14 / 29
• ‘The stone the builders rejected . . . ’The λ-calculus and combinatory logic were a neglected corner of
logic studied by a handful of people until Computer Science —
initially Strachey and Landin, with a part played by Roger Penrose
— put it centre stage in logical methods in CS.
• These calculi in turn put the study of substitution centre-stage —
not such a humble topic! Russell’s paradox, cut-elimination,
linearity and resources, decidability, complexity, . . .
![Page 58: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/58.jpg)
Developments
Introduction
Case Study I: Modaland Temporal Logic
Case Study II:λ-calculus
• The λ-calculus
• Remarks• Types andCurry-HowardCorrespondence
• Developments
• Domain Theory
• Some Remarks andQuestions for P-B PoL
Case Study III:Category Theory andCoalgebra
Basic Concepts
Final Remarks
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 14 / 29
• ‘The stone the builders rejected . . . ’The λ-calculus and combinatory logic were a neglected corner of
logic studied by a handful of people until Computer Science —
initially Strachey and Landin, with a part played by Roger Penrose
— put it centre stage in logical methods in CS.
• These calculi in turn put the study of substitution centre-stage —
not such a humble topic! Russell’s paradox, cut-elimination,
linearity and resources, decidability, complexity, . . .
• Paradoxes: not just biting the bullet — not bugs but features!
Recursion, fixpoints, the creative uses of computationally specified
infinite objects.
![Page 59: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/59.jpg)
Domain Theory
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 15 / 29
![Page 60: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/60.jpg)
Domain Theory
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 15 / 29
Providing extensional models for λ-calculus — spaces satisfying
D ∼= [D −→ D]
led Dana Scott to Domain Theory .
![Page 61: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/61.jpg)
Domain Theory
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 15 / 29
Providing extensional models for λ-calculus — spaces satisfying
D ∼= [D −→ D]
led Dana Scott to Domain Theory .
Many interesting conceptual aspects of Domain theory:
![Page 62: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/62.jpg)
Domain Theory
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 15 / 29
Providing extensional models for λ-calculus — spaces satisfying
D ∼= [D −→ D]
led Dana Scott to Domain Theory .
Many interesting conceptual aspects of Domain theory:
• Reconciling paradoxes with fixpoints by introducing additional partiallydefined elements.
![Page 63: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/63.jpg)
Domain Theory
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 15 / 29
Providing extensional models for λ-calculus — spaces satisfying
D ∼= [D −→ D]
led Dana Scott to Domain Theory .
Many interesting conceptual aspects of Domain theory:
• Reconciling paradoxes with fixpoints by introducing additional partiallydefined elements.
• A general theory of partial information, dynamics of information increase.
![Page 64: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/64.jpg)
Domain Theory
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 15 / 29
Providing extensional models for λ-calculus — spaces satisfying
D ∼= [D −→ D]
led Dana Scott to Domain Theory .
Many interesting conceptual aspects of Domain theory:
• Reconciling paradoxes with fixpoints by introducing additional partiallydefined elements.
• A general theory of partial information, dynamics of information increase.
• Opens up the (analytical) topology of computation.
![Page 65: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/65.jpg)
Domain Theory
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 15 / 29
Providing extensional models for λ-calculus — spaces satisfying
D ∼= [D −→ D]
led Dana Scott to Domain Theory .
Many interesting conceptual aspects of Domain theory:
• Reconciling paradoxes with fixpoints by introducing additional partiallydefined elements.
• A general theory of partial information, dynamics of information increase.
• Opens up the (analytical) topology of computation.
• Conceptual ambiguity between ontic and epistemic interpretations.
![Page 66: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/66.jpg)
Domain Theory
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 15 / 29
Providing extensional models for λ-calculus — spaces satisfying
D ∼= [D −→ D]
led Dana Scott to Domain Theory .
Many interesting conceptual aspects of Domain theory:
• Reconciling paradoxes with fixpoints by introducing additional partiallydefined elements.
• A general theory of partial information, dynamics of information increase.
• Opens up the (analytical) topology of computation.
• Conceptual ambiguity between ontic and epistemic interpretations.
A discussion of domain theory emphasizing conceptual aspects in my article in theHandbook of Philosophy of Information (ed. van Benthem and Adriaans, Elsevier
2008).
![Page 67: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/67.jpg)
Some Remarks and Questions for P-B PoL
Introduction
Case Study I: Modaland Temporal Logic
Case Study II:λ-calculus
• The λ-calculus
• Remarks• Types andCurry-HowardCorrespondence
• Developments
• Domain Theory
• Some Remarks andQuestions for P-B PoL
Case Study III:Category Theory andCoalgebra
Basic Concepts
Final Remarks
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 16 / 29
![Page 68: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/68.jpg)
Some Remarks and Questions for P-B PoL
Introduction
Case Study I: Modaland Temporal Logic
Case Study II:λ-calculus
• The λ-calculus
• Remarks• Types andCurry-HowardCorrespondence
• Developments
• Domain Theory
• Some Remarks andQuestions for P-B PoL
Case Study III:Category Theory andCoalgebra
Basic Concepts
Final Remarks
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 16 / 29
• The λ-calculus is essentially canonical for functional computation
— no ‘700 problem’ there.
![Page 69: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/69.jpg)
Some Remarks and Questions for P-B PoL
Introduction
Case Study I: Modaland Temporal Logic
Case Study II:λ-calculus
• The λ-calculus
• Remarks• Types andCurry-HowardCorrespondence
• Developments
• Domain Theory
• Some Remarks andQuestions for P-B PoL
Case Study III:Category Theory andCoalgebra
Basic Concepts
Final Remarks
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 16 / 29
• The λ-calculus is essentially canonical for functional computation
— no ‘700 problem’ there.
• What should Church’s thesis for concurrency be?
![Page 70: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/70.jpg)
Some Remarks and Questions for P-B PoL
Introduction
Case Study I: Modaland Temporal Logic
Case Study II:λ-calculus
• The λ-calculus
• Remarks• Types andCurry-HowardCorrespondence
• Developments
• Domain Theory
• Some Remarks andQuestions for P-B PoL
Case Study III:Category Theory andCoalgebra
Basic Concepts
Final Remarks
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 16 / 29
• The λ-calculus is essentially canonical for functional computation
— no ‘700 problem’ there.
• What should Church’s thesis for concurrency be?
• The gap between intension and extension: λ-calculus and its
models vs. recursion theory. Applications of the recursion theory
framework to partial evaluation and mixed computation, program
specialization, computational learning theory, computer viruses!
![Page 71: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/71.jpg)
Some Remarks and Questions for P-B PoL
Introduction
Case Study I: Modaland Temporal Logic
Case Study II:λ-calculus
• The λ-calculus
• Remarks• Types andCurry-HowardCorrespondence
• Developments
• Domain Theory
• Some Remarks andQuestions for P-B PoL
Case Study III:Category Theory andCoalgebra
Basic Concepts
Final Remarks
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 16 / 29
• The λ-calculus is essentially canonical for functional computation
— no ‘700 problem’ there.
• What should Church’s thesis for concurrency be?
• The gap between intension and extension: λ-calculus and its
models vs. recursion theory. Applications of the recursion theory
framework to partial evaluation and mixed computation, program
specialization, computational learning theory, computer viruses!
All based on mining the computation content of the S−m−ntheorem and Kleene’s Second Recursion Theorem. λ-calculus and
its models are too extensional to allow access to this content. Can
we find a unified theory?
![Page 72: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/72.jpg)
Some Remarks and Questions for P-B PoL
Introduction
Case Study I: Modaland Temporal Logic
Case Study II:λ-calculus
• The λ-calculus
• Remarks• Types andCurry-HowardCorrespondence
• Developments
• Domain Theory
• Some Remarks andQuestions for P-B PoL
Case Study III:Category Theory andCoalgebra
Basic Concepts
Final Remarks
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 16 / 29
• The λ-calculus is essentially canonical for functional computation
— no ‘700 problem’ there.
• What should Church’s thesis for concurrency be?
• The gap between intension and extension: λ-calculus and its
models vs. recursion theory. Applications of the recursion theory
framework to partial evaluation and mixed computation, program
specialization, computational learning theory, computer viruses!
All based on mining the computation content of the S−m−ntheorem and Kleene’s Second Recursion Theorem. λ-calculus and
its models are too extensional to allow access to this content. Can
we find a unified theory?
• Game Semantics, full abstraction and full completeness. Again,
see my article in the Handbook of Philosophy of Information (and,
hopefully, forthcoming article in SEP).
![Page 73: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/73.jpg)
Case Study III: Category Theoryand Coalgebra
Introduction
Case Study I: Modaland Temporal Logic
Case Study II:λ-calculus
Case Study III:Category Theory andCoalgebra
• Some Theses AboutCategory Theory
• Coalgebras
Basic Concepts
Final Remarks
Logic For Building Theories
![Page 74: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/74.jpg)
Some Theses About Category Theory
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 18 / 29
![Page 75: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/75.jpg)
Some Theses About Category Theory
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 18 / 29
• Category theory (and not just categorical logic) should be seen as part of logic
— or vice versa!
![Page 76: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/76.jpg)
Some Theses About Category Theory
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 18 / 29
• Category theory (and not just categorical logic) should be seen as part of logic
— or vice versa!
• Logicians should learn category theory!!
![Page 77: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/77.jpg)
Some Theses About Category Theory
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 18 / 29
• Category theory (and not just categorical logic) should be seen as part of logic
— or vice versa!
• Logicians should learn category theory!!
• Philosophers should learn category theory!!!
![Page 78: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/78.jpg)
Some Theses About Category Theory
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 18 / 29
• Category theory (and not just categorical logic) should be seen as part of logic
— or vice versa!
• Logicians should learn category theory!!
• Philosophers should learn category theory!!!
• Category theory is the language of structure. It enables us to see common
patterns far beyond what is otherwise possible.
![Page 79: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/79.jpg)
Some Theses About Category Theory
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 18 / 29
• Category theory (and not just categorical logic) should be seen as part of logic
— or vice versa!
• Logicians should learn category theory!!
• Philosophers should learn category theory!!!
• Category theory is the language of structure. It enables us to see common
patterns far beyond what is otherwise possible.
‘Trivial’ example: isomorphism.
![Page 80: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/80.jpg)
Some Theses About Category Theory
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 18 / 29
• Category theory (and not just categorical logic) should be seen as part of logic
— or vice versa!
• Logicians should learn category theory!!
• Philosophers should learn category theory!!!
• Category theory is the language of structure. It enables us to see common
patterns far beyond what is otherwise possible.
‘Trivial’ example: isomorphism.
• Category theory has a strong normative force : methodologically, it compels
us to ask certain questions — is it functorial , natural , universal ? — whichpoint to the key notions in developing a theory.
![Page 81: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/81.jpg)
Some Theses About Category Theory
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 18 / 29
• Category theory (and not just categorical logic) should be seen as part of logic
— or vice versa!
• Logicians should learn category theory!!
• Philosophers should learn category theory!!!
• Category theory is the language of structure. It enables us to see common
patterns far beyond what is otherwise possible.
‘Trivial’ example: isomorphism.
• Category theory has a strong normative force : methodologically, it compels
us to ask certain questions — is it functorial , natural , universal ? — whichpoint to the key notions in developing a theory.
• Category theory enables us to think bigger thoughts. Many of the mostinteresting conceptual developments in modern mathematics cannot even be
articulated without category theory.
![Page 82: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/82.jpg)
Some Theses About Category Theory
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 18 / 29
• Category theory (and not just categorical logic) should be seen as part of logic
— or vice versa!
• Logicians should learn category theory!!
• Philosophers should learn category theory!!!
• Category theory is the language of structure. It enables us to see common
patterns far beyond what is otherwise possible.
‘Trivial’ example: isomorphism.
• Category theory has a strong normative force : methodologically, it compels
us to ask certain questions — is it functorial , natural , universal ? — whichpoint to the key notions in developing a theory.
• Category theory enables us to think bigger thoughts. Many of the mostinteresting conceptual developments in modern mathematics cannot even be
articulated without category theory.
Examples: Cohomology, categorification, the microcosm principle.
![Page 83: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/83.jpg)
Coalgebras
Introduction
Case Study I: Modaland Temporal Logic
Case Study II:λ-calculus
Case Study III:Category Theory andCoalgebra
• Some Theses AboutCategory Theory
• Coalgebras
Basic Concepts
Final Remarks
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 19 / 29
Category theory allows us to dualize our entire discussion of algebras to
obtain a notion of coalgebras of an endofunctor . However, while
algebras abstract a familiar set of notions (inductive data types, structural
recursion), colagebras open up a new and rather unexpected territory,
and provides an effective abstraction and mathematical theory for acentral class of computational phenomena:
• Programming over infinite data structures : streams, lazy lists,infinite trees . . .
• A novel notion of coinduction
• Modelling state-based computations of all kinds
• The key notion of bisimulation equivalence between processes.
![Page 84: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/84.jpg)
Basic Concepts
Introduction
Case Study I: Modaland Temporal Logic
Case Study II:λ-calculus
Case Study III:Category Theory andCoalgebra
Basic Concepts
• F -Coalgebras
• Final F -coalgebras
• Labelled TransitionSystems
• Transition Graphs asCoalgebras
• The Final Coalgebra
• Some Remarks andQuestions for P-B PoL
Final Remarks
Logic For Building Theories
![Page 85: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/85.jpg)
F -Coalgebras
Introduction
Case Study I: Modaland Temporal Logic
Case Study II:λ-calculus
Case Study III:Category Theory andCoalgebra
Basic Concepts
• F -Coalgebras
• Final F -coalgebras
• Labelled TransitionSystems
• Transition Graphs asCoalgebras
• The Final Coalgebra
• Some Remarks andQuestions for P-B PoL
Final Remarks
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 21 / 29
Let F : C −→ C be a functor.
An F -coalgebra is an arrow γ : A −→ FA for some object A of C. We
say that A is the carrier of the coalgebra, while γ is the behaviour map .
An F -coalgebra homomorphism from γ : A −→ FA to
δ : B −→ FB is an arrow h : A −→ B such that
Aγ
- FA
B
h
?
δ- FB
Fh
?
F -coalgebras and their homomorphisms form a category F−Coalg.
![Page 86: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/86.jpg)
Final F -coalgebras
Introduction
Case Study I: Modaland Temporal Logic
Case Study II:λ-calculus
Case Study III:Category Theory andCoalgebra
Basic Concepts
• F -Coalgebras
• Final F -coalgebras
• Labelled TransitionSystems
• Transition Graphs asCoalgebras
• The Final Coalgebra
• Some Remarks andQuestions for P-B PoL
Final Remarks
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 22 / 29
An F -coalgebra γ is final if for every F -coalgebra δ there is a unique
homomorphism from δ to γ.
Proposition 1 If a final F -coalgebra exists, it is unique up to
isomorphism.
Proposition 2 (Lambek Lemma) If γ : A −→ FA is final, it is an
isomorphism
![Page 87: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/87.jpg)
Labelled Transition Systems
Introduction
Case Study I: Modaland Temporal Logic
Case Study II:λ-calculus
Case Study III:Category Theory andCoalgebra
Basic Concepts
• F -Coalgebras
• Final F -coalgebras
• Labelled TransitionSystems
• Transition Graphs asCoalgebras
• The Final Coalgebra
• Some Remarks andQuestions for P-B PoL
Final Remarks
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 23 / 29
Let A be a set of actions . A labelled transition system over A is a
coalgebra for the functor
LTA : Set −→ Set :: X 7→ Pf(A × X).
Such a coalgebra
γ : S −→ Pf(A × S)
can be understood operationally as follows:
• S is a set of states
• For each state s ∈ S, γ(s) specifies the possible transitions from
that state. We write sa
−→ s′ if (a, s′) ∈ γ(s). We think of such a
transition as consisting of the system performing the action a, and
changing state from s to s′. Note that we regard actions as directlyobservable , while states are not.
![Page 88: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/88.jpg)
Transition Graphs as Coalgebras
Introduction
Case Study I: Modaland Temporal Logic
Case Study II:λ-calculus
Case Study III:Category Theory andCoalgebra
Basic Concepts
• F -Coalgebras
• Final F -coalgebras
• Labelled TransitionSystems
• Transition Graphs asCoalgebras
• The Final Coalgebra
• Some Remarks andQuestions for P-B PoL
Final Remarks
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 24 / 29
Note that any labelled transition graph (or “state machine”) with labels in
A is a coalgebra for LTA.
Examples 1.
1 2b ca
This corresponds to the coalgebra (1, 2, γ)
γ : 1 7→ (a, 1), (b, 2), 2 7→ (c, 2)
2.
1 2 3b
a
ac
1 7→ (b, 2), (c, 1), 2 7→ (a, 1), (a, 3), 3 7→ ∅
![Page 89: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/89.jpg)
The Final Coalgebra
Introduction
Case Study I: Modaland Temporal Logic
Case Study II:λ-calculus
Case Study III:Category Theory andCoalgebra
Basic Concepts
• F -Coalgebras
• Final F -coalgebras
• Labelled TransitionSystems
• Transition Graphs asCoalgebras
• The Final Coalgebra
• Some Remarks andQuestions for P-B PoL
Final Remarks
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 25 / 29
The key point is this.
Proposition 3 For any set A of actions, there is a final LTA-coalgebra
(ProcA, out).
![Page 90: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/90.jpg)
The Final Coalgebra
Introduction
Case Study I: Modaland Temporal Logic
Case Study II:λ-calculus
Case Study III:Category Theory andCoalgebra
Basic Concepts
• F -Coalgebras
• Final F -coalgebras
• Labelled TransitionSystems
• Transition Graphs asCoalgebras
• The Final Coalgebra
• Some Remarks andQuestions for P-B PoL
Final Remarks
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 25 / 29
The key point is this.
Proposition 3 For any set A of actions, there is a final LTA-coalgebra
(ProcA, out).
We think of elements of the final coalgebra as processes . The final
coalgebra provides a “universal semantics” for transition systems, which
is “fully abstract” with respect to observable behaviour.
![Page 91: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/91.jpg)
The Final Coalgebra
Introduction
Case Study I: Modaland Temporal Logic
Case Study II:λ-calculus
Case Study III:Category Theory andCoalgebra
Basic Concepts
• F -Coalgebras
• Final F -coalgebras
• Labelled TransitionSystems
• Transition Graphs asCoalgebras
• The Final Coalgebra
• Some Remarks andQuestions for P-B PoL
Final Remarks
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 25 / 29
The key point is this.
Proposition 3 For any set A of actions, there is a final LTA-coalgebra
(ProcA, out).
We think of elements of the final coalgebra as processes . The final
coalgebra provides a “universal semantics” for transition systems, which
is “fully abstract” with respect to observable behaviour.
All of this generalizes to a large class of endofunctors.
![Page 92: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/92.jpg)
Some Remarks and Questions for P-B PoL
Introduction
Case Study I: Modaland Temporal Logic
Case Study II:λ-calculus
Case Study III:Category Theory andCoalgebra
Basic Concepts
• F -Coalgebras
• Final F -coalgebras
• Labelled TransitionSystems
• Transition Graphs asCoalgebras
• The Final Coalgebra
• Some Remarks andQuestions for P-B PoL
Final Remarks
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 26 / 29
![Page 93: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/93.jpg)
Some Remarks and Questions for P-B PoL
Introduction
Case Study I: Modaland Temporal Logic
Case Study II:λ-calculus
Case Study III:Category Theory andCoalgebra
Basic Concepts
• F -Coalgebras
• Final F -coalgebras
• Labelled TransitionSystems
• Transition Graphs asCoalgebras
• The Final Coalgebra
• Some Remarks andQuestions for P-B PoL
Final Remarks
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 26 / 29
• Coalgebras naturally model state-based systems. They provide a
promising basis for reconciling ontic and epistemic views of
states. The final coalgebra is a universal solution — hence uniqueup to isomorphism — to the problem of constructing states as
determined purely by their observational behaviour.
![Page 94: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/94.jpg)
Some Remarks and Questions for P-B PoL
Introduction
Case Study I: Modaland Temporal Logic
Case Study II:λ-calculus
Case Study III:Category Theory andCoalgebra
Basic Concepts
• F -Coalgebras
• Final F -coalgebras
• Labelled TransitionSystems
• Transition Graphs asCoalgebras
• The Final Coalgebra
• Some Remarks andQuestions for P-B PoL
Final Remarks
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 26 / 29
• Coalgebras naturally model state-based systems. They provide a
promising basis for reconciling ontic and epistemic views of
states. The final coalgebra is a universal solution — hence uniqueup to isomorphism — to the problem of constructing states as
determined purely by their observational behaviour.
• Coalgebraic logic. A generalized modal logic which can be read offsystematically from the type functor T . Generalized duality theory.
![Page 95: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/95.jpg)
Some Remarks and Questions for P-B PoL
Introduction
Case Study I: Modaland Temporal Logic
Case Study II:λ-calculus
Case Study III:Category Theory andCoalgebra
Basic Concepts
• F -Coalgebras
• Final F -coalgebras
• Labelled TransitionSystems
• Transition Graphs asCoalgebras
• The Final Coalgebra
• Some Remarks andQuestions for P-B PoL
Final Remarks
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 26 / 29
• Coalgebras naturally model state-based systems. They provide a
promising basis for reconciling ontic and epistemic views of
states. The final coalgebra is a universal solution — hence uniqueup to isomorphism — to the problem of constructing states as
determined purely by their observational behaviour.
• Coalgebraic logic. A generalized modal logic which can be read offsystematically from the type functor T . Generalized duality theory.
• Corecursion, coinduction: mathematically well-founded treatment of
non-well-founded objects.
![Page 96: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/96.jpg)
Some Remarks and Questions for P-B PoL
Introduction
Case Study I: Modaland Temporal Logic
Case Study II:λ-calculus
Case Study III:Category Theory andCoalgebra
Basic Concepts
• F -Coalgebras
• Final F -coalgebras
• Labelled TransitionSystems
• Transition Graphs asCoalgebras
• The Final Coalgebra
• Some Remarks andQuestions for P-B PoL
Final Remarks
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 26 / 29
• Coalgebras naturally model state-based systems. They provide a
promising basis for reconciling ontic and epistemic views of
states. The final coalgebra is a universal solution — hence uniqueup to isomorphism — to the problem of constructing states as
determined purely by their observational behaviour.
• Coalgebraic logic. A generalized modal logic which can be read offsystematically from the type functor T . Generalized duality theory.
• Corecursion, coinduction: mathematically well-founded treatment of
non-well-founded objects.
Examples: non-well-founded sets, even non-well-found proofs!
![Page 97: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/97.jpg)
Final Remarks
Introduction
Case Study I: Modaland Temporal Logic
Case Study II:λ-calculus
Case Study III:Category Theory andCoalgebra
Basic Concepts
Final Remarks• Logic As A Tool ForBuilding Theories
• Some Challenges forPractice-BasedPhilosophy of Logic
Logic For Building Theories
![Page 98: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/98.jpg)
Logic As A Tool For Building Theories
Introduction
Case Study I: Modaland Temporal Logic
Case Study II:λ-calculus
Case Study III:Category Theory andCoalgebra
Basic Concepts
Final Remarks• Logic As A Tool ForBuilding Theories
• Some Challenges forPractice-BasedPhilosophy of Logic
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 28 / 29
![Page 99: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/99.jpg)
Logic As A Tool For Building Theories
Introduction
Case Study I: Modaland Temporal Logic
Case Study II:λ-calculus
Case Study III:Category Theory andCoalgebra
Basic Concepts
Final Remarks• Logic As A Tool ForBuilding Theories
• Some Challenges forPractice-BasedPhilosophy of Logic
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 28 / 29
Computer Science theories of:
• Processes of various kinds, how to mathematically describe and
reason about them.
• Information: statics of information representation, dynamics ofinformation flow.
![Page 100: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/100.jpg)
Logic As A Tool For Building Theories
Introduction
Case Study I: Modaland Temporal Logic
Case Study II:λ-calculus
Case Study III:Category Theory andCoalgebra
Basic Concepts
Final Remarks• Logic As A Tool ForBuilding Theories
• Some Challenges forPractice-BasedPhilosophy of Logic
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 28 / 29
Computer Science theories of:
• Processes of various kinds, how to mathematically describe and
reason about them.
• Information: statics of information representation, dynamics ofinformation flow.
The formulation and development of these theories uses a lot of logic —essentially is logic, broadly (and properly) construed.
![Page 101: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/101.jpg)
Logic As A Tool For Building Theories
Introduction
Case Study I: Modaland Temporal Logic
Case Study II:λ-calculus
Case Study III:Category Theory andCoalgebra
Basic Concepts
Final Remarks• Logic As A Tool ForBuilding Theories
• Some Challenges forPractice-BasedPhilosophy of Logic
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 28 / 29
Computer Science theories of:
• Processes of various kinds, how to mathematically describe and
reason about them.
• Information: statics of information representation, dynamics ofinformation flow.
The formulation and development of these theories uses a lot of logic —essentially is logic, broadly (and properly) construed.
Logic in the mode of open-ended, outward-reaching modelling, rather
than conservative codification.
![Page 102: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/102.jpg)
Logic As A Tool For Building Theories
Introduction
Case Study I: Modaland Temporal Logic
Case Study II:λ-calculus
Case Study III:Category Theory andCoalgebra
Basic Concepts
Final Remarks• Logic As A Tool ForBuilding Theories
• Some Challenges forPractice-BasedPhilosophy of Logic
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 28 / 29
Computer Science theories of:
• Processes of various kinds, how to mathematically describe and
reason about them.
• Information: statics of information representation, dynamics ofinformation flow.
The formulation and development of these theories uses a lot of logic —essentially is logic, broadly (and properly) construed.
Logic in the mode of open-ended, outward-reaching modelling, rather
than conservative codification.
Considerable potential beyond Computer Science: in physics, biology,
cognitive and social sciences etc.
![Page 103: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/103.jpg)
Some Challenges for Practice-Based Philosophy of Logic
Introduction
Case Study I: Modaland Temporal Logic
Case Study II:λ-calculus
Case Study III:Category Theory andCoalgebra
Basic Concepts
Final Remarks• Logic As A Tool ForBuilding Theories
• Some Challenges forPractice-BasedPhilosophy of Logic
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 29 / 29
![Page 104: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/104.jpg)
Some Challenges for Practice-Based Philosophy of Logic
Introduction
Case Study I: Modaland Temporal Logic
Case Study II:λ-calculus
Case Study III:Category Theory andCoalgebra
Basic Concepts
Final Remarks• Logic As A Tool ForBuilding Theories
• Some Challenges forPractice-BasedPhilosophy of Logic
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 29 / 29
Analyze a real , contemporary research programme in mathematics,
logic or theoretical computer science.
![Page 105: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/105.jpg)
Some Challenges for Practice-Based Philosophy of Logic
Introduction
Case Study I: Modaland Temporal Logic
Case Study II:λ-calculus
Case Study III:Category Theory andCoalgebra
Basic Concepts
Final Remarks• Logic As A Tool ForBuilding Theories
• Some Challenges forPractice-BasedPhilosophy of Logic
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 29 / 29
Analyze a real , contemporary research programme in mathematics,
logic or theoretical computer science.
Study the choices made, the reasons given, the methodologicaldisagreements, what these were really about, why certain contributions
were decisive, why conceptual arguments about approaches were
decided in a certain way.
![Page 106: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/106.jpg)
Some Challenges for Practice-Based Philosophy of Logic
Introduction
Case Study I: Modaland Temporal Logic
Case Study II:λ-calculus
Case Study III:Category Theory andCoalgebra
Basic Concepts
Final Remarks• Logic As A Tool ForBuilding Theories
• Some Challenges forPractice-BasedPhilosophy of Logic
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 29 / 29
Analyze a real , contemporary research programme in mathematics,
logic or theoretical computer science.
Study the choices made, the reasons given, the methodologicaldisagreements, what these were really about, why certain contributions
were decisive, why conceptual arguments about approaches were
decided in a certain way.
This will engage the interest, enthusiasm, and eventually the active
participation of the practitioner community.
![Page 107: Logic As A Tool For Building Theories](https://reader030.vdocuments.pub/reader030/viewer/2022021212/62065d6f8c2f7b1730070f71/html5/thumbnails/107.jpg)
Some Challenges for Practice-Based Philosophy of Logic
Introduction
Case Study I: Modaland Temporal Logic
Case Study II:λ-calculus
Case Study III:Category Theory andCoalgebra
Basic Concepts
Final Remarks• Logic As A Tool ForBuilding Theories
• Some Challenges forPractice-BasedPhilosophy of Logic
Logic For Building Theories Practice-Based PoL: Amsterdam 2009 – 29 / 29
Analyze a real , contemporary research programme in mathematics,
logic or theoretical computer science.
Study the choices made, the reasons given, the methodologicaldisagreements, what these were really about, why certain contributions
were decisive, why conceptual arguments about approaches were
decided in a certain way.
This will engage the interest, enthusiasm, and eventually the active
participation of the practitioner community.
Contrast: Philosophy of Physics vs. Philosophy of Logic andMathematics.