University of Warsaw Institute of Philosophy

XVII Logic Workshop

„Computation – Arithmetics – Cognition ”

Chęciny, September 15 – 21, 2016

• Main pageMain page — general information
• ProgramWorkshop program — courses and schedules
• CommitteeProgram & Organizing committee; contacts
• RegistrationWorkshop rehistration; deadlines
• Accomodation

Subject:

• In this year's Logic Workshop we want to address in particular the issues computation theory and arithmetic. Attention is given also problems on the borderline between cognitive science and philosophy, such as learning semantics and formal epistemology.
• Concrete approach to the study of the foundations of mathematics (in opposition to the axiomatic approach), model-theoretic methods in potentially infinite domains of finite models, combinatorics, automata theory, discrete mathematics;
• Logical foundations of arithmetic, ie. arithmetical model theory, arithmetical proof theory, expressive strength of arithmetical theories (also with generalized quantifiers), weak arithmetics, subsystems of second order arithmetic and computational complexity.

Lecturers:

The list of lecturers of this year's Logic Workshop edition:

Zofia Adamowicz (IM PAN) – IΔ₀^*

Marat M. Arslanov (AML KSU) – Turing degrees of n-c.e. sets

Marek Czarnecki (IF UW) – Low Basis Theorem and Model Theory without Actual Infinity [.pdf]

Michał T. Godziszewski (IF UW, MIM UW, FUW) – The method of forcing and independence of the Continuum Hypothesis

Dariusz Kalociński (IF UW) – Learning by coordination

Marcin Mostowski (IF UW, IF UJ) – Concrete mathematics

Filip Murlak (MIM UW) – Boolean circuits for beginners

Damian Niwiński (MIM UW) – Fixed-point characterization of polynomial time

Luca San Mauro (DMG VUT) – Logical models for trial and error mathematics. Dialectical and quasi-dialectical systems [.pdf]

Theodore A. Slaman (DM UCB) – The Δ₂ Turing Degrees: structure, definability and Cooper's question [.pdf]

Jakub Szymanik (ILLC UvA) – Logical complexity and cognitive difficulty in reasoning [.pdf]

Konrad Zdanowski (WM-P UKSW) – Generalizations of Limit Lemma

Schedule:

Thursday, September 15^th

• Unitl 15⁰⁰ Guests Arrival
• 15⁰⁰ – 16⁰⁰ Dinner
• 16⁰⁰ – 17⁴⁵ Marcin Mostowski: Concrete mathematics
• 18⁰⁰ – 19⁴⁵ Marek Czarnecki: Low Basis Theorem and Model Theory without Actual Infinity 1
• 20⁰⁰ – 21⁰⁰ Supper

Friday, September 16^th

• 9⁰⁰ – 10⁰⁰ Breakfast
• 10⁰⁰ – 11⁴⁵ Luca San Mauro: Logical models for trial and error mathematics. Dialectical and quasi-dialectical systems 1
• 12⁰⁰ – 13⁴⁵ Luca San Mauro: Logical models for trial and error mathematics. Dialectical and quasi-dialectical systems 2
• 14⁰⁰ – 15⁴⁵ Dinner
• 16⁰⁰ – 17⁴⁵ Konrad Zdanowski: Generalizations of Limit Lemma 1
• 18⁰⁰ – 19⁰⁰ Supper
• 19⁰⁰ – 20⁴⁵ Konrad Zdanowski: Generalizations of Limit Lemma 2

Saturday, September 17^th

• 9⁰⁰ – 10⁰⁰ Breakfast
• 10⁰⁰ – 11⁴⁵ Konrad Zdanowski: Generalizations of Limit Lemma 3
• 12⁰⁰ – 13⁴⁵ Marek Czarnecki: Low Basis Theorem and Model Theory without Actual Infinity 2
• 14⁰⁰ – 15⁴⁵ Dinner
• 16⁰⁰ – 17⁴⁵ Free Time
• 18⁰⁰ – 19⁰⁰ Supper
• 19⁰⁰ – 20⁴⁵ Luca San Mauro: Logical models for trial and error mathematics. Dialectical and quasi-dialectical systems 3

Sunday, September 18^th

• 9⁰⁰ – 10⁰⁰ Breakfast
• 10⁰⁰ – 11⁴⁵ Dariusz Kalociński: Learning by coordination
• 12⁰⁰ – 13⁴⁵ Jakub Szymanik: Logical complexity and cognitive difficulty in reasoning
• 14⁰⁰ – 15⁴⁵ Dinner
• 16⁰⁰ – 17⁴⁵ Free Time
• 18⁰⁰ – 19⁰⁰ Supper
• 19⁰⁰ – 20⁴⁵ Zofia Adamowicz: IΔ₀^*

Monday, September 19^th

• 9⁰⁰ – 10⁰⁰ Breakfast
• 10⁰⁰ – 11⁴⁵ Michał Godziszewski: The method of forcing and independence of the Continuum Hypothesis 1
• 12⁰⁰ – 13⁴⁵ Theodore Slaman: Degrees below 0' 1
• 14⁰⁰ – 15⁴⁵ Dinner
• 16⁰⁰ – 17⁴⁵ Marat Arslanov: Turing degrees of n-c.e. sets 1
• 18⁰⁰ – 19⁰⁰ Supper
• 19⁰⁰ – 20⁴⁵ Michał Godziszewski: The method of forcing and independence of the Continuum Hypothesis 2

Tuesday, September 20^th

• 9⁰⁰ – 10⁰⁰ Breakfast
• 10⁰⁰ – 11⁴⁵ Theodore Slaman: Degrees below 0' 2
• 12⁰⁰ – 13⁴⁵ Damian Niwiński: Fixed-point characterization of polynomial time
• 14⁰⁰ – 15⁴⁵ Dinner
• 16⁰⁰ – 17⁴⁵ Marat Arslanov: Turing degrees of n-c.e. sets 2
• 18⁰⁰ – 19⁰⁰ Supper
• 19⁰⁰ – 20⁴⁵ Filip Murlak: Boolean circuits for beginners 1

Wednesday, September 21^st

• 9⁰⁰ – 10⁰⁰ Breakfast
• 10⁰⁰ – 11⁴⁵ Filip Murlak: Boolean Circuits for Beginners 2
• 12⁰⁰ – 13⁴⁵ Marat Arslanov: Turing degrees of n-c.e. sets 3
• 14⁰⁰ - 15⁰⁰ Dinner
• 15⁰⁰ Workshop Closing

University of Warsaw Institute of Philosophy