59 citations · 185 across the 53 of their papers we have counts for
4 papers · 2 filters
Guarded and Unguarded Iteration for Generalized Processes
Sergey Goncharov, Lutz Schröder, Christoph Rauch +1
Models of iterated computation, such as (completely) iterative monads, often depend on a notion of guardedness, which guarantees unique solvability of recursive equations and requi…
Permutation Games for the Weakly Aconjunctive -Calculus
Daniel Hausmann, Lutz Schröder, Hans-Peter Deifel
We introduce a natural notion of limit-deterministic parity automata and present a method that uses such automata to construct satisfiability games for the weakly aconjunctive frag…
A Characterization Theorem for a Modal Description Logic
Paul Wild, Lutz Schröder
Modal description logics feature modalities that capture dependence of knowledge on parameters such as time, place, or the information state of agents. E.g., the logic S5-ALC combi…
Model Theory and Proof Theory of Coalgebraic Predicate Logic
Tadeusz Litak, Dirk Pattinson, Katsuhiko Sano +1
We propose a generalization of first-order logic originating in a neglected work by C.C. Chang: a natural and generic correspondence language for any types of structures which can…