Abstract
For countable languages, we completely describe those cardinals κ such that there is an equational theory which covers exactly κ other equational theories. For this task understanding term finite theories is helpful. A theoryT isterm finite provided {ψ:Tτϕ≈ψ} is finite for all terms ϕ. We develop here some fundamental properties of term finite theories and use them, together with Ramsey's Theorem, to prove that any finitely based term finite theory covers only finitely many others. We also show that every term finite theory possesses an independent base and that there are\(2^{\kappa _0 } \) such theories whose pairwise joins are not term finite.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.