LC2019
Invited talks
Slides
Abstracts
Participants
Photos
Contact
Schedule with Slides
Plenary Talks
18:00–19:00
Leitgeb
Ramsification and Semantic Indeterminacy
9:00 Opening
12:20 Conference Photo
Coffee Break
(
Monday slides
)
(
Tuesday slides
)
(
Wednesday slides
)
(
Thursday slides
)
(
Friday slides
)
11:30–12:20
de Risi
Drawing Lines through Rivers and Cities. The Meaning of Postulates from Euclid to Hilbert
11:30–12:20
Krajíček
Model theory and proof complexity
9:00–9:50
Chatzidakis
Notions of difference closures of difference fields
11:30–12:20
Sagi
Logic and natural language: commitments and constraints
10:30–11:20
Raghavan
Higher cardinal invariants
10:30–11:20
Raghavan
Higher cardinal invariants
9:15–10:05
Scanlon
Over six decades of the model theory of valued fields
9:00–9:50
Abramsky
Relating Structure and Power: a junction between categorical semantics, model theory and descriptive complexity
10:30–11:20
Rathjen
Well-ordering principles in proof theory and reverse mathematics
10:30–11:20
Rathjen
Well-ordering principles in proof theory and reverse mathematics
9:00–9:50
Kohlenbach
Local proof-theoretic foundations, proof-theoretic tameness and proof mining
11:30–12:20
Harrison-Trainor
Describing countable structures
9:00–9:50
Guzman
The ultrafilter and almostdisjointness numbers
10:30–11:20
Ziegler
Logic of Computing with Continuous Data: Foundations of Numerical Software Engineering
11:30–12:20
Verbrugge
Zero-one laws for provability logic and some of its siblings
Special Sessions & Contributed Talks
Monday
B slides
C slides
D slides
E slides
F slides
Set Theory
Model Theory
Reflection Principles and Modal Logic
Proof Theory and Proof Complexity
Computability
Foundations of Geometry
General
Coffee Break
Negri
15:20–16:00
Syntax for semantics
Thapen
14:30–15:10
Induction, search problems and approximate counting
Beyersdorff
16:30–17:10
Proof complexity of quantified Boolean formulas
Bienvenu
14:30–15:10
Some questions of uniformity in algorithmic randomness
Harizanov
15:20–16:00
Approximately computable equivalence structures
Parente
17:20–18:00
Model-theoretic properties of ultrafilters and universality of forcing extensions
Macintyre
16:30–17:10
Model theory of adeles. Arithmetic equivalence
Sarma
17:40–18:00
Belief revision based on abductive reasoning
Soskova
16:30–16:50
Effective coding and decoding structures
Wcisło
16:50–17:10
Topological models of arithmetic
Harutyunyan
14:50–15:10
The Hajja-Martini inequality in a weak absolute geometry
Hodes
15:40–16:00
Ramified-types for states of affairs
Hubička
14:30–14:50
On Hrushovski properties of Hrushovski constructions
Baldwin
18:10–18:30
On strongly minimal Steiner systems: Zilber's conjecture, universal algebra, and combinatorics
Howe
15:40–16:00
Ramsey degrees of structures with equivalence relations
Vlasáková
16:50–17:10
Frege's attitude towards sets
Konečný
14:50–15:10
Simplicity of automorphism groups of generalised metric spaces
Łełyk
16:30–16:50
Nonequivalent axiomatizations of $\mathbf{PA}$ and the Tarski Boundary
Bazhenov
17:40–18:00
Computable reducibility, and isomorphisms of distributive lattices
Schoem
18:10–18:30
Destruction of ideal saturation
Shafer
16:50–17:10
Cohesive powers of $\omega$
Lubarsky
18:10–18:30
Feedback hyperjump
Akiyoshi
14:50–15:10
On Gaisi Takeuti's philosophy of mathematics
Mirek
14:30–14:50
Euclidean Geometry
Vatev
17:20–17:40
Computable embeddings for pairs of linear orderings
Ivanova
15:20–15:40
First-order theory of lines in Euclidean plane
Arai
17:20–17:40
Some results in proof theory
Madeira
14:30–14:50
Towards Invariant bisimulations for parametric multi-valued dynamic logics
Weiermann
17:40–18:00
A unifying approach to Goodstein principles
Bjørdal
17:20–17:40
Capture and Array – Replacement, Specification and Choice
Ansari
17:20–17:40
Constraints on selection function: A critique of Lewis-Stalnakers semantics for counterfactuals
Jureczko
17:40–18:00
New results on partitioner-representable algebras
Połacik
15:20–15:40
Archetypal Rules: Beyond Classical Logic
Tinchev
15:40–16:00
Computability of contact logics with measure
Aranda
15:20–15:40
MB-homogeneous graphs
Sanders
18:10–18:30
Umpteen parallel hierarchies and the Gödel hierarchy
Tarafder
16:30–16:50
Foundations of mathematics in a model of paraconsistent set theory
Garbayo
18:10–18:30
Dependence logic & medical guidelines disagreement: an informational (in)dependence analysis
Tuesday
B slides
C slides
D slides
E slides
F slides
Set Theory
Model Theory
Reflection Principles and Modal Logic
Proof Theory and Proof Complexity
Computability
Foundations of Geometry
General
Coffee Break
Zucker
16:30–17:10
Bernoulli disjointness
Hayut
17:20–18:00
Stationary Reflection at the successor of a singular cardinal
Dittmann
15:20–16:00
Models of the common theory of algebraic extensions of the rational numbers
Berkman
14:30–15:10
Sharp actions of groups in the finite Morley rank context
Mumma
14:30–15:10
Diagrams and parallelism
Beeson
15:20–16:00
On the notion of equal figures in Euclid
Pakhomov
16:30–17:10
A weak set theory that proves its own consistency
Visser
17:20–18:00
Löb's logic and the Lewis arrow
Soldà
14:50–15:10
Reverse Mathematics of some principles related to partial orders
Tedder
17:20–17:40
How much propositional logic suffices for Rosser's undecidability theorem?
Zainetdinov
16:30–16:50
Limitwise monotonic reducibility of sets and $\Sigma$-definability of abelian groups
Bradley-Williams
17:40–18:00
Canonical invariants for t-stratifications
Gordon
15:20–15:40
On extension of Haar measure in $\sigma$-compact groups
Herrera
14:50–15:10
Justifications and the Lewis argument on ECQ: a relevant note
Vlasov
16:50–17:10
On enumerations of families of sets of computableelements of metric spaces
Appleby
15:20–15:40
Resolving Two Paradoxes About Knowledge States in the Foundations of Intuitionistic Analysis
Méndez
14:30–14:50
Falsity constants for two independent families of quasi-Boolean logics
Běhounek
18:10–18:30
Non-monotonic abstract multiset consequence relations
Mauro
15:20–15:40
Quotient presentations of structures
Pereira
16:50–17:10
New ecumenical systems
Zubkov
15:40–16:00
On bi-embeddable categoricity of linear orders
Levine
18:10–18:30
Singular Cardinals of Uncountable Cofinality
Mishra
15:40–16:00
An inconsistency tolerant paraconsistent deontic logic of moral conflicts
Lutz
17:20–17:40
Descending sequences of hyperdegrees and the second incompleteness theorem
Sudoplatov
16:30–16:50
On compositions of structures and compositions of theories
Pavlyuk
16:50–17:10
On ranks for families of theories of finite abelian groups
Aleksandrova
14:30–14:50
On $\Sigma^0_n-$classifications
Jakl
17:20–17:40
On connections between logic on words and limits of graphs
Frittaion
18:10–18:30
The uniform reflection principle in second order arithmetic
Baldi
17:40–18:00
On classical and fuzzy two-layered modal logics for uncertainty: translations and proof-theory
Petik
14:30–14:50
Reading Feyerabend: from epistemic anarchism to anarchism in foundations of formal systems
Fiske
17:40–18:00
Quantum Random Self-Modifiable Computation
Nicolás-Francisco
16:30–16:50
Negation can be just what it has to
Niki
14:50–15:10
On Scott's semantics for many-valued logic
Gawek
15:40–16:00
Translation of Sequent Calculus into Natural Deduction for Sentential Calculus with Identity
van Gool
18:10–18:30
Monadic second order logic as a model companion
Alvir
18:10–18:30
Scott complexity and finitely $\alpha$-generated structures
Thursday
B slides
C slides
D slides
E slides
F slides
Set Theory
Model Theory
Reflection Principles and Modal Logic
Proof Theory and Proof Complexity
Computability
Foundations of Geometry
General
Coffee Break
Mildenberger
17:20–18:00
Generalised Miller forcing may collapse cardinals
Hirschfeldt
17:20–18:00
Computability theory, reverse mathematics, and Hindman's Theorem
Schweber
16:30–17:10
More effective cardinal characteristics
Paolini
15:20–16:00
First-order model theory of free projective planes
Boutry
14:30–15:10
Towards an independent version of Tarski's system of geometry
Jeřábek
14:30–15:10
Arithmetical and propositional reflection principles
Enayat
15:20–16:00
Some recent news about truth theories
Sipos
15:20–15:40
Bounds on strong unicity for Chebyshev approximation with bounded coefficients
Khamisyan
14:30–14:50
On the proof complexity in two universal proof system for all versions of many-valued logics
Shahnazaryan
14:30–14:50
Invertible binary algebras principally isotopic to a group
Petrosyan
14:50–15:10
Monotonous and strong monotonous properties of some propositional proof systems for Classical and Non Classical Logics
van der Giessen
16:50–17:10
Intuitionistic provability logic
Lindberg
15:40–16:00
Constructive semantics and the Joyal-Tierney representation theorem
Joosten
16:30–16:50
Hyperarithmetical Turing progressions
Tanús-Pimentel
17:20–17:40
Content-sharing in relevant mathematics
Korkmaz
16:30–16:50
Belief as a quantum bit
Arazim
16:50–17:10
Logical systems as pedagogical and perhaps existential games
Jalali
14:50–15:10
On the logical implications of proof forms
Mukhopadhyay
15:40–16:00
Cut elimination and Restall's defining rules
Mennuni
14:50–15:10
Product of invariant types modulo domination-equivalence
Kuroda
15:20–15:40
On Takeuti-Yasumoto forcing
Yun
17:20–17:40
On strong recognizability of the intuitionistic logic
Cheng
14:30–14:50
The limit of incompleteness for Weak Arithmetics
Mueller-Theys
17:40–18:00
Multi-valued interpretations
Van Abel
15:20–15:40
The Feferman-Vaught Theorem and products of finite fields
Olsson
16:30–16:50
Partial conservativity of $\widehat{\mathrm{ID}}^i_1$ over Heyting arithmetic via realizability.
Kurahashi
16:50–17:10
Derivability conditions and the second incompleteness theorem
Glenszczyk
17:20–17:40
Intuitionistc control logic: an overview
Shapirovsky
17:40–18:00
Satisfiability problems on sums of Kripke frames
Maxa
15:40–16:00
Feasible incompleteness
Bottazzi
17:40–18:00
An existence result for a class of partial differential equations
Friday
B slides
C slides
D slides
E slides
F slides
Set Theory
Model Theory
Reflection Principles and Modal Logic
Proof Theory and Proof Complexity
Computability
Foundations of Geometry
General
Coffee Break
Pinto
14:30–15:10
Proof mining with the bounded functional interpretation
Afshari
15:20–16:00
An infinitary treatment of fixed point modal logic
Powell
16:30–17:10
A new application of proof mining in the fixed point theory of uniformly convex Banach spaces
Iwanow
14:30–14:50
Pseudocompact unitary representations of finitely generated groups
Stukachev
14:30–14:50
Interval semantics for natural languages and effective interpretability over the reals
Indrzejczak
17:20–17:40
Admissibility of Cut for Sequent Calculus related to $n$-labelled Tableaux
Kuzeljević
14:30–14:50
Antichains of copies of ultrahomogeneous structures
Espindola
15:20–15:40
Preservation theorems for strong first-order logics
Fernández-Duque
17:20–17:40
A Complete Intuitionistic Temporal Logic for Topological Dynamics
Pierce
16:30–16:50
Apollonian proof
Sziráki
14:50–15:10
Perfect sets and games on generalized Baire spaces
Ramirez-Camara
14:30–14:50
The Limit of the Strict-Tolerant Hierarchy is Essentially Classical and Even If It’s Just LP, That’s Probably Okay.
Parlamento
18:10–18:30
The subterm property for some equality sequent calculi
Kikyo
14:50–15:10
On automorphism groups of Hrushovski's pseudoplanes in rational cases
Sedlár
16:50–17:10
Fixpoints in generalized Lambek calculus
Tussupov
15:40–16:00
On minimal elements in the $\Delta$-reducibility on families of predicates
Šupina
15:20–15:40
Cardinal invariants and ideal convergence
Conti
16:50–17:10
One or more Logicisms
Horvat
15:20–15:40
Rearranging absolutely convergent well-ordered series in Banach spaces
Fila
17:20–17:40
Limits of diagrammatic reasoning
Korneeva
15:20–15:40
Prefix decidable infinitewords for natural subsets of the set of context-free languages
Błaszczyk
16:50–17:10
Axioms for Euclid's Elements book V, their consequences and some independence results
Vasey
16:50–17:10
Forking and categoricity in non-elementary model theory
Bozdag
14:50–15:10
A hyperintensional and paraconsistent approach to belief dynamics
Drobyshevich
17:40–18:00
Towards a classification of algebraizable FDE-based modal logics
Ospichev
14:50–15:10
About Rogers semilattices of finite families in Ershov hierarchy
Litak
16:30–16:50
Algebras for preservativity
Kucera
17:20–17:40
On universal modules with pure embeddings
Čačić
15:40–16:00
Complexity of some fragments of description logics
Lee
18:10–18:30
Elementary theories of PAC structures via Galois groups
Lieberman
16:30–16:50
Weak factorization systems and stable independence
Tabatabai
18:10–18:30
The BHK interpretation: looking through Gödel’s classical lens
Ferreira
17:40–18:00
An embedding of $\mathbf{IPC}$ into $\mathbf{F}_{\mathbf{at}}$ not relying on instantiation overflow
Sitek
17:40–18:00
Mereological model of arithmetic of natural and real numbers
Zambrano
17:40–18:00
Tameness in classes of generalized metric structures: quantale-spaces, fuzzy sets, and sheaves
Campercholi
15:40–16:00
Dominions in filtral quasivarieties