On the public citation graph

Ideal models and some not so ideal problems in the model theory of L(Q)

https://doi.org/10.2307/2272829
0 signed · 25 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/978-3-030-52279-7_15openalex-snapshot
Models and Ultraproducts
inferredcites →https://doi.org/10.1007/bf02762675openalex-snapshot
Beth’s theorem in cardinality logics
inferredcites →https://doi.org/10.1007/bf02834760openalex-snapshot
Model theory via set theory
inferredcites →https://doi.org/10.1016/0003-4843(73)90014-4openalex-snapshot
Some combinatorial problems concerning uncountable cardinals
inferredcites →https://doi.org/10.1016/s0003-4843(70)80005-5openalex-snapshot
Logic with the quantifier “there exist uncountably many”
inferredcites →https://doi.org/10.1016/s0003-4843(78)80001-1openalex-snapshot
Model-Theoretic Forcing in Logic With a Generalized Quantifier
inferredcites →https://doi.org/10.1016/s0049-237x(08)x7020-xopenalex-snapshot
Introduction to Model Theory and to the Metamathematics of Algebra
inferredcites →https://doi.org/10.1017/s0022481200051604openalex-snapshot
An introduction to recursively saturated and resplendent models
inferredcites →https://doi.org/10.1017/s0022481200094342openalex-snapshot
Annals of mathematical logic
inferredcites →https://doi.org/10.1090/s0002-9904-1972-12921-5openalex-snapshot
Löwenheim-Skolem and interpolation theorems in infinitary languages
inferredcites →https://doi.org/10.2140/pjm.1975.56.265openalex-snapshot
Model-completeness in a first order language with a generalized quantifier
inferredcites →https://doi.org/10.2307/2269789openalex-snapshot
Abraham Robinson. Introduction to model theory and to the metamathematics of algebra. Studies in logic and the foundations of mathematics. North-Holland Publishing Company, Amsterdam1963, IX + 284 pp.
inferredcites →https://doi.org/10.2307/2272817openalex-snapshot
Toward model theory through recursive saturation

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.19830290304openalex-snapshot
REGULAR RELATIONS AND THE QUANTIFIER “THERE EXIST UNCOUNTABLY MANY”
inferred← citeshttps://doi.org/10.1002/malq.201110051openalex-snapshot
Completeness and interpolation of almost‐everywhere quantification over finitely additive measures
inferred← citeshttps://doi.org/10.1007/978-1-4020-6324-4_4openalex-snapshot
Quantifiers in Formal and Natural Languages
inferred← citeshttps://doi.org/10.1007/978-94-009-1171-0_1openalex-snapshot
Quantifiers in Formal and Natural Languages
inferred← citeshttps://doi.org/10.1007/bf02011633openalex-snapshot
The role of the Omitting Types Theorem in infinitary logic
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)72001-9openalex-snapshot
Quantifying Over Countable Sets: Positive vs Stationary Logic
inferred← citeshttps://doi.org/10.1017/s1755020313000270openalex-snapshot
ON THE GENERAL INTERPRETATION OF FIRST-ORDER QUANTIFIERS
inferred← citeshttps://doi.org/10.1090/s0002-9939-1980-0572318-0openalex-snapshot
Ultraproduct Invariant Logics
inferred← citeshttps://doi.org/10.1090/s0002-9939-1980-0581007-8openalex-snapshot
A many-sorted interpolation theorem for 𝐿(𝑄)
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.2178/jsl/1183743738openalex-snapshot
Axiomatizing Universal Properties of Quantifiers
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.