On the public citation graph
Implicit definability and compactness in infinitary languages
0 signed · 23 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.1007/bfb0079687openalex-snapshot
Choice of infinitary languages by means of definability criteria; Generalized recursion theory
inferredcites →https://doi.org/10.1073/pnas.24.12.556openalex-snapshot
The Consistency of the Axiom of Choice and of the Generalized Continuum-Hypothesis
inferredcites →https://doi.org/10.1090/memo/0057openalex-snapshot
A hierarchy of formulas in set theory
inferredcites →https://doi.org/10.1090/s0002-9904-1966-11507-0openalex-snapshot
Persistent and invariant formulas relative to theories of higher order
inferredcites →https://doi.org/10.2307/2270330openalex-snapshot
Implicit definability and infinitary languages
inferredcites →https://doi.org/10.2307/2270780openalex-snapshot
Nonaxiomatizability results for infinitary systems
inferredcites →https://doi.org/10.4064/fm-53-3-309-324openalex-snapshot
Incompactness in languages with infinitely long expressions
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.19780242516openalex-snapshot
A Forcing Approach to Strict‐II11 Reflection and Strict‐II11 = ∑01
inferred← citeshttps://doi.org/10.1007/978-3-319-63334-3_13openalex-snapshot
On Some Semi-constructive Theories Related to Kripke–Platek Set Theory
inferred← citeshttps://doi.org/10.1007/bf00972801openalex-snapshot
Cardinality of models for theories in a calculus with a Härtig quantifier
inferred← citeshttps://doi.org/10.1007/bfb0079424openalex-snapshot
Set theory in infinitary languages
inferred← citeshttps://doi.org/10.1007/bfb0079679openalex-snapshot
The Syntax and Semantics of Infinitary Languages
inferred← citeshttps://doi.org/10.1007/bfb0081123openalex-snapshot
On a finiteness condition for infinitary languages
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)72009-3openalex-snapshot
Compactness Properties of Infinitary and Abstract Languages
inferred← citeshttps://doi.org/10.1093/mind/fzv112openalex-snapshot
What Is the Well-Foundedness of Grounding?
inferred← citeshttps://doi.org/10.1134/s1995080214040192openalex-snapshot
Using computability to measure complexity of algebraic structures and classes of structures
inferred← citeshttps://doi.org/10.2307/2270906openalex-snapshot
Applications of Strict Π11 predicates to infinitary logic
inferred← citeshttps://doi.org/10.2307/2273528openalex-snapshot
Σ1-compactness in languages stronger than
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.