On the public citation graph
A finite model theorem for the propositional ?-calculus
0 signed · 82 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-12896-4_370openalex-snapshot
A decision procedure for the propositional μ-calculus
inferredcites →https://doi.org/10.1007/3-540-13345-3_43openalex-snapshot
The propositional mu-calculus is elementary
inferredcites →https://doi.org/10.1007/bfb0012782openalex-snapshot
Results on the propositional μ-calculus
inferredcites →https://doi.org/10.1016/0022-0000(79)90046-1openalex-snapshot
Propositional dynamic logic of regular programs
inferredcites →https://doi.org/10.1017/s0305004100003844openalex-snapshot
On well-quasi-ordering finite trees
inferredcites →https://doi.org/10.1017/s0305004100039062openalex-snapshot
On well-quasi-ordering infinite trees
inferredcites →https://doi.org/10.1017/s030500410004281xopenalex-snapshot
On better-quasi-ordering transfinite sequences
inferredcites →https://doi.org/10.1017/s030500410005204xopenalex-snapshot
Well-quasi-orderings and sets of finite sequences
inferredcites →https://doi.org/10.1109/sfcs.1981.4openalex-snapshot
A decidable mu-calculus: Preliminary report
inferredcites →https://doi.org/10.1145/800076.802492openalex-snapshot
Propositional Dynamic Logic of looping and converse
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.1999.2836openalex-snapshot
Completeness of Kozen's Axiomatisation of the Propositional μ-Calculus
inferred← citeshttps://doi.org/10.1007/3-540-36577-x_5openalex-snapshot
On the Universal and Existential Fragments of the μ-Calculus
inferred← citeshttps://doi.org/10.1007/3-540-49116-3_48openalex-snapshot
A Modal Fixpoint Logic with Chop
inferred← citeshttps://doi.org/10.1007/3-540-49116-3_50openalex-snapshot
Eliminating Recursion in the μ-Calculus
inferred← citeshttps://doi.org/10.1007/3-540-60246-1_160openalex-snapshot
Automata for the modal μ-calculus and related results
inferred← citeshttps://doi.org/10.1007/978-3-030-17127-8_16openalex-snapshot
Optimal Satisfiability Checking for Arithmetic $$\mu $$-Calculi
inferred← citeshttps://doi.org/10.1007/978-3-031-22337-2_18openalex-snapshot
Satisfiability of Quantitative Probabilistic CTL: Rise to the Challenge
inferred← citeshttps://doi.org/10.1007/978-3-031-29415-0_3openalex-snapshot
Modern Faces of Filtration
inferred← citeshttps://doi.org/10.1007/978-3-031-43513-3_12openalex-snapshot
A Linear Perspective on Cut-Elimination for Non-wellfounded Sequent Calculi with Least and Greatest Fixed-Points
inferred← citeshttps://doi.org/10.1007/978-3-031-72621-7_2openalex-snapshot
The Satisfiability and Validity Problems for Probabilistic CTL
inferred← citeshttps://doi.org/10.1007/978-3-319-89963-3_21openalex-snapshot
Permutation Games for the Weakly Aconjunctive $$\mu $$ μ -Calculus
inferred← citeshttps://doi.org/10.1007/978-3-540-31856-9_8openalex-snapshot
The Variable Hierarchy of the μ-Calculus Is Strict
inferred← citeshttps://doi.org/10.1007/978-3-642-40184-8_32openalex-snapshot
Satisfiability of CTL* with Constraints
inferred← citeshttps://doi.org/10.1007/978-3-662-59533-6_2openalex-snapshot
An Infinitary Treatment of Full Mu-Calculus
inferred← citeshttps://doi.org/10.1007/978-3-662-59533-6_30openalex-snapshot
Closure Ordinals of the Two-Way Modal $$\mu $$-Calculus
inferred← citeshttps://doi.org/10.1007/bfb0049321openalex-snapshot
On duality for the modal μ-calculus
inferred← citeshttps://doi.org/10.1007/bfb0055090openalex-snapshot
Reasoning about the past with two-way automata
inferred← citeshttps://doi.org/10.1007/s001530050130openalex-snapshot
Undecidability results on two-variable logics
inferred← citeshttps://doi.org/10.1007/s00224-006-1317-8openalex-snapshot
The Variable Hierarchy of the μ-Calculus Is Strict
inferred← citeshttps://doi.org/10.1007/s11225-008-9133-6openalex-snapshot
On the Proof Theory of the Modal mu-Calculus
inferred← citeshttps://doi.org/10.1007/s11225-011-9339-xopenalex-snapshot
On the Modal Definability of Simulability by Finite Transitive Models
inferred← citeshttps://doi.org/10.1007/s11225-012-9378-yopenalex-snapshot
Effective Cut-elimination for a Fragment of Modal mu-calculus
inferred← citeshttps://doi.org/10.1007/s11787-010-0022-1openalex-snapshot
A Buchholz Rule for Modal Fixed Point Logics
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00045-xopenalex-snapshot
Duality and the completeness of the modal μ-calculus
inferred← citeshttps://doi.org/10.1016/b978-0-444-51621-3.50003-7openalex-snapshot
Infinite Combinatorics
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50019-6openalex-snapshot
Logics of Programs
inferred← citeshttps://doi.org/10.1016/b978-044482830-9/50022-9openalex-snapshot
Modal Logics and mu-Calculi: An Introduction
inferred← citeshttps://doi.org/10.1016/j.apal.2007.11.001openalex-snapshot
Completions of μ -algebras
inferred← citeshttps://doi.org/10.1016/j.apal.2012.04.006openalex-snapshot
Syntactic cut-elimination for a fragment of the modal mu-calculus
inferred← citeshttps://doi.org/10.1016/j.ic.2021.104804openalex-snapshot
Temporal logic with recursion
inferred← citeshttps://doi.org/10.1016/j.jcss.2016.02.002openalex-snapshot
Satisfiability of ECTL⁎ with constraints
inferred← citeshttps://doi.org/10.1016/j.jlap.2008.02.005openalex-snapshot
Canonical completeness of infinitary μ
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.11.015openalex-snapshot
On the universal and existential fragments of the μ -calculus
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.03.001openalex-snapshot
Completeness for the modal μ-calculus: Separating the combinatorics from the dynamics
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00217-xopenalex-snapshot
The modal mu-calculus alternation hierarchy is strict
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00233-8openalex-snapshot
Duality for modal μ-logics
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00308-9openalex-snapshot
On logics with two variables
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00314-4openalex-snapshot
Bisimulation-invariant PTIME and higher-dimensional μ-calculus
inferred← citeshttps://doi.org/10.1016/s1570-8683(03)00008-9openalex-snapshot
Mathematical modal logic: A view of its evolution
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80257-9openalex-snapshot
Derivation of Characteristic Formulae
inferred← citeshttps://doi.org/10.1016/s1874-5857(06)80027-0openalex-snapshot
Mathematical modal logic: A view of its evolution
inferred← citeshttps://doi.org/10.1017/s0960129509990260openalex-snapshot
Modal and mixed specifications: key decision problems and their complexities
inferred← citeshttps://doi.org/10.1017/s1755020319000029openalex-snapshot
SMALL INFINITARY EPISTEMIC LOGICS
inferred← citeshttps://doi.org/10.1093/logcom/exs052openalex-snapshot
A small model theorem for the hybrid -calculus
inferred← citeshttps://doi.org/10.1109/lics.1995.523240openalex-snapshot
Completeness of Kozen's axiomatisation of the propositional μ-calculus
inferred← citeshttps://doi.org/10.1109/lics.2008.21openalex-snapshot
The Satisfiability Problem for Probabilistic CTL
inferred← citeshttps://doi.org/10.1109/lics52264.2021.9470560openalex-snapshot
The Topological Mu-Calculus: completeness and decidability
inferred← citeshttps://doi.org/10.1109/lics65433.2025.00019openalex-snapshot
Interpolation for the two-way modal μ-calculus
inferred← citeshttps://doi.org/10.1145/1166160.1166182openalex-snapshot
Comparing XML path expressions
inferred← citeshttps://doi.org/10.1145/1185877.1185882openalex-snapshot
A system for the static analysis of XPath
inferred← citeshttps://doi.org/10.1145/3623268openalex-snapshot
The Topological Mu-Calculus: Completeness and Decidability
inferred← citeshttps://doi.org/10.18154/rwth-conv-121030openalex-snapshot
Pure and applied fixed point logics
inferred← citeshttps://doi.org/10.2178/jsl/1254748696openalex-snapshot
The modalμ-calculus hierarchy over restricted classes of transition systems
inferred← citeshttps://doi.org/10.2307/420995openalex-snapshot
A Note on the Completeness of Kozen's Axiomatisation of the Propositional μ-Calculus
inferred← citeshttps://doi.org/10.29007/lwqmopenalex-snapshot
A Tableau Proof System with Names for Modal Mu-calculus
inferred← citeshttps://doi.org/10.3724/sp.j.1001.2009.03255openalex-snapshot
Semantics and Reasoning of Description Logic mALCQO
inferred← citeshttps://doi.org/10.4204/eptcs.129.2openalex-snapshot
A Proof System with Names for Modal Mu-calculus
inferred← citeshttps://doi.org/10.4204/eptcs.256.6openalex-snapshot
The Descriptive Complexity of Modal μ Model-checking Games
inferred← citeshttps://doi.org/10.4204/eptcs.77.7openalex-snapshot
Cut-elimination for the mu-calculus with one variable
inferred← citeshttps://doi.org/10.4230/lipics.concur.2018.32openalex-snapshot
The Satisfiability Problem for Unbounded Fragments of Probabilistic CTL
inferred← citeshttps://doi.org/10.48550/arxiv.2010.14430openalex-snapshot
Size matters in the modal $μ$-calculus
inferred← citeshttps://doi.org/10.5282/edoc.11677openalex-snapshot
Verification of Non-Regular Program Properties
inferred← citeshttps://doi.org/10.5591/978-1-57735-516-8/ijcai11-149openalex-snapshot
Tangled modal logic for spatial reasoning
inferred← citeshttps://doi.org/10.70675/ab8c4538zf338z4b1dzb5c4z539a6179abc8openalex-snapshot
A study on the expressive power of some fragments of the modal µ-calculus
inferred← citeshttps://doi.org/10.7146/brics.v2i27.19929openalex-snapshot
Automata for the mu-calculus and Related Results
inferred← citeshttps://doi.org/10.7146/brics.v2i6.19508openalex-snapshot
A Complete Deductive System for the mu-Calculus
inferred← citeshttps://doi.org/10.7146/dpb.v22i445.6762openalex-snapshot
Verification of Temporal Properties of Concurrent Systems
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.