## 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:

_{0}

^{*}

_{2}Turing Degrees: structure, definability and Cooper's question [.pdf]

## Schedule:

#### Thursday, September 15^{th}

- Unitl 15
^{00}Guests Arrival - 15
^{00}– 16^{00}Dinner - 16
^{00}– 17^{45}Marcin Mostowski: Concrete mathematics - 18
^{00}– 19^{45}Marek Czarnecki: Low Basis Theorem and Model Theory without Actual Infinity 1 - 20
^{00}– 21^{00}Supper

#### Friday, September 16^{th}

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

#### Saturday, September 17^{th}

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

#### Sunday, September 18^{th}

- 9
^{00}– 10^{00}Breakfast - 10
^{00}– 11^{45}Dariusz Kalociński: Learning by coordination - 12
^{00}– 13^{45}Jakub Szymanik: Logical complexity and cognitive difficulty in reasoning - 14
^{00}– 15^{45}Dinner - 16
^{00}– 17^{45}Free Time - 18
^{00}– 19^{00}Supper - 19
^{00}– 20^{45}Zofia Adamowicz: IΔ_{0}^{*}

#### Monday, September 19^{th}

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

#### Tuesday, September 20^{th}

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

#### Wednesday, September 21^{st}

- 9
^{00}– 10^{00}Breakfast - 10
^{00}– 11^{45}Filip Murlak: Boolean Circuits for Beginners 2 - 12
^{00}– 13^{45}Marat Arslanov: Turing degrees of n-c.e. sets 3 - 14
^{00}- 15^{00}Dinner - 15
^{00}Workshop Closing