On the public citation graph
Descriptive set theory in $$L_{\omega _l \omega }$$
0 signed · 34 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.50022-8openalex-snapshot
FINITE APPROXIMATIONS OF INFINITELY LONG FORMULAS
inferredcites →https://doi.org/10.1016/b978-0-7204-2233-7.50025-3openalex-snapshot
MODEL-THEORETIC INVARIANTS: APPLICATIONS TO RECURSIVE AND HYPERARITHMETIC OPERATIONS
inferredcites →https://doi.org/10.1016/b978-0-7204-2233-7.50031-9openalex-snapshot
OMITTING CLASSES OF ELEMENTS
inferredcites →https://doi.org/10.1017/s0022481200092173openalex-snapshot
The number of countable models
inferredcites →https://doi.org/10.1090/pspum/013.1/0281602openalex-snapshot
Primitive recursive set functions
inferredcites →https://doi.org/10.1090/s0002-9939-1972-0286662-3openalex-snapshot
The Game Quantifier
inferredcites →https://doi.org/10.1090/s0002-9947-1969-0244045-0openalex-snapshot
Abstract first order computability. I, II
inferredcites →https://doi.org/10.1215/s0012-7094-70-03744-0openalex-snapshot
The Suslin-Kleene theorem for countable structures
inferredcites →https://doi.org/10.2307/2270854openalex-snapshot
Abstract Computability and Invariant Definability
inferredcites →https://doi.org/10.2307/2314842openalex-snapshot
Languages with Expressions of Infinite Length.
inferredcites →https://doi.org/10.2307/2964289openalex-snapshot
Finite Axiomatizability using additional predicates
inferredcites →https://doi.org/10.4064/fm-57-3-253-272openalex-snapshot
An interpolation theorem for denumerably long formulas
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.19880340306openalex-snapshot
Vaught Sentences and the Covering Theorem
inferred← citeshttps://doi.org/10.1002/malq.19980440409openalex-snapshot
An Extension of the Lemma of Rasiowa and Sikorski
inferred← citeshttps://doi.org/10.1007/978-1-4020-9374-6_8openalex-snapshot
From Games to Dialogues and Back
inferred← citeshttps://doi.org/10.1007/978-3-319-62864-6_16openalex-snapshot
Borel $$^{*}$$ Sets in the Generalized Baire Space and Infinitary Languages
inferred← citeshttps://doi.org/10.1007/978-94-009-9825-4_9openalex-snapshot
Hierarchies of Model Theoretic Definability—an Approach to Second Order Logics
inferred← citeshttps://doi.org/10.1007/bf02764920openalex-snapshot
New axiomatizations for logics with generalized quantifiers
inferred← citeshttps://doi.org/10.1007/bfb0079423openalex-snapshot
First-order logic and its extensions
inferred← citeshttps://doi.org/10.1007/s11229-008-9357-zopenalex-snapshot
The Craig Interpolation Theorem in abstract model theory
inferred← citeshttps://doi.org/10.1017/s0022481200051768openalex-snapshot
Approximation theorems and model theoretic forcing
inferred← citeshttps://doi.org/10.1201/b21197-6openalex-snapshot
Descriptive Sets and Infinitary Languages
inferred← citeshttps://doi.org/10.1215/00294527-2024-0033openalex-snapshot
Completeness of Infinitary Heterogeneous Logic
inferred← citeshttps://doi.org/10.2307/2273262openalex-snapshot
Locally countable models of Σ1-separation
inferred← citeshttps://doi.org/10.2307/2274584openalex-snapshot
Coinductive formulas and a many-sorted interpolation theorem
inferred← citeshttps://doi.org/10.2307/2275283openalex-snapshot
A Spector-Gandy theorem for cPCd() classes
inferred← citeshttps://doi.org/10.2307/2275326openalex-snapshot
Generalized reduction theorems for model-theoretic analogs of the class of coanalytic sets
inferred← citeshttps://doi.org/10.2307/2275476openalex-snapshot
Dual easy uniformization and model-theoretic descriptive set theory
inferred← citeshttps://doi.org/10.2307/2275584openalex-snapshot
Undefinability of κ-well-orderings in L∞κ
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.