BEGIN:VCALENDAR
VERSION:2.0
PRODID:ILLC Website
X-WR-TIMEZONE:Europe/Amsterdam
BEGIN:VTIMEZONE
TZID:Europe/Amsterdam
X-LIC-LOCATION:Europe/Amsterdam
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:19700329T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:19701025T030000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:/NewsandEvents/Archives/2020/newsitem/11420/20
 ---21-March-2020-Workshop-Proofs-Computation-Meani
 ng-cancelled
DTSTAMP:20191230T150100
SUMMARY:Workshop "Proofs, Computation, & Meaning",
  cancelled
DTSTART;VALUE=DATE:20200320
DTEND;VALUE=DATE:20200321
LOCATION:Tuebingen, Germany
DESCRIPTION:Due to the Coronavirus outbreak, the w
 orkhop is cancelled!  Around thirty years after th
 e fall of Hilbert's program, the proofs-as-program
 s paradigm established the view that proofs should
  consist in computational or epistemic objects con
 veying evidence to mathematical propositions. The 
 relationship between formal derivations and proofs
  should then be analogous to the one between words
  and their meanings. This view naturally gives ris
 e to questions such as 'which conditions should a 
 formal arrangement of symbols satisfy to represent
  a proof?' or 'when do two formal derivations repr
 esent the same proof?'. These questions underlie p
 ast and current research in proof theory both in t
 he theoretical computer science community (e.g. ca
 tegorical logic, domain theory, linear logic) and 
 in the philosophy community (e.g. proof-theoretic 
 semantics).  In spite of these common motivations 
 and historical roots, it seems that today proof th
 eorists in philosophy and in computer science are 
 losing sight of each other. This workshop aims at 
 contributing to a renaissance of the interaction b
 etween researchers with different backgrounds by e
 stablishing a constructive environment for exchang
 ing views, problems and results.  In addition to r
 egular invited talks, the workshop includes two tu
 torials, aimed at introducing recent ideas on the 
 correspondence between proofs, programs and catego
 ries as well as to the historical and philosophica
 l aspects of the notions of infinity and predicati
 vity.  We invite submissions for contributed talks
  on topics related to the themes of the meeting. T
 hese include, but are not restricted to:   - Ident
 ity of proofs    - Graphical/diagrammatic represen
 tations of proofs   - Typed vs untyped proof theor
 y   - Paradoxes and circular reasoning   - Constru
 ctivism and (im)predicativity   - Duality proofs/r
 efutations   - Computational interpretations of cl
 assical and non-classical logics   - Non-determini
 stic/probabilistic aspects of computation   - Indu
 ctive/co-inductive constructions in proof theory a
 nd type theory   - (Higher-)categorical proof theo
 ry   - Substructural aspects of logic   - Philosop
 hical and historical reflections on any of the abo
 ve
X-ALT-DESC;FMTTYPE=text/html:<div>\n  <p><span sty
 le="font-size: small;"><strong>Due to the Coronavi
 rus outbreak, the workhop is cancelled!</strong></
 span></p>\n\n  <p>Around thirty years after the fa
 ll of Hilbert's program, the proofs-as-programs pa
 radigm established the view that proofs should con
 sist in computational or epistemic objects conveyi
 ng evidence to mathematical propositions. The rela
 tionship between formal derivations and proofs sho
 uld then be analogous to the one between words and
  their meanings. This view naturally gives rise to
  questions such as 'which conditions should a form
 al arrangement of symbols satisfy to represent a p
 roof?' or 'when do two formal derivations represen
 t the same proof?'. These questions underlie past 
 and current research in proof theory both in the t
 heoretical computer science community (e.g. catego
 rical logic, domain theory, linear logic) and in t
 he philosophy community (e.g. proof-theoretic sema
 ntics).</p>\n\n  <p>In spite of these common motiv
 ations and historical roots, it seems that today p
 roof theorists in philosophy and in computer scien
 ce are losing sight of each other. This workshop a
 ims at contributing to a renaissance of the intera
 ction between researchers with different backgroun
 ds by establishing a constructive environment for 
 exchanging views, problems and results.</p>\n\n  <
 p>In addition to regular invited talks, the worksh
 op includes two tutorials, aimed at introducing re
 cent ideas on the correspondence between proofs, p
 rograms and categories as well as to the historica
 l and philosophical aspects of the notions of infi
 nity and predicativity.</p>\n</div><div>\n  <p>We 
 invite submissions for contributed talks on topics
  related to the themes of the meeting. These inclu
 de, but are not restricted to:<br>\n  &nbsp;- Iden
 tity of proofs<br>\n  &nbsp; - Graphical/diagramma
 tic representations of proofs<br>\n  &nbsp;- Typed
  vs untyped proof theory<br>\n  &nbsp;- Paradoxes 
 and circular reasoning<br>\n  &nbsp;- Constructivi
 sm and (im)predicativity<br>\n  &nbsp;- Duality pr
 oofs/refutations<br>\n  &nbsp;- Computational inte
 rpretations of classical and non-classical logics<
 br>\n  &nbsp;- Non-deterministic/probabilistic asp
 ects of computation<br>\n  &nbsp;- Inductive/co-in
 ductive constructions in proof theory and type the
 ory<br>\n  &nbsp;- (Higher-)categorical proof theo
 ry<br>\n  &nbsp;- Substructural aspects of logic<b
 r>\n  &nbsp;- Philosophical and historical reflect
 ions on any of the above</p>\n</div>
URL:http://ls.informatik.uni-tuebingen.de/PCM/
CONTACT:Luca Tranchini at luca.tranchini at gmail.
 com
CONTACT:Paolo Pistone at paolo.pistone at uniroma3
 .it
END:VEVENT
END:VCALENDAR