Contest: Scope of Logic Theorems

In view of the speedy and huge expansion of the universe of logics, the question of the scope of validity and the domain of application of fundamental logic theorems is more than ever crucial. What is true for classical logic and theories based on it, does not necessarily hold for non-classical logics.

But we may wonder if there is a logic deserving the name in which a theorem such as the incompleteness theorem does not hold. On the other hand a theorem such as cut-elimination does not hold for many interesting logical systems. Cut-elimination expresses the intrinsic analycity of a logic, the fact that a proof of a theorem depends only of its constituents, a not always welcome feature. Anyway, it is interesting to find necessary and/or sufficient conditions for cut-elimination to hold. And also for any important theorem of logic.

Any paper dealing with the scope of validity and domain of application of logic theorems is welcome, in particular those dealing with the following theorems:

  • Löwenheim-Skolem (1915-1920)
  • completeness (Post 1921 - Gödel 1930)
  • incompleteness (Gödel 1931)
  • cut-elimination (Gentzen 1934)
  • undefinability (Tarski 1936)
  • undecidability (Church-Turing, 1936)
  • Lindenbaum's extension lemma (1937)
  • compactness (Malcev 1938)
  • incompleteness for modal logic (Dugundji 1940)
  • Ehrenfeucht-Fraïssé (1950-1961)
  • Beth's definability theorem (1953)
  • Craig's interpolation theorem (1957)
  • completeness for modal logic (Kripke 1959)
  • independence of CH (Cohen 1963)

To take part to the contest submit a paper of at least 10 pages by February 28, 2013 to:

logic.theorem@logica-universalis.org

The best papers will be selected for presentation in a special session during the event and a jury will decide during the event who is the winner.

The members of the jury are Yuri Gurevich, Daniele Mundici and Hiroakira Ono.

The prize will be offered by Barbara Hellriegel, representative of

Previous Winners of the contest are

  • Carlos Caleiro and Ricardo Gonçalves
    UNILOG'2005 = How to define identity between logical structures
  • Till Mossakowski, Razvan Diaconescu and Andrzej Tarlecki
    UNILOG'2007= How to translate a logic into another one?
  • Vladimir Vasyukov
    UNILOG'2010 = How to combine logics?

 

 

 

 

 

 

Papers to be presented for the Contest

Nathenael Leedom Ackerman, Dpt of Mathematics, University of Harvard, USA, On Transfering Model Theoretic Theorems of L∞,ω in the Category of Setsto a Fixade Grotheendieck Topos

Bhupinder Singh Anand, Independant Scholar, Mumbai, India, Aristotle's particularisation - The Achilles' heel of Hilbertian and Brouwerian perspectives of classical logic

André Bazzoni, IHPST, University Paris 1 - Panthéon Sorbonne, France, Is Hintikka’s Independence-Friendly Logic a revolutionary non-classical first-order language?

Petr Cintula and Carles Noguera Academy of Sciences of the Czech Republic, On the scope of the completeness theorem for first-order predicate logic

Roy Cook, University of Minnesota, USA, There is no Paradox of Logical Validity

Marcelo Coniglio and Newton Peron, State University of Campinas, Brazil, Actualizing Dugundji's theorem

Razvan Diaconescu, Academy of Science, Romenia, Till Mossakowski, University of Bremen. Germany and Andrzej Tarlecki, University of Warsaw. Poland, The Institution-Theoretic Scope of Logic Theorems

Luis Estrada-González, University of Tartu, Estonia, Suszko'sReduction in a Topos

Daniel Gaina, Japan Advanced Institute of Science and Technology (JAIST), Forcing and the Omitting Type Theorem, institutionally

Giuseppe Greco, University of Amsterdam, The Netherlands, Saturated Logic, Its Syntax

Maria Manzano, University of Salamanca, Spain and Luis Urtubey, University of Córdoba, Argentina, Completeness, translation and logicality

Mykola S. Nikitchenko and Stepan S. Skylniak, Shevchenko National University of Kyiv, Ukraine, Completeness Theorems for Program-oriented Algebra-based Logics of Partial Quasiary Predicates

Tom Skura, University of Zielona Gora, Poland, Refutability and Post Completeness