Postdoctoral Position on Structural Proof Theory
General Information
Project Information
Requirements
Application Procedure
Research Environment
Bibliography
General Information
A Postdoctoral Position is available at the Vienna University of Technology within the project
"Nonclassical Proofs: theory, applications and tools", led by Agata Ciabattoni.
The work will take place within the Institute of Computer Languages (
Theory and Logic group ).
The post is for an appointment of up to 24 months, will have a
Net salary of approx. 2000 Euro pro month (14 times a year),
and is available from January 2012 (flexible starting date).
Further funding for IT support and conference travelling will be available.
Project Information
The project, funded by the Austrian Science Fund as a START prize ,
will begin in December 2011 and last till November 2017.
The project aims to develop theoretical and engineering tools for automatically and systematically defining analytic calculi for nonclassical logics. The resulting tools will be further exploited
to systematically investigate nonclassical logics. Various results, currently proved in a logictailored fashion,
will be established in a uniform way for large classes of logics;
among them decidability, complexity, Herbrand's theorem, elimination and admissibility of a plethora of rules,
and ordertheoretic completions of algebras.
The focus will not be on particular calculi,
logics or algebras, but on general and uniform results whose instantiations are expected
(i) to help logic users in the spirit of 'logic engineering', and
(ii) to solve open questions on specific logics, calculi or algebras.
Requirements
Applicants should have (or shortly expect to receive) a PhD in Mathematics,
Computer Science or a closely related field. They are expected to have a strong background in

structural proof theory and
 nonclassical logics
and, preferably,
knowledge of universal algebra or complexity theory .
Ability to work independently but also with academic colleagues
and PhD students, flexibility and teamwork,
are all important qualifications for this position.
Application Procedure
The candidate should send his expression of interest, contact information,
and names and contact information of two senior academics available for reference by the
deadline of Thursday December 1st 2011, per email to the address "postdoc2011@logic.at".
The following documents should be attached to the email in pdf:

A research statement of at most four pages outlining research interests and relevance for the project.
 Curriculum vitae
 One letter of reference
 List of publications, with pointers to openly available online versions of
at most three of the most relevant publications
In the review process, particular emphasis is put on the quality of the candidate's previous research and international experience, and its relevance to the project's aims. Good command of English is a necessary prerequisite.
The candidate must have completed his/her PhD degree before the start of the contract period.
Research Environment
The position offers an opportunity to work in an exciting research environment.
The Theory and Logic group is part of the Computational Intelligence group
at the Computer Science Faculty of the Vienna University of Technology. The latter
group consists of more than 70 people and includes renown researchers in
various areas of computational logic such as Matthias Baaz, Alexander Leitsch, Georg Gottlob (ViennaOxford),
Thomas Eiter and Helmut Veith. The group has organized and will organize
many events, for instance Federated Logic Conference
FLOC in 2014.
The project team will include two postdoc researchers (a second position will be soon advertised), 23 PhD students (to be
selected) and some Master students.
Bibliography
The following papers

From axioms to analytic rules in nonclassical logics.
IEEE Symposium on Logic in Computer Science
(LICS'08) , IEEE pp. 229240, 2008.
(A. Ciabattoni, N. Galatos and K. Terui)
PDF.

MacNeille Completions of FLalgebras.
Algebra Universalis .66, Number 4, pp. 405420, 2011.
(with N. Galatos and K. Terui ) PDF.

Density Elimination.
Theoretical Computer Science 403(23), pp. 328346.
2008.
(A. Ciabattoni and G. Metcalfe)
PDF.

Algebraic proof theory for substructural logics:
cutelimination and completions. Annals of Pure and Applied Logic. 2011.
(A. Ciabattoni, N. Galatos and K. Terui) PDF.
As well as
http://sitemason.vanderbilt.edu/files/i9gSiY/IMinter08.pdf
http://dl.acm.org/citation.cfm?id=1995280
are among the foundational basis of the project.