The current CiE policy is that all presentation must be allocated the same time. Therefore the Conference chairs and the Organizing Committee can only give 20 minutes for each presentation (and 5 minutes for possible questions).

- Akitoshi Kawamura and Kenshi Miyabe. Polynomial-time randomness and differentiability
- Alan Perotti, Guido Boella and Artur D’Avila Garcez. Combining Runtime Verification and Property Adaptation through Neural-Symbolic Integration
- Alberto Marcone. Reverse Mathematics of posets: decomposing initial intervals
- Alessandro Facchini and Paula Quinon. Two Roles of Logic in Computer Science
- Alexander Gavruskin and Bakhadyr Khoussainov. On decidable and computable models of theories
- Alexander Gavruskin, Sanjay Jain, Bakhadyr Khoussainov and Frank Stephan. Graphs realised by r.e. equivalence relations
- Alexander G. Melnikov and Andre Nies. The classification problem for compact computable metric spaces
- Alexander Kartzow and Philipp Schlicht. Structures without Scattered-Automatic Presentations
- Alexey Stukachev. On Processes and Structures
- Alexey Stukachev. On some properties of -reducibility
- Alla Sirokofskich. Decidability and the multiplicative structure of positive rationals together with the `greatest common divisor’
- Anahit Chubaryan and Armen Mnatsakanyan. On some new propositional proof systems
- Andrew Chester, Riccardo Dondi and Anthony Wirth. Resolving Rooted Triplet Inconsistency by Dissolving Multigraphs
- Andrew Marks. Uniformity and degree invariant constructions
- Andrey Sariev and Hristo Ganchev. Definability in the local theory of the -enumeration degrees
- Anna Bernasconi, Valentina Ciriani, Gabriella Trucco and Tiziano Villa. Compact Representation of Logic Functions using Boolean Relations
- Anthony Gasperin. Topology of Asymptotic Cones and Non-Deterministic Polynomial Time Computations
- Antoine Taveneaux, Laurent Bienvenu and Christopher Porter. Randomized algorithms to compute completions of Peano arithmetic.
- Arthur Milchior. Undecidability of satisfiability of expansion of with a Semilinear Non Regular Predicate over words.
- Benjamin Rin. On Set-Theoretic and Transfinite Analogues of Epistemic Arithmetic and Flagg Consistency
- Benjamin Seyfferth and Tim Fischbach. On -definable functions on ordinals
- Bernard Molyneux. Passive Computation and the Power of Inactivity: How to Get a Brain to Compute without Firing its Neurons
- Clayton Peterson. Formal Philosophy and Legal Reasoning: The validity of legal inferences
- Dan Hernest and Trifon Trifonov. Light modal Dialectica interpretation
- Daniela Genova. Language Forbidding-Enforcing Systems Defining DNA Codewords
- David Gamez. Are there Computational Correlates of Consciousness in the Brain?
- Edgar Daylight. Programming in the 1950s in 5 Pictures
- Ella Gale, Ben Costello and Andy Adamatzky. The Use of Memristors in Nature-Inspired Computation
- Elvira Mayordomo. Effective dimension in general metric spaces and applications
- Emanuele Frittaion. Reverse Mathematics of posets: counting initial intervals
- Eyvind Martol Briseid. Extracting computational content from proofs in nonstandard analysis
- Ferdinando Cicalese, Gennaro Cordasco, Luisa Gargano, Martin Milanic and Ugo Vaccaro. Latency-Bounded Target Set Selection in Social Networks
- Frank Coyle. Computation, A Process-Based Perspective
- Giovanni Pardini, Roberto Barbuti, Andrea Maggiolo-Schettini, Paolo Milazzo and Simone Tini. A Compositional Semantics of Reaction Systems with Restriction
- Giuseppe Primiero. A Modal Type System for Error Handling
- Guido Fiorino. How to reduce backtracking in propositional intuitionistic logic
- Helena Durnova. Fault-tolerance as the most important feature of SAPO and EPOS computers
- Imran Khaliq and Gulshad Imran. Constructing Strategies in a Subclass of Muller Games
- Ivan Soskov. A note on -jump inversion of degree spectra of structures
- Jason Rute. Schnorr randomness for noncomputable measures
- Jeroen Van der Meeren. Ordinal and Proof-theoretical Strength of Tree-like Structures with Friedman-style Gap Condition
- Joaquín Díaz Boils and José Pedro Úbeda Rives. A Kripke Model for Subrecursion.
- Johanna N.Y. Franklin, Asher M. Kach, Russell Miller and Reed Solomon. Local Computability for Ordinals
- John Case and Michael Ralston. Beyond Rogers’ Non-Constructively Computable Function
- Joseph Davidson and Greg Michaelson. Brute Force is not Ignorance
- Juliana Silva Bernardes, Gerson Zaverucha, Catherine Vaquero and Alessandra Carbone. Combining multiple evolutionary models and machine learning for protein domain identification
- Julien Cervelle. Constructing continuous systems from discrete cellular automata
- Katie Barr and Viv Kendon. Formal languages analysed by quantum walks
- Keita Yokoyama. On the strength of Ramsey’s theorem without -induction
- Klaus Ambos-Spies, Ulrike Brandt and Martin Ziegler. Real Benefit of Promises and Advice
- Kojiro Higuchi. Minimal Essential Undecidability of Theories of Concatenations
- Krishna S, Marian Gheorghe and Ciprian Dragomir. Some Classes of Generalised Communicating P Systems and Simple Kernel P Systems
- Laurent Bienvenu and Christopher Porter. Strong Difference Randomness
- Luca Bellotti. Turing machines and predictability
- Ludovic Patey, Laurent Bienvenu and Paul Shafer. Rainbow Ramsey theorem for pairs
- Makoto Fujiwara and Keita Yokoyama. A note on the strength of sequential version of statements
- Marat Nurizinov and Rustem Tyulyubergenev. On computable subgroups of the group of all unitriangular matrices over a ring
- Mark Burgin and Gordana Dodig Crnkovic. The Nature of Computation and The Development of Computational Models
- Merlin Carl. Towards a Church-Turing-Thesis for Infinitary Computations
- Miha Habič. Cardinal-Recognizing Infinite Time Turing Machines
- Mike Domaratzki and Ryan Zier-Vogel. RNA pseudoknot prediction through stochastic conjunctive grammars
- Mikhail Peretyatkin. The Tarski-Lindenbaum algebra of the class of all strongly constructivizable countable saturated models
- Mitko Yanchev. Part restrictions in Description Logics with union and counting
- Mustafa Demirci. An Extended Fundamental Duality of Partially Ordered Sets and Its Applications
- Naohi Eguchi. Characterising Complexity Classes by Inductive Definitions in Bounded Arithmetic
- Nicolas de Rugy-Altherre. Determinant versus Permanent: salvation via generalization?
- Paola Bonizzoni, Anna Paola Carrieri, Gianluca Della Vedova, Riccardo Dondi and Gabriella Trucco. Graph based reconstruction of the Persistent Perfect Phylogeny
- Paola Zizzi and Eliano Pessa. Quantum computation on the fuzzy sphere
- Paolo Bottoni and Anna Labella. Reaction systems with constrained environment
- Paulin Jacobé De Naurois. Vector Addition Systems With Split/Join Transitions: A Covering Theorem
- Pawel Gawrychowski, Florin Manea and Dirk Nowotka. Discovering Hidden Repetitions in Words
- Petrica Pop and Oliviu Matei. A Memetic Algorithm for Solving the Generalized Vehicle Routing Problem
- Riccardo Dondi and Nadia El-Mabrouk. Aligning and Labeling Genomes Under the Duplication-Loss Model
- Robert Lubarsky and Michael Rathjen. Realizability Models Separating Various Fan Theorems
- Roohola Ramzani. Through Divergent Norms: Satisfying a Realistic Model of Rationality
- Rudolf Freund. Control Mechanisms and the Number of Catalysts Needed for Computational Completeness in (Purely) Catalytic P Systems
- Sam Sanders. The double negation translation in Nonstandard Constructive Analysis
- Santiago Hernández Orozco, Francisco Hernández Quiroz and Hector Zenil. Sparse Distribution of Proving Speed-up in Random Systems of Propositional Calculus.
- Shibashis Guha, Krishna S, Chinmay Narayan and S. Arun-Kumar. A Unifying Approach to Decide Timed Relations for Timed Automata and their Game Characterization
- Shira Zucker. The -distance anticoloring Problem
- Slimane Bellaouar, Hadda Cherroun and Djelloul Ziadi. Efficient Computation of the Gap-Weighted Subsequence Kernel
- Stefania Costantini and Federico Gobbo. A History of Autonomous Agents: from Thinking Machines to Machines for Thinking
- Stefan Vatev. Another Jump Inversion Theorem for Structures
- Stephane Le Roux and Arno Pauly. Closed choice for finite and for convex sets
- Stephanie Dick. Following Mathematics into the Digital: A Historical Exploration of as Early Automated Theorem Proving Program
- Takayuki Kihara and Kenshi Miyabe. Lowness for uniform Kurtz randomness
- Tamás Mihálydeák and Zoltán Ernő Csajbók. A Species Distribution Framework Relying on Membrane Computing with Boundaries
- Thomas Dueholm Hansen and Rasmus Ibsen-Jensen. The complexity of interior point methods for solving discounted turn-based stochastic games
- Torben Braüner. Hybrid-Logical Proofs: With an Application to False-Belief Tasks
- Velislava Stoykova. Formal Representations of Pronouns Using Universal Networking Language
- Yen Hung Chen. The Bottleneck Selected-Internal Steiner Tree Problem: Hardness and Approximation
- Yiqi Deng and Peter J. Bentley. Dynamic Learning based on an Artificial Immune System using Systemic Computation
- Ziyuan Gao, Sanjay Jain and Frank Stephan. On conservative learning of recursively enumerable languages