Global inductive definability
From MaRDI portal
Back-And-ForthClosure OrdinalsFinitely Generated SubstructuresInductive DefinabilityInfinitary Logics On Admissible SetsJacobson RadicalsKarp-Scott AnalysisMorley RankMorley-Shelah Ranks Of FormulasNilpotence IndicesNoetherian RingsOmitting TypesPairing FunctionsTwo-Sorted StructuresUltra-ProductsVerifiability Relations
Cites work
Cited in
(9)- Descriptive characterizations of computational complexity
- A Ramseyian theorem on products of trees
- A progression semantics for first-order logic programs
- The role of the Omitting Types Theorem in infinitary logic
- 1998 European Summer Meeting of the Association for Symbolic Logic
- Interpolation and preservation for pebble logics
- Interpolation, preservation, and pebble games
- Barwise: Infinitary Logic and Admissible Sets
- _1 and the modal -calculus
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)