On the public citation graph
Definability, automorphisms, and infinitary languages
0 signed · 56 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/bf01897040openalex-snapshot
On a generalization of a theorem of E. W. Beth
inferredcites →https://doi.org/10.1016/b978-0-7204-2233-7.50031-9openalex-snapshot
OMITTING CLASSES OF ELEMENTS
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)71183-2openalex-snapshot
Infinitary Properties of Models Generated from Indiscernibles
inferredcites →https://doi.org/10.1016/s1385-7258(53)50042-3openalex-snapshot
On Padoa’s Method in the Theory of Definition
inferredcites →https://doi.org/10.1090/s0002-9904-1964-11244-1openalex-snapshot
Some new results in definability
inferredcites →https://doi.org/10.1111/j.1755-2567.1959.tb00301.xopenalex-snapshot
A theorem on permutations in models
inferredcites →https://doi.org/10.3792/pja/1195525915openalex-snapshot
Sur quelques ensembles ordonnés linéairement
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.19960420139openalex-snapshot
Intrinsically Hyperarithmetical Sets
inferred← citeshttps://doi.org/10.1006/aima.1999.1852openalex-snapshot
The Automorphism Tower Problem Revisited
inferred← citeshttps://doi.org/10.1007/978-3-031-56215-0_20openalex-snapshot
Symmetry and Definability
inferred← citeshttps://doi.org/10.1007/978-94-017-0522-6_5openalex-snapshot
Games and Trees in Infinitary Logic: A Survey
inferred← citeshttps://doi.org/10.1007/bf01194294openalex-snapshot
A note on automorphism groups of countably infinite structures
inferred← citeshttps://doi.org/10.1007/bf01894775openalex-snapshot
Structures elementarily equivalent relative to infinitary languages to models of higher power
inferred← citeshttps://doi.org/10.1007/bf01991854openalex-snapshot
On models with large automorphism groups
inferred← citeshttps://doi.org/10.1007/bf02260930openalex-snapshot
Functional trees and automorphisms of models
inferred← citeshttps://doi.org/10.1007/bf02485234openalex-snapshot
Some cardinal functions on algebras
inferred← citeshttps://doi.org/10.1007/bf02485269openalex-snapshot
Some cardinal functions on algebras II
inferred← citeshttps://doi.org/10.1007/bf02573601openalex-snapshot
On algebraic closure and amalgamation of semigroups
inferred← citeshttps://doi.org/10.1007/bfb0058935openalex-snapshot
Countable type local theorems in algebra
inferred← citeshttps://doi.org/10.1007/bfb0079679openalex-snapshot
The Syntax and Semantics of Infinitary Languages
inferred← citeshttps://doi.org/10.1007/bfb0081120openalex-snapshot
Back-and-forth arguments and infinitary logics
inferred← citeshttps://doi.org/10.1007/bfb0081122openalex-snapshot
Chain models: Applications of consistency properties and back-and-forth techniques in infinite-quantifier languages
inferred← citeshttps://doi.org/10.1007/s00153-017-0597-9openalex-snapshot
Complete groups are complete co-analytic
inferred← citeshttps://doi.org/10.1007/s10469-010-9079-4openalex-snapshot
Simple structures with complex symmetry
inferred← citeshttps://doi.org/10.1007/s10801-014-0529-2openalex-snapshot
Infinite motion and 2-distinguishability of graphs and groups
inferred← citeshttps://doi.org/10.1016/0003-4843(70)90003-3openalex-snapshot
Generalized interpolation and definability
inferred← citeshttps://doi.org/10.1016/0003-4843(70)90006-9openalex-snapshot
Infinitary properties of abelian torsion groups
inferred← citeshttps://doi.org/10.1016/0003-4843(77)90008-0openalex-snapshot
An “admissible” generalization of a theorem on countable ∑11 sets of reals with applications
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/0168-0072(91)90098-7openalex-snapshot
Automorphisms of recursively saturated models of arithmetic
inferred← citeshttps://doi.org/10.1016/0168-0072(94)00045-5openalex-snapshot
Back and forth relations for reduced abelian p-groups
inferred← citeshttps://doi.org/10.1016/s0003-4843(70)80006-7openalex-snapshot
Local definability theory
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)71350-8openalex-snapshot
Algebraisch Abgeschlossene Gruppen
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80009-8openalex-snapshot
Chapter 8 Groups of computable automorphisms
inferred← citeshttps://doi.org/10.1017/s0022481200051872openalex-snapshot
Applications of vaught sentences and the covering theorem
inferred← citeshttps://doi.org/10.1017/s0305004100073291openalex-snapshot
McLain groups over arbitrary rings and orderings
inferred← citeshttps://doi.org/10.1023/a:1020975619422openalex-snapshot
Automorphism Groups of Computably Enumerable Predicates
inferred← citeshttps://doi.org/10.1090/s0002-9904-1973-13258-6openalex-snapshot
Global definability theory in 𝐿_{𝜔₁𝜔}
inferred← citeshttps://doi.org/10.1112/jlms/s2-48.2.204openalex-snapshot
The Small Index Property for ω‐Stable ω‐Categorical Structures and for the Random Graph
inferred← citeshttps://doi.org/10.1515/form.2003.027openalex-snapshot
Subgroups defining automorphisms in locally nilpotent groups
inferred← citeshttps://doi.org/10.2307/2273460openalex-snapshot
Some local definability results on countable topological structures
inferred← citeshttps://doi.org/10.2307/2275150openalex-snapshot
On the number of automorphisms of uncountable models
inferred← citeshttps://doi.org/10.2307/2586617openalex-snapshot
An elementary definability theorem for first order logic
inferred← citeshttps://doi.org/10.2307/2586718openalex-snapshot
On automorphism groups of countable structures
inferred← citeshttps://doi.org/10.3792/pja/1195519517openalex-snapshot
Countable structures for uncountable infinitary languages
inferred← citeshttps://doi.org/10.3792/pja/1195519721openalex-snapshot
A new theorem on definability in a positive second order logic with countable conjunctions and disjunctions
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.