Home
Speakers
Programme Committee
Paper Submission
PhD Colloquium
Programme
Registration
Local Information
DVMLG
Alan Turing Year 2012
|
Invited Keynote Speakers.
| Liesbeth
De Mol.
Universiteit Gent. Gent, Belgium
|
| Mirna Damonja.
University of East Anglia. Norwich, U.K.
|
| Helena
Durnová.
Masarykova Univerzita. Brno, Czech Republic.
|
| Salma
Kuhlmann.
Universität Konstanz. Konstanz, Germany
|
| Andy Lewis.
University of Leeds. Leeds, U.K.
|
| Thomas Müller.
Universiteit Utrecht, Utrecht, The Netherlands.
|
| Michael
Rathjen.
University of Leeds. Leeds, U.K.
|
| Jean
Paul Van Bendeghem. Vrije Universiteit Brussel.
Brussels, Belgium
|
PhD Colloquium Speakers.
|
| Oliver Friedmann.
University of Tel Aviv, Tel Aviv, Israel
|
| Peter
Holy.
University of Bristol, Bristol, U.K.
|
| Alexander
Kreuzer.
Technische Universität Darmstadt, Darmstadt, Germany
|
| Philipp
Lücke.
Rheinische Friedrich-Wilhelms-Universität Bonn, Bonn, Germany
|
| Arno Pauly.
University of Cambridge, Cambridge, U.K.
|
Accepted contributed talks.
-
Vasco Brattka.
On the computational content of the Baire Category Theorem.
- Merlin Carl, Paola D'Aquino and Salma Kuhlmann.
Real Closed Exponential Fields and Models of Peano Arithmetic.
- Edgar Daylight.
Towards an Historical Notion of "Turing --- the Father of Computer
Science".
- Justus Diller.
Axiomatizations of functional interpretations.
- Katharina
Dupont.
Definable Valuations and Dependent Fields.
- Elena Ficara.
What Kind of Logic is Hegel's Logic?
- Bernhard Fisseni.
Developing A Formal Framework for 'Natural' Story Similarity.
- Jaime Gaspar.
Krivine's classical realisability and the unprovability of the axiom of
choice
and the continuum hypothesis.
- Anthony Gasperin.
Admissible Sets Above Automatic Structures.
- Naveen Sundar
Govindarajulu and Selmer
Bringsjord.
Proving Theorems using Uncomputable Games: Examples from Physics.
- Joel Hamkins and Zhenhao Li.
Computable functionals on the countable ordinals.
- Anna-Sophie Heinemann.
Mechanization of reasoning and algorithmic thinking: trends in 19th Century
Algebra
of Logic.
- Takanori Hida.
A Computational Interpretation of the Axiom of Determinacy in Arithmetic.
- Marcus
Kracht.
Asymmetric Consequence.
- Ralf Krömer.
``Psychological priority'' vs. effects of training. The foundational
debate
on Category theory revisited.
- Javier
Legris.
On C. S. Peirce's Definitive Idea of Mathematical Logic.
- Arno Pauly and
Martin
Ziegler.
Relative Computability and Uniform Continuity of Relations.
- Giuseppe
Primiero.
Matching, Accessibility, Use: on limitations of computing in a distributed
setting.
- Denis I. Saveliev.
On Zariski topologies of Abelian groups with operations.
- Maja Schepelmann.
Kant's principle of identity.
Peter Schuster and Davide Rinaldi.
Eine Verallgemeinerung des Lemmas von
Krull. (cancelled)
- Elena Tatievskaya.
Frege's Context Principle and Analysis.
- Benno van den Berg, Eyvind Briseid and Pavol
Safarik. A functional interpretation for nonstandard arithmetic.
|