Informal Presentations

  • Seyyed Alireza Ahmadi. Recurrent Subgroups of Topological Groups
  • Satoru Kuroda. On Boolean valued models of Bounded Arithmetic
  • Gualtiero Piccinini and Neal Anderson. Ontic Pancomputationalism (Informal Presentation)
  • Stepan Holub. Formalization of Combinatorics on Words in Isabelle/HOL
  • Yong Cheng. Two questions about incompleteness
  • Florian Steinberg, Arno Pauly and Christine Gassner. Comparing integrability and measurability in different models of computation
  • Dongseong Seon. Computability of Haar Averages
  • Marta Fiori Carones. The reverse mathematics of a theorem about subgraphs with nice properties
  • Florian Lonsing. QRAT+: Generalizing QRAT by a More Powerful QBF Redundancy Property
  • Nikolay Bazhenov, Manat Mustafa and Mars Yamaleev. On dark Σ02-equivalence relations
  • Valentina Harizanov. Effective powers of countable structures
  • Attila Bagossy and Peter Battyanyi. An encoding of the lambda-calculus into the calculus of String MultiSet Rewriting
  • Chansu Park, Sewon Park and Martin Ziegler. On Tensor Calculus in Exact Real Computation: A Case Study from Recursive Analysis to Abstract Data Types
  • Erzsébet Csuhaj-Varjú, Kristóf Kántor and György Vaszil. Languages of P Colony Automata
  • Éric Goubault, Jérémy Ledent and Sergio Rajsbaum. A dynamic epistemic logic semantics for fault-tolerant distributed task computability
  • Matthew de Brecht. Extending descriptive set theory to non-metrizable spaces and represented spaces
  • Kamellia Reshadi. Unary Patterns of Size Four with Morphic Permutations
  • Luca San Mauro, Ekaterina Fokina and Dino Rossegger. Measuring the complexity of reductions between equivalence relations
  • Elvira Mayordomo. A point-to-set principle for separable metric spaces
  • Michał Tomasz Godziszewski. Π01-computable quotient presentation of a nonstandard model of arithmetic
  • Joel Day, Vijay Ganesh, Paul He, Florin Manea and Dirk Nowotka. The Satisfiability of Word Equations: Decidable and Undecidable Theories