On the public citation graph

Logical Foundations of Computer Science — Tver '92

https://doi.org/10.1007/bfb0023857
0 signed · 17 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.
Claim with ORCID
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.
See reference health

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/10703163_17openalex-snapshot
Existence and Uniqueness of Normal Forms in Pure Type Systems with βη-conversion
inferred← citeshttps://doi.org/10.1007/3-540-45500-0_14openalex-snapshot
Generation of a Linear Time Query Processing Algorithm Based on Well-Quasi-Orders
inferred← citeshttps://doi.org/10.1007/3-540-58140-5_24openalex-snapshot
Arity vs. alternation in second order logic
inferred← citeshttps://doi.org/10.1007/978-3-031-92196-4_4openalex-snapshot
The Many Uses of Dynamic Logic
inferred← citeshttps://doi.org/10.1007/978-3-540-92687-0_13openalex-snapshot
Complete Axiomatizations of MSO, FO(TC 1 ) and FO(LFP 1 ) on Finite Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-02261-6_23openalex-snapshot
A Duality for Algebras of Lattice-Valued Modal Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-14309-0_12openalex-snapshot
Proof-Theoretic and Higher-Order Extensions of Logic Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-22221-4_17openalex-snapshot
Distributional Learning of Abstract Categorial Grammars
inferred← citeshttps://doi.org/10.1007/978-3-642-25370-6_29openalex-snapshot
Supporting the Harvard Model of Principled Negotiation with Superexpertise
inferred← citeshttps://doi.org/10.1007/bfb0022577openalex-snapshot
On the saturation principle for a linear temporal logic
inferred← citeshttps://doi.org/10.1007/bfb0032399openalex-snapshot
Well-ordering of algebras and Kruskal's theorem
inferred← citeshttps://doi.org/10.1007/s10849-007-9052-3openalex-snapshot
Inessential Features, Ineliminable Features, and Modal Logics for Model Theoretic Syntax
inferred← citeshttps://doi.org/10.1016/0168-0072(95)00067-4openalex-snapshot
Effective inseparability in a topological setting
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00027-8openalex-snapshot
On an effective hierarchy of communicating processes: Separation principle and testing
inferred← citeshttps://doi.org/10.1016/s0890-5401(03)00142-1openalex-snapshot
A linear time algorithm for monadic querying of indefinite data over linearly ordered domains
inferred← citeshttps://doi.org/10.1016/s1570-2464(07)80022-xopenalex-snapshot
19 Applications of modal logic in linguistics
inferred← citeshttps://doi.org/10.3233/fi-1996-26202openalex-snapshot
RECURSIVE MODELS OF GENERAL INDUCTIVE TYPES
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.