Global inductive definability
DOI10.2307/2273529zbMATH Open0395.03021OpenAlexW1965372036MaRDI QIDQ4177549FDOQ4177549
Authors: Jon Barwise, Yiannis N. Moschovakis
Publication date: 1978
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2273529
Noetherian RingsPairing FunctionsBack-And-ForthClosure OrdinalsFinitely Generated SubstructuresInductive DefinabilityInfinitary Logics On Admissible SetsJacobson RadicalsKarp-Scott AnalysisMorley RankMorley-Shelah Ranks Of FormulasNilpotence IndicesOmitting TypesTwo-Sorted StructuresUltra-ProductsVerifiability Relations
Noetherian rings and modules (associative rings and algebras) (16P40) General logic (03B99) Model theory (03Cxx) Mathematical logic and foundations (03-XX)
Cites Work
Cited In (9)
- Interpolation and preservation for pebble logics
- Interpolation, preservation, and pebble games
- The role of the Omitting Types Theorem in infinitary logic
- 1998 European Summer Meeting of the Association for Symbolic Logic
- Descriptive characterizations of computational complexity
- \(\aleph_1\) and the modal \(\mu\)-calculus
- A Ramseyian theorem on products of trees
- A progression semantics for first-order logic programs
- Barwise: Infinitary Logic and Admissible Sets
This page was built for publication: Global inductive definability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4177549)