On the public citation graph
μ-definable sets of integers
0 signed · 46 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/978-3-662-11035-5openalex-snapshot
Admissible Sets and Structures
inferredcites →https://doi.org/10.1007/bfb0059533openalex-snapshot
Conference in Mathematical Logic — London ’70
inferredcites →https://doi.org/10.1007/bfb0059534openalex-snapshot
Inductive definitions and analogues of large cardinals
inferredcites →https://doi.org/10.1016/0304-3975(82)90125-6openalex-snapshot
Results on the propositional μ-calculus
inferredcites →https://doi.org/10.1016/s0049-237x(08)70589-5openalex-snapshot
Inductive Definitions and Their Closure Ordinals
inferredcites →https://doi.org/10.1016/s0049-237x(08)70592-5openalex-snapshot
Inductive Definitions and Reflecting Properties of Admissible Ordinals
inferredcites →https://doi.org/10.1016/s0049-237x(08)71120-0openalex-snapshot
An Introduction to Inductive Definitions
inferredcites →https://doi.org/10.1016/s0049-237x(08)71233-3openalex-snapshot
Recursively Mahlo Ordinals and Inductive Definitions
inferredcites →https://doi.org/10.1016/s0049-237x(08)x7092-2openalex-snapshot
Elementary Induction on Abstract Structures
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/malq.201010009openalex-snapshot
Extending constructive operational set theory by impredicative principles
inferred← citeshttps://doi.org/10.1002/malq.201900064openalex-snapshot
A fixed point theory over stratified truth
inferred← citeshttps://doi.org/10.1007/11538363_27openalex-snapshot
Transfinite Extension of the Mu-Calculus
inferred← citeshttps://doi.org/10.1007/3-540-44622-2_16openalex-snapshot
Independence: Logics and Concurrency
inferred← citeshttps://doi.org/10.1007/3-540-48168-0_25openalex-snapshot
Fixpoint Alternation and the Game Quantifier
inferred← citeshttps://doi.org/10.1007/3-540-61604-7_58openalex-snapshot
The modal mu-calculus alternation hierarchy is strict
inferred← citeshttps://doi.org/10.1007/978-3-030-32304-2_20openalex-snapshot
Temporal Verification of Programs via First-Order Fixpoint Logic
inferred← citeshttps://doi.org/10.1007/978-3-030-45237-7_12openalex-snapshot
Fold/Unfold Transformations for Fixpoint Logic
inferred← citeshttps://doi.org/10.1007/978-3-030-49424-7_19openalex-snapshot
On the Strength of the Uniform Fixed Point Principle in Intuitionistic Explicit Mathematics
inferred← citeshttps://doi.org/10.1007/978-3-031-64309-5_24openalex-snapshot
Higher-Order Feedback Computation
inferred← citeshttps://doi.org/10.1007/978-3-319-27683-0_17openalex-snapshot
Parallel Feedback Turing Computability
inferred← citeshttps://doi.org/10.1007/bfb0028547openalex-snapshot
Simplifying the modal mu-calculus alternation hierarchy
inferred← citeshttps://doi.org/10.1007/s00222-025-01322-3openalex-snapshot
The metamathematics of separated determinacy
inferred← citeshttps://doi.org/10.1016/j.apal.2003.11.032openalex-snapshot
An intensional fixed point theory over first order arithmetic
inferred← citeshttps://doi.org/10.1016/j.ipl.2004.04.001openalex-snapshot
On Fixpoint Arithmetic and Infinite Time Turing Machines
inferred← citeshttps://doi.org/10.1016/j.scico.2023.103014openalex-snapshot
Asynchronous unfold/fold transformation for fixpoint logic
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/s0304-3975(97)00217-xopenalex-snapshot
The modal mu-calculus alternation hierarchy is strict
inferred← citeshttps://doi.org/10.1017/s1079898600004066openalex-snapshot
2003 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquim '03
inferred← citeshttps://doi.org/10.1051/ita:1999122openalex-snapshot
Fixpoint alternation: arithmetic, transition systems, and the binary tree
inferred← citeshttps://doi.org/10.1051/ita:2003011openalex-snapshot
Fixpoints, games and the difference hierarchy
inferred← citeshttps://doi.org/10.1093/9780197784402.003.0017openalex-snapshot
A Metapredicative Study of μ -Arithmetics
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198566519.003.0002openalex-snapshot
GENERALIZED INDUCTIVE DEFINITIONS IN CONSTRUCTIVE SET THEORY
inferred← citeshttps://doi.org/10.1093/logcom/exaa002openalex-snapshot
An introduction to feedback Turing computability
inferred← citeshttps://doi.org/10.1109/lics.2015.55openalex-snapshot
Feedback Turing Computability, and Turing Computability as Feedback
inferred← citeshttps://doi.org/10.1109/lics56636.2023.10175772openalex-snapshot
Computational expressivity of (circular) proofs with fixed points
inferred← citeshttps://doi.org/10.1145/3373718.3394766openalex-snapshot
On Computability of Logical Approaches to Branching-Time Property Verification of Programs
inferred← citeshttps://doi.org/10.1145/3571265openalex-snapshot
Modular Primal-Dual Fixpoint Logic Solving for Temporal Verification
inferred← citeshttps://doi.org/10.7146/brics.v5i53.19499openalex-snapshot
Fixpoint Alternation: Arithmetic, Transition Systems, and the Binary Tree
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.