On the public citation graph

Algorithmic properties of branching models

https://doi.org/10.1007/bf01979010

0 signed · 16 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 this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf01669102openalex-snapshot

Autostability of models

inferredcites →https://doi.org/10.1007/bf01669834openalex-snapshot

A totally transcendental decidable theory without constructivizable homogeneous models

inferredcites →https://doi.org/10.1007/bf02219289openalex-snapshot

Constructive models of complete solvable theories

inferredcites →https://doi.org/10.1007/bf02219296openalex-snapshot

Some aspects of generalized computability

inferredcites →https://doi.org/10.1017/s0004972700021675openalex-snapshot

Recursive properties of isomorphism types

inferredcites →https://doi.org/10.2307/2273758openalex-snapshot

Recursive Boolean algebras with recursive atoms

What points at this work

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

inferred← citeshttps://doi.org/10.1007/bf00739415openalex-snapshot

Computable classes of constructivizations for models of infinite algorithmic dimension

inferred← citeshttps://doi.org/10.1007/bf00739993openalex-snapshot

Constructive models of regularly infinite algorithmic dimension

inferred← citeshttps://doi.org/10.1007/bf02672914openalex-snapshot

Autostability of boolean algebras with distinguished ideal

inferred← citeshttps://doi.org/10.1007/s00153-008-0111-5openalex-snapshot

Preface

inferred← citeshttps://doi.org/10.1007/s00153-008-0112-4openalex-snapshot

Linear orders with distinguished function symbol

inferred← citeshttps://doi.org/10.1007/s40653-026-00887-2openalex-snapshot

Adverse Childhood Experiences and One-year Outcomes of Child and Adolescent Psychiatric Inpatient Treatment in Japan

inferred← citeshttps://doi.org/10.1016/0168-0072(94)90012-4openalex-snapshot

Recursive unary algebras and trees

inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80005-0openalex-snapshot

Chapter 4 Computable classes of constructive models

inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80012-8openalex-snapshot

Chapter 11 A bibliography of recursive algebra and recursive model theory

inferred← citeshttps://doi.org/10.1023/b:allo.0000044278.96526.5dopenalex-snapshot

Autostable I-Algebras

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.