zbMath0968.03002MaRDI QIDQ5926539
André Arnold, Damian Niwinski
Publication date: 18 March 2001
Published in: Studies in Logic and the Foundations of Mathematics (Search for Journal in Brave)
An intensional fixed point theory over first order arithmetic,
μ-Bicomplete Categories and Parity Games,
On the universal and existential fragments of the \(\mu\)-calculus,
Complete axiomatization and decidability of alternating-time temporal logic,
Generalising automaticity to modal properties of finite structures,
A focus system for the alternation-free \(\mu \)-calculus,
$\aleph_1$ and the modal $\mu$-calculus,
ON MODAL μ-CALCULUS OVER FINITE GRAPHS WITH SMALL COMPONENTS OR SMALL TREE WIDTH,
Controller/Orchestrator Synthesis via Filtration,
Equivalence of probabilistic \(\mu\)-calculus and p-automata,
Unnamed Item,
On the \(\mu \)-calculus over transitive and finite transitive frames,
Unification and combination of a class of traversal strategies made with pattern matching and fixed-points,
Modal specifications for the control theory of discrete event systems,
Equational Properties of Fixed Point Operations in Cartesian Categories: An Overview,
Nearest Fixed Points and Concurrent Priority Games,
A fixed point theory over stratified truth,
On the equational definition of the least prefixed point.,
On temporal logic versus Datalog,
A gap property of deterministic tree languages.,
Computing Game Values for Crash Games,
Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA,
The variable hierarchy for the games \(\mu \)-calculus,
Completeness for flat modal fixpoint logics,
Unnamed Item,
Equational properties of fixed-point operations in cartesian categories: An overview,
Regular languages of nested words: fixed points, automata, and synchronization,
Completions of \(\mu \)-algebras,
Refinement modal logic,
The \(\mu\)-calculus alternation hierarchy collapses over structures with restricted connectivity,
Completeness for \(\mu\)-calculi: a coalgebraic approach,
Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 5--11, 2017,
Inf-datalog, Modal Logic and Complexities,
Compositional verification of sequential programs with procedures,
Canonical completeness of infinitary \(\mu \),
Temporal Logic with Recursion.,
Completeness for the modal \(\mu\)-calculus: separating the combinatorics from the dynamics,
Solving Łukasiewicz \(\mu\)-terms,
Computable fixpoints in well-structured symbolic model checking,
Partially commutative inverse monoids.,
Model Checking Games,
Deciding low levels of tree-automata hierarchy,
A saturation method for the modal \(\mu \)-calculus over pushdown systems,
On the separation question for tree languages,
A linear translation from CTL\(^*\) to the first-order modal \(\mu \)-calculus,
On equal \(\mu \)-terms,
Ambiguous classes in \(\mu\)-calculi hierarchies,
A parametric analysis of the state-explosion problem in model checking,
Elementary canonical formulae: extending Sahlqvist's theorem,
Beliefs supported by binary arguments,
Modal Fixed-Point Logic and Changing Models,
Categorical Büchi and parity conditions via alternating fixed points of functors,
Determinizing monitors for HML with recursion,
Undirected Graphs of Entanglement 2,
$$\mu $$ μ -Levels of Interpolation,
Temporal logic with recursion,
A Weighted μ-Calculus on Words,
Unnamed Item,
Craig Interpolation for Linear Temporal Languages,
From Parity Games to Circular Proofs,
Prefix and Projection onto State in Duration Calculus,
A decidable class of problems for control under partial observation,
A Tentative Approach for the Wadge-Wagner Hierarchy of Regular Tree Languages of Index [0, 2],
On the Strength of the Uniform Fixed Point Principle in Intuitionistic Explicit Mathematics