LINGUIST List 26.950

Mon Feb 16 2015

Calls: Computational Ling, Philosophy of Language, Semantics/France

Editor for this issue: Anna White <awhitelinguistlist.org>


Date: 13-Feb-2015
From: Stergios Chatzikyriakidis <kafouroutsoshotmail.com>
Subject: Hilbert’s Epsilon and Tau in Logic, Informatics and Linguistics
E-mail this message to a friend

Full Title: Hilbert’s Epsilon and Tau in Logic, Informatics and Linguistics
Short Title: Epsilon2015

Date: 10-Jun-2015 - 12-Jun-2015
Location: Montpellier, France
Contact Person: Fabio Pasquali
Meeting Email: < click here to access email >
Web Site: https://sites.google.com/site/epsilon2015workshop/

Linguistic Field(s): Computational Linguistics; Philosophy of Language; Semantics

Call Deadline: 01-Apr-2015

Meeting Description:

This workshop aims at promoting work on Hilbert’s epsilon calculus in a number of relevant fields ranging from Philosophy and Mathematics to Linguistics and Informatics.

The Epsilon and Tau operators were introduced by David Hilbert, inspired by Russell's Iota operator for definite descriptions, as binding operators that form terms from formulae. One of their main features is that substitution with Epsilon and Tau terms expresses quantification. This leads to a calculus which is a strict and conservative extension of First Order Predicate Logic. The calculus was developed for studying first order logic in view of the program of providing a rigorous foundation of mathematics via syntactic consistency proofs. The first relevant outcomes that certainly deserve a mention are the two ''Epsilon Theorems'' (similar to quantifiers elimination), the first correct proof of Herbrand’s theorem or the use of the Epsilon operator in Bourbaki’s Éléments de Mathématique. Nowadays the interest in the Epsilon substitution method has spread in a variety of fields: Mathematics, Logic, Philosophy, History of Mathematics, Linguistic, Type Theory, Computer science, Category Theory and others.

Invited Speakers:

Claus-Peter Wirth (University of Saarland): The descriptive operators iota, tau and epsilon - on their origin, partial and complete specification, model-theoretic semantics, practical applicability
Vito Michele Abrusci (University of Roma Tre): Hilbert's tau and epsilon in proof theory.
Hartley Slater (University of Western Australia): Linguistic and philosophical ramifications of the epsilon calculus

Call for Papers:

Hilbert’s Epsilon and Tau in Logic, Informatics and Linguistics
Dates: June 10-12, 2015
Location: Montpellier, France
Workshop Webpage: https://sites.google.com/site/epsilon2015workshop/
Contact email: Epsilon2015easychair.org
Submission deadline: April 1, 2015
Submission webpage: https://easychair.org/conferences/?conf=epsilon2015

Workshop Information:

This workshop aims at promoting work on Hilbert’s epsilon calculus in a number of relevant fields ranging from Philosophy and Mathematics to Linguistics and Informatics. The Epsilon and Tau operators were introduced by David Hilbert, inspired by Russell's Iota operator for definite descriptions, as binding operators that form terms from formulae. One of their main features is that substitution with Epsilon and Tau terms expresses quantification. This leads to a calculus which is a strict and conservative extension of First Order Predicate Logic. The calculus was developed for studying first order logic in view of the program of providing a rigorous foundation of mathematics via syntactic consistency proofs. The first relevant outcomes that certainly deserve a mention are the two ''Epsilon Theorems'' (similar to quantifiers elimination), the first correct proof of Herbrand’s theorem or the use of the Epsilon operator in Bourbaki’s Éléments de Mathématique. Nowadays the interest in the Epsilon substitution method has spread in a variety of fields: Mathematics, Logic, Philosophy, History of Mathematics, Linguistic, Type Theory, Computer science, Category Theory and others.

An indicative list of themes that are of particular interest to the conference are (non-exhaustive):

- History of Logic
- Philosophy
- Proof theory
- Model theory
- Category theory
- Type theory
- Quantification in Natural language
- Noun Phrases
- Proof Assistants (e.g. Coq, Isabelle, ... )
- Other subnectors (e.g. Russell's iota, μ-operator, ... )

Submission:

The workshop welcomes submissions of up to 4 (but not less than 2) pages. Usual spacing, font and margin should be used (single-spaced, 11pt or larger, and 1 inch margin on A4 or letter size paper).
Abstracts should be submitted by April 1, 2015 as pdf files through the EasyChair conference system (https://easychair.org/conferences/?conf=epsilon2015).

Reviewing:

Abstracts will be reviewed by members of the program committee, and, where appropriate, outside reviewers. The organizers will be responsible for making decisions partly in consultation with the program committee. Notifications will be made by May 1, 2015.

Post-Proceedings:

Selected papers from the workshop will appear as a special volume in Journal of Logics and their Applications

Important Dates:

April 1, 2015: Submission deadline
May 1, 2015: Notification of acceptance
June 10-12, 2015: Workshop

Organizers / Workshop Co-Chairs:

Stergios Chatzikyriakidis, LIRMM-CNRS, University of Montpellier
Fabio Pasquali, University of Marseille
Christian Retoré, University of Montpellier & LIRMM-CNRS
Host: I2M-CNRS and University of Montpellier



Page Updated: 16-Feb-2015