On the public citation graph
Proceedings of the 7th and 8th Asian Logic Conferences
0 signed · 24 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 points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-319-50062-1openalex-snapshot
Computability and Complexity
inferred← citeshttps://doi.org/10.1007/978-3-540-39866-0_13openalex-snapshot
Proofs-as-Imperative-Programs: Application to Synthesis of Contracts
inferred← citeshttps://doi.org/10.1007/978-3-540-73001-9_14openalex-snapshot
K-Trivial Closed Sets and Continuous Functions
inferred← citeshttps://doi.org/10.1007/s00153-007-0046-2openalex-snapshot
On the definable ideal generated by the plus cupping c.e. degrees
inferred← citeshttps://doi.org/10.1016/j.aim.2007.09.008openalex-snapshot
Strong jump-traceability I: The computably enumerable case
inferred← citeshttps://doi.org/10.1016/j.aim.2012.06.005openalex-snapshot
Characterizing the strongly jump-traceable sets via randomness
inferred← citeshttps://doi.org/10.1016/j.aim.2012.12.018openalex-snapshot
Pseudo-jump inversion, upper cone avoidance, and strong jump-traceability
inferred← citeshttps://doi.org/10.1016/j.apal.2007.11.002openalex-snapshot
Lowness properties and approximations of the jump
inferred← citeshttps://doi.org/10.1016/j.apal.2009.06.007openalex-snapshot
Extending and interpreting Post’s programme
inferred← citeshttps://doi.org/10.1016/j.apal.2010.12.005openalex-snapshot
Upper bounds on ideals in the computably enumerable Turing degrees
inferred← citeshttps://doi.org/10.1016/j.apal.2011.06.008openalex-snapshot
Tracing and domination in the Turing degrees
inferred← citeshttps://doi.org/10.1016/j.apal.2011.12.011openalex-snapshot
Computably enumerable sets below random sets
inferred← citeshttps://doi.org/10.1016/j.apal.2013.06.007openalex-snapshot
Kolmogorov complexity and computably enumerable sets
inferred← citeshttps://doi.org/10.1016/j.apal.2018.04.004openalex-snapshot
Splitting into degrees with low computational strength
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.05.025openalex-snapshot
Lowness Properties and Approximations of the Jump
inferred← citeshttps://doi.org/10.1016/j.jcss.2007.01.002openalex-snapshot
Undecidability of the structure of the Solovay degrees of c.e. reals
inferred← citeshttps://doi.org/10.1016/j.jcss.2015.04.004openalex-snapshot
Solovay functions and their applications in algorithmic randomness
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.09.020openalex-snapshot
On the number of infinite sequences with trivial initial segment complexity
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/s1079898600004248openalex-snapshot
2003 Annual Meeting of the Association for Symbolic Logic
inferred← citeshttps://doi.org/10.1305/ndjfl/1107220673openalex-snapshot
Program Size Complexity for Possibly Infinite Computations
inferred← citeshttps://doi.org/10.2178/jsl/1120224726openalex-snapshot
Randomness, relativization and Turing degrees
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.