Third International Workshop on Classical Logic and Computation, Brno, Czech Republic
21 August 2010 - 21 August 2010
Czechia
The Third International Workshop on Classical Logic and Computation will be held from 21 to 22 August 2010 in Brno, Czech Republic.
The event will focus on the interplay between programme extraction from constructive proofs and computer science. A related event will focus on recent developments in applied proof theory and constructive mathematics. The fields have a substantial common interest, namely the exploration of the computational content of mathematical and logical principles.
The possibility of extracting useful computational content from classical proofs started gaining ground in the 1990s. At this time, it was discovered that proof interpretations based on Goedel's and Kreisel's ideas can provide new nontrivial algorithms and numerical results, and the Curry-Howard correspondence can be extended to classical logic via programming concepts such as continuations and control operators.
This workshop aims to support a fruitful exchange of ideas between the various lines of research on classical logic and computation. Topics will include:
- calculi adapted to represent classical logic,
- design of programming languages inspired by classical logic,
- cut-elimination for classical systems,
- proof representation and proof search for classical logic,
- translations of classical to intuitionistic proofs,
- constructive interpretation of non-constructive principles,
- witness extraction from classical proofs,
- constructive semantics for classical logic (e.g. game semantics),
- case studies (for any of the previous points).For further information, please visit:
http://www.doc.ic.ac.uk/~svb/CLaC10/(opens in new window)
The event will focus on the interplay between programme extraction from constructive proofs and computer science. A related event will focus on recent developments in applied proof theory and constructive mathematics. The fields have a substantial common interest, namely the exploration of the computational content of mathematical and logical principles.
The possibility of extracting useful computational content from classical proofs started gaining ground in the 1990s. At this time, it was discovered that proof interpretations based on Goedel's and Kreisel's ideas can provide new nontrivial algorithms and numerical results, and the Curry-Howard correspondence can be extended to classical logic via programming concepts such as continuations and control operators.
This workshop aims to support a fruitful exchange of ideas between the various lines of research on classical logic and computation. Topics will include:
- calculi adapted to represent classical logic,
- design of programming languages inspired by classical logic,
- cut-elimination for classical systems,
- proof representation and proof search for classical logic,
- translations of classical to intuitionistic proofs,
- constructive interpretation of non-constructive principles,
- witness extraction from classical proofs,
- constructive semantics for classical logic (e.g. game semantics),
- case studies (for any of the previous points).For further information, please visit:
http://www.doc.ic.ac.uk/~svb/CLaC10/(opens in new window)