On the public citation graph
Reduced products and nonstandard logics
0 signed · 30 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.1016/b978-0-7204-2233-7.50043-5openalex-snapshot
FINITE-QUANTIFIER EQUIVALENCE
inferredcites →https://doi.org/10.1016/s0049-237x(08)x7021-1openalex-snapshot
Languages with Expressions of Infinite Length
inferredcites →https://doi.org/10.1016/s1385-7258(61)50048-0openalex-snapshot
Ultraproducts and elementary classes
inferredcites →https://doi.org/10.1016/s1385-7258(64)50021-9openalex-snapshot
Ultraproducts and Saturated Models
inferredcites →https://doi.org/10.2307/1970235openalex-snapshot
Ultraproducts in the Theory of Models
inferredcites →https://doi.org/10.2307/2314842openalex-snapshot
Languages with Expressions of Infinite Length.
inferredcites →https://doi.org/10.4064/fm-47-1-57-103openalex-snapshot
The first order properties of products of algebraic systems
inferredcites →https://doi.org/10.4064/fm-49-2-129-141openalex-snapshot
An application of games to the completeness problem for formalized theories
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.201200104openalex-snapshot
An Ehrenfeucht‐Fraïssé game for
inferred← citeshttps://doi.org/10.1007/bf02756564openalex-snapshot
Infinitary model theory of abelian groups
inferred← citeshttps://doi.org/10.1007/bfb0059538openalex-snapshot
Infinitary properties, local functors, and systems of ordinal functions
inferred← citeshttps://doi.org/10.1007/bfb0081120openalex-snapshot
Back-and-forth arguments and infinitary logics
inferred← citeshttps://doi.org/10.1016/0003-4843(72)90010-1openalex-snapshot
On reduced products and filters
inferred← citeshttps://doi.org/10.1016/0003-4843(72)90018-6openalex-snapshot
Strong compactness and other cardinal sins
inferred← citeshttps://doi.org/10.1023/a:1005233530449openalex-snapshot
Elementary Classes in Basic Modal Logic
inferred← citeshttps://doi.org/10.1080/00927878208822797openalex-snapshot
Primitive rings are not definable in l∞∞
inferred← citeshttps://doi.org/10.1090/s0002-9947-1978-0462942-3openalex-snapshot
𝐿_{∞}_{𝜆}-equivalence, isomorphism and potential isomorphism
inferred← citeshttps://doi.org/10.2140/pjm.1971.36.811openalex-snapshot
On the number of non-almost isomorphic models ofTin a power
inferred← citeshttps://doi.org/10.48550/arxiv.1212.0108openalex-snapshot
An Ehrenfeucht-Fraïssé Game for $L_{ω_1ω}$
inferred← citeshttps://doi.org/10.70930/tac/90or4skxopenalex-snapshot
On reflective subcategories of locally presentable categories
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.