From A1 to D5: Towards a Forcing-Related Classification of Relational Structures
classification
🧮 math.LO
keywords
classificationforcing-relatedrelationalstructuresbinarycopiescorrespondingcountable
read the original abstract
We investigate the partial orderings of the form (P(X),\subset), where X is a relational structure and P(X) the set of the domains of its isomorphic substructures. A rough classification of countable binary structures corresponding to the forcing-related properties of the posets of their copies is obtained.
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.