Colloquium Logicum 2012

• Jean Paul Van Bendeghem Mathematics without proofs
• Helena Durnová Search for the language for algorithms
• Oliver Friedmann Exponential Lower Bounds for Solving Infinitary Payoff Games and Linear Programs
• Peter Holy L-like models with large cardinals and a quasi lower bound on the consistency strenth of PFA
• Alexander Kreuzer Non-principal ultrafilters, program extraction and higher order reverse mathematics
• Liesbeth De Mol "Et tu, Brute!" The correspondence between Alonzo Church and Emil Post
• Salma Kuhlmann Fields of generalized power series
• Vasco Brattka. On the computational content of the Baire Category Theorem.
• Elena Ficara. What Kind of Logic is Hegel's Logic?
• Merlin Carl, Paola D'Aquino and Salma Kuhlmann. Real Closed Exponential Fields and Models of Peano Arithmetic.
• Naveen Sundar Govindarajulu and Selmer Bringsjord. Proving Theorems using Uncomputable Games: Examples from Physics.
• Katharina Dupont. Definable Valuations and Dependent Fields.
• Ralf Krömer. ``Psychological priority'' vs. effects of training. The foundational debate on Category theory revisited.
• Joel Hamkins and Zhenhao Li. Computable functionals on the countable ordinals.
• Giuseppe Primiero. Matching, Accessibility, Use: on limitations of computing in a distributed setting.
• Arno Pauly and Martin Ziegler. Relative Computability and Uniform Continuity of Relations.
• Maja Schepelmann. Kant's principle of identity.
• Denis I. Saveliev. On Zariski topologies of Abelian groups with operations.
• Elena Tatievskaya. Frege's Context Principle and Analysis.
• Thomas Müller Logic in philosophy: The case of determinism
• Philipp Lücke How tall is the automorphism tower of a centerless group?
• Arno Pauly Comparing the computational content of mathematical theorems
• Andy Lewis The typical Turing degree
• Rainer Glaschick Materialization of Universal Turing Machines
• Mirna Džamonja Forcing Axioms
• Takanori Hida. A Computational Interpretation of the Axiom of Determinacy in Arithmetic.
• Anna-Sophie Heinemann. Mechanization of reasoning and algorithmic thinking: trends in 19th Century Algebra of Logic.
• Anthony Gasperin. Admissible Sets Above Automatic Structures.
• Edgar Daylight. Towards an Historical Notion of "Turing --- the Father of Computer Science".
• Benno van den Berg, Eyvind Briseid and Pavol Safarik. A functional interpretation for nonstandard arithmetic.
• Javier Legris. On C. S. Peirce's Definitive Idea of Mathematical Logic.
• Justus Diller. Axiomatizations of functional interpretations.
• 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.
• Marcus Kracht. Asymmetric Consequence.
• Michael Rathjen Comparing theories