On the public citation graph

Model theory via set theory

0 signed · 22 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/bf02758130openalex-snapshot
More Lowenheim-Skolem results for admissible sets
inferredcites →https://doi.org/10.1007/bf02771605openalex-snapshot
Elementary extensions of models of set theory
inferredcites →https://doi.org/10.1007/bf02771640openalex-snapshot
Some model theoretic results for θ-logic
inferredcites →https://doi.org/10.1007/bf02771648openalex-snapshot
Hanf numbers for fragments of ℶ h (A)
inferredcites →https://doi.org/10.1007/bfb0066789openalex-snapshot
Countable models of set theories
inferredcites →https://doi.org/10.1007/bfb0079095openalex-snapshot
Partitions and models
inferredcites →https://doi.org/10.1016/s0049-237x(08)x7034-xopenalex-snapshot
Model Theory For Infinitary Logic
inferredcites →https://doi.org/10.1017/s0022481200051574openalex-snapshot
Order types of ordinals in models of set theory
inferredcites →https://doi.org/10.1017/s0022481200051823openalex-snapshot
Elementary extensions of countable models of set theory
inferredcites →https://doi.org/10.1090/memo/0057openalex-snapshot
A hierarchy of formulas in set theory
inferredcites →https://doi.org/10.1090/s0002-9947-1975-0376334-6openalex-snapshot
Generalized Quantifiers and Compact Logic
inferredcites →https://doi.org/10.2307/2270256openalex-snapshot
Infinitary analogs of theorems from first order model theory

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.19810271103openalex-snapshot
Applications of Many‐Sorted Robinson Consistency Theorem
inferred← citeshttps://doi.org/10.1002/malq.200410058openalex-snapshot
Recursive logic frames
inferred← citeshttps://doi.org/10.1016/0003-4843(82)90021-3openalex-snapshot
Compactness, interpolation and Friedman's third problem
inferred← citeshttps://doi.org/10.1017/s0022481200051574openalex-snapshot
Order types of ordinals in models of set theory
inferred← citeshttps://doi.org/10.1090/conm/361openalex-snapshot
Nonstandard Models of Arithmetic and Set Theory
inferred← citeshttps://doi.org/10.1090/s0002-9947-1978-0462942-3openalex-snapshot
𝐿_{∞}_{𝜆}-equivalence, isomorphism and potential isomorphism
inferred← citeshttps://doi.org/10.1090/s0002-9947-1981-0590421-1openalex-snapshot
Robinson's Consistency Theorem in Soft Model Theory
inferred← citeshttps://doi.org/10.1090/s0002-9947-1984-0737894-1openalex-snapshot
On Certain Elementary Extensions of Models of Set Theory
inferred← citeshttps://doi.org/10.2178/bsl/1080330273openalex-snapshot
Barwise: Abstract Model Theory and Generalized Quantifiers
inferred← citeshttps://doi.org/10.2307/2272829openalex-snapshot
Ideal models and some not so ideal problems in the model theory of L(Q)
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.