The concept of strong and weak virtual reality
The Cost of Parameterized Reachability in Mobile Ad Hoc Networks
The countable versus uncountable branching recurrences in computability logic
The degree structure of Weihrauch-reducibility
The Delay-Insensitivity, the Hazard-Freedom, the Semi-Modularity and the Technical Condition of Good Running of the Discrete Time Asynchronous Automata
The Derivational Complexity Induced by the Dependency Pair Method
The Distributed Ontology Language (DOL): Ontology Integration and Interoperability Applied to Mathematical Formalization
The duality of computation under focus
The Equivalence Problem for Deterministic MSO Tree Transducers is Decidable
The Existence of $ω$-Chains for Transitive Mixed Linear Relations and Its Applications
The Fibers and Range of Reduction Graphs in Ciliates
The First-Order Theory of Ground Tree Rewrite Graphs
The First-Order Theory of Sets with Cardinality Constraints is Decidable
The Formal System lambda-delta
The Foundation of a Generic Theorem Prover
The FO^2 alternation hierarchy is decidable
The Full Abstraction Problem for Higher Order Functional-Logic Programs
The General Vector Addition System Reachability Problem by Presburger Inductive Invariants
The Geometry of Interaction of Differential Interaction Nets
The Geometry of Linear Higher-Order Recursion