On the public citation graph
Infinitary analogs of theorems from first order model theory
0 signed · 42 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/s0049-237x(08)x7021-1openalex-snapshot
Languages with Expressions of Infinite Length
inferredcites →https://doi.org/10.2307/2270908openalex-snapshot
On the model theory of denumerably long formulas with finite strings of quantifiers
inferredcites →https://doi.org/10.2307/2271066openalex-snapshot
An extension of the Craig-Lyndon interpolation theorem
inferredcites →https://doi.org/10.2969/jmsj/01340357openalex-snapshot
A formal system of first-order predicate calculus with infinitely long expressions
inferredcites →https://doi.org/10.4064/fm-43-1-50-68openalex-snapshot
Models of axiomatic theories admitting automorphisms
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-57-3-253-272openalex-snapshot
An interpolation theorem for denumerably long formulas
inferredcites →https://doi.org/10.4064/fm-59-3-299-300openalex-snapshot
An addition to "On defining well-orderings"
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/bf02762675openalex-snapshot
Beth’s theorem in cardinality logics
inferred← citeshttps://doi.org/10.1007/bfb0081120openalex-snapshot
Back-and-forth arguments and infinitary logics
inferred← citeshttps://doi.org/10.1007/s00153-004-0248-9openalex-snapshot
Definability and automorphisms in abstract logics
inferred← citeshttps://doi.org/10.1007/s11229-008-9357-zopenalex-snapshot
The Craig Interpolation Theorem in abstract model theory
inferred← citeshttps://doi.org/10.1016/0003-4843(76)90021-8openalex-snapshot
δ-Logics and generalized quantifiers
inferred← citeshttps://doi.org/10.1016/0003-4843(77)90010-9openalex-snapshot
Countable approximations and Löwenheim-Skolem theorems
inferred← citeshttps://doi.org/10.1016/0003-4843(82)90021-3openalex-snapshot
Compactness, interpolation and Friedman's third problem
inferred← citeshttps://doi.org/10.1016/j.apal.2003.11.002openalex-snapshot
Algorithmic uses of the Feferman–Vaught Theorem
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71103-0openalex-snapshot
Admissible Sets and Infinitary Logic
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71999-2openalex-snapshot
Uniform Theorems in Infinitary Locic
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70657-3openalex-snapshot
How to Obtain Interpolation for L
inferred← citeshttps://doi.org/10.1017/bsl.2023.1openalex-snapshot
WHICH CLASSES OF STRUCTURES ARE BOTH PSEUDO-ELEMENTARY AND DEFINABLE BY AN INFINITARY SENTENCE?
inferred← citeshttps://doi.org/10.1017/jsl.2023.19openalex-snapshot
INFINITARY LOGIC HAS NO EXPRESSIVE EFFICIENCY OVER FINITARY LOGIC
inferred← citeshttps://doi.org/10.1017/s0022481200065518openalex-snapshot
Scott's interpolation theorem fails for Lω1, ω
inferred← citeshttps://doi.org/10.1017/s0027763000015841openalex-snapshot
A heterogeneous interpolant
inferred← citeshttps://doi.org/10.1090/s0002-9939-1976-0421982-4openalex-snapshot
On the Failure of the Weak Beth Property
inferred← citeshttps://doi.org/10.1090/s0002-9947-1979-0546916-0openalex-snapshot
The theorems of Beth and Craig in abstract model theory. I. The abstract setting
inferred← citeshttps://doi.org/10.1093/logcom/exac043openalex-snapshot
Projective classes as images of accessible functors
inferred← citeshttps://doi.org/10.1142/s0219061311001006openalex-snapshot
CHAIN MODELS, TREES OF SINGULAR CARDINALITY AND DYNAMIC EF-GAMES
inferred← citeshttps://doi.org/10.1305/ndjfl/1093637937openalex-snapshot
A unified approach to relative interpolation.
inferred← citeshttps://doi.org/10.2307/2271891openalex-snapshot
One hundred and two problems in mathematical logic
inferred← citeshttps://doi.org/10.2307/2273033openalex-snapshot
Weak definability in infinitary languages
inferred← citeshttps://doi.org/10.2307/2273956openalex-snapshot
Pragmatic truth and approximation to truth
inferred← citeshttps://doi.org/10.2307/2274705openalex-snapshot
A direct proof of the Feferman-Vaught theorem and other preservation theorems in products
inferred← citeshttps://doi.org/10.2307/2586505openalex-snapshot
Interpolation and preservation for pebble logics
inferred← citeshttps://doi.org/10.2307/2586507openalex-snapshot
Interpolation, preservation, and pebble games
inferred← citeshttps://doi.org/10.4467/20842589rm.15.001.3910openalex-snapshot
Interpolation theorems for some variants of LTL
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.