On colimits and elementary embeddings
classification
🧮 math.LO
math.CT
keywords
cardinalselementaryembeddingsrosickytheoremadamekalpha-stronglyarguments
read the original abstract
We give a sharper version of a theorem of Rosicky, Trnkova and Adamek, and a new proof of a theorem of Rosicky, both about colimit preservation between categories of structures. Unlike the original proofs, which use category-theoretic methods, we use set-theoretic arguments involving elementary embeddings given by large cardinals such as alpha-strongly compact and C^(n)-extendible cardinals.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.