Complexity of Fractran and Productivity
Complexity of Hybrid Logics over Transitive Frames
Complexity of Model Checking for Modal Dependence Logic
Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus
Complexity of the Guarded Two-Variable Fragment with Counting Quantifiers
Complexity of the Two-Variable Fragment with (Binary-Coded) Counting Quantifiers
Complexity of two-variable Dependence Logic and IF-Logic
Complexity Results and Practical Algorithms for Logics in Knowledge Representation
Complexity Results for Modal Dependence Logic
Complexity Results on DPLL and Resolution
Composing Programs in a Rewriting Logic for Declarative Programming
Computability Closure: Ten Years Later
Computability Logic: a formal theory of interaction
Computable Closed Euclidean Subsets with and without Computable Points
Computation Tree Logic with Deadlock Detection
Computation with Advice
Computational interpretation of classical logic with explicit structural rules
Computational Models of Certain Hyperspaces of Quasi-metric Spaces
Computer certified efficient exact reals in Coq
Computer-Assisted Program Reasoning Based on a Relational Semantics of Programs