On the public citation graph

Choice of infinitary languages by means of definability criteria; Generalized recursion theory

https://doi.org/10.1007/bfb0079687
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.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.50036-8openalex-snapshot
LOGIC WITH DENUMERABLY LONG FORMULAS AND FINITE STRINGS OF QUANTIFIERS**The author is very much indebted to Carol Karp, E. G. K. Lopez-Escobar, and Czeslaw Ryll-Nardzewski for much stimulating correspondence and many interesting conversations on the topic of this paper.
inferredcites →https://doi.org/10.1016/s0049-237x(08)71525-8openalex-snapshot
Informal Rigour and Completeness Proofs
inferredcites →https://doi.org/10.1016/s0049-237x(09)70462-8openalex-snapshot
The Classical and The ω-Complete Arithmetic
inferredcites →https://doi.org/10.1090/memo/0057openalex-snapshot
A hierarchy of formulas in set theory
inferredcites →https://doi.org/10.1090/pspum/005/0142458openalex-snapshot
Representability of sets in formal systems
inferredcites →https://doi.org/10.1090/s0002-9947-1959-0102480-9openalex-snapshot
Recursive functionals and quantifiers of finite types. I
inferredcites →https://doi.org/10.2307/2270330openalex-snapshot
Implicit definability and infinitary languages
inferredcites →https://doi.org/10.2307/2270577openalex-snapshot
Satisfaction for n-th order languages defined in n-th order languages
inferredcites →https://doi.org/10.2307/2314842openalex-snapshot
Languages with Expressions of Infinite Length.
inferredcites →https://doi.org/10.2307/2964336openalex-snapshot
Sentences true in all constructive models
inferredcites →https://doi.org/10.2307/2964398openalex-snapshot
The classical and the ω-complete arithmetic
inferredcites →https://doi.org/10.2307/2964568openalex-snapshot
A completeness theorem in modal logic
inferredcites →https://doi.org/10.4064/fm-44-1-12-36openalex-snapshot
On a generalization of quantifiers
inferredcites →https://doi.org/10.4064/fm-53-3-309-324openalex-snapshot
Incompactness in languages with infinitely long expressions

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-319-23534-9_14openalex-snapshot
Logics of Finite Hankel Rank
inferred← citeshttps://doi.org/10.1007/978-94-009-9056-2_6openalex-snapshot
Infinitary Logics
inferred← citeshttps://doi.org/10.1007/bfb0079680openalex-snapshot
Implicit definability and compactness in infinitary languages
inferred← citeshttps://doi.org/10.1007/bfb0079684openalex-snapshot
An algebraic proof of the barwise compactness theorem
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70715-8openalex-snapshot
References
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71230-8openalex-snapshot
Some Reasons for Generalizing Recursion Theory
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)72009-3openalex-snapshot
Compactness Properties of Infinitary and Abstract Languages
inferred← citeshttps://doi.org/10.1017/s0305004100049379openalex-snapshot
Adding propositional connectives to countable infinitary logic
inferred← citeshttps://doi.org/10.1093/jigpal/jzac055openalex-snapshot
Recollections of logicians, mathematicians and philosophers
inferred← citeshttps://doi.org/10.4230/lipics.csl.2011.553openalex-snapshot
Model Theory in Computer Science: My Own Recurrent Themes
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.