AISB convention 2017

  In the run up to AISB2017 convention, I've asked Joanna Bryson, from the organising team, to answer few questions about the convention and what comes with it. Mohammad Majid al-Rifaie ( Tu...


Harold Cohen

Harold Cohen, tireless computer art pioneer dies at 87   Harold Cohen at the Tate (1983) Aaron image in background   Harold Cohen died at 87 in his studio on 27th April 2016 in Encintias California, USA.The first time I hear...


Dancing with Pixies?...

At TEDx Tottenham, London Mark Bishop (the former chair of the Society) demonstrates that if the ongoing EU flagship science project - the 1.6 billion dollar "Human Brain Project” - ultimately succeeds in understanding all as...


Computerised Minds. ...

A video sponsored by the society discusses Searle's Chinese Room Argument (CRA) and the heated debates surrounding it. In this video, which is accessible to the general public and those with interest in AI, Olly's Philosophy Tube ...


Connection Science

All individual members of The Society for the Study of Artificial Intelligence and Simulation of Behaviour have a personal subscription to the Taylor Francis journal Connection Science as part of their membership. How to Acce...



AISB event Bulletin Item

CALL FOR PARTICIPATION: Explicit Paradigms in Logic and Computer Sciences, 4-6 June 2012, Bern, SWITZERLAND

For a preliminary PROGRAM scroll down to the end of this email

Explicitness plays an important role in many parts of mathematics and computer science. 
Constructive and intuitionistic proofs, for example, provide explicit witnesses for existential 
assertions. In the area of explicit mathematics, operations and types are explicitly given by 
terms of the language.

These traditional and well-established areas are complemented by more recent developments. 
Justification logics, the first of which was conceived 20 years ago in Bern, are natural 
extensions of modal logics with the capability of unfolding belief and knowledge modalities 
into explicit justification terms. Even more recent are infon logics, which have been developed 
in the context of distributed authorization and deal with pieces of information explicitly.

The purpose of this workshop is to provide a platform for presenting new results in these research areas.


Sergei Artemov (New York, NY)
Lev Beklemishev (Moscow)
Andreas Blass (Ann Arbor, MI)
Samuel Bucheli (Bern)
Wilfried Buchholz (Munich) ? TBC
Laura Crosilla (Leeds)
Walter Dean (Coventry)
Sebastian Eberhard (Bern)
Melvin Fitting (New York, NY)
Yuri Gurevich (Redmond, WA)
Reinhard Kahle (Lisbon)
Pierluigi Minari (Florence)
Isabel Oitavem (Lisbon)
Wolfram Pohlers (Mnster)
Michael Rathjen (Leeds)
Anton Setzer (Swansea)
Valentin Shehtman (Moscow)
Tatiana Yavorskaya (Moscow)


Gerhard Jger (Chair)
Roman Kuznets
Thomas Strahm
Thomas Studer


Monday, June 4
9:15   ?  10:00	Valentin Shehtman TBA
10:00  ?  10:30	Coffee break
10:30  ?  11:15	Laura Crosilla "Operations and sets, constructively"
11:30  ?  12:00	Sebastian Eberhard "Applicative theories for logarithmic complexity classes"
Lunch break
14:00  ?  14:45	Sergei Artemov "A classical view of constructive semantics"
14:45  ?  15:15	Coffee break
15:15  ?  16:00	Pierluigi Minari "Labelled sequent calculi for modal logics: getting rid of hidden contractions"
16:15  ?  17:00	Wolfram Pohlers "Some applications of semiformal systems"

Tuesday, June 5
9:15   ?  10:00	Michael Rathjen "The existence property and ordinal analysis"
10:00  ?  10:30	Coffee break
10:30  ?  11:15	Lev Beklemishev "Topological semantics of provability logic"
11:30  ?  12:00	Samuel Bucheli "A justification logic with common knowledge"
Lunch break
14:00  ?  14:45	Yuri Gurevich "What, if anything, can be done in linear time?"
14:45  ?  15:15	Coffee break
15:15  ?  16:00	Andreas Blass "Logical justification in distributed authorization"
16:15  ?  17:00	Anton Setzer "Inductive-inductive definitions"
Social dinner

Wednesday, June 6
9:15   ?  10:00	Tatiana Yavorskaya "Arithmetical semantics for the first order logic of proofs"
10:00  ?  10:30	Coffee break
10:30  ?  11:15	Isabel Oitavem "The class NP"
11:30  ?  12:00	Walter Dean "Gdel, Kreisel, and the origin of the Logic of Proofs"
Lunch break
14:00  ?  14:45	Reinhard Kahle "Induction schemata for classes of computational complexity"
14:45  ?  15:15	Coffee break
15:15  ?  16:00	Melvin Fitting "Possible world semantics for first order LP"