Degrees of types and independent sequences

DOI10.2307/2273670zbMATH Open0541.03015OpenAlexW2038972143MaRDI QIDQ3328526FDOQ3328526

Authors: J. F. Knight 

Publication date: 1983

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2273670

Recommendations

• Two theorems on the existence of indiscernible sequences
• Independence results for uncountable superstable theories
• Post-scriptum à “Théories instables”
• Strongly dependent theories
• A dependent theory with few indiscernibles

zbMATH Keywords

recursive saturationcountable theoriescomplete theoriescomplete typesindependent sequence of formulas

Mathematics Subject Classification ID

Other model constructions (03C30) Models with special properties (saturated, rigid, etc.) (03C50) Other degrees and reducibilities in computability and recursion theory (03D30)

Cited In (6)

• Two theorems on the existence of indiscernible sequences
• Members of countable \(\Pi ^ 0_ 1\) classes
• Computing the number of types of infinite length
• Degree-theoretic bounds on the morley rank
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Degrees of types and independent sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3328526)