Hostname: page-component-7b7567c8c-9cwtv Total loading time: 0 Render date: 2026-11-19T08:27:13.249Z Has data issue: false hasContentIssue false

FROM A1 TO D5: TOWARDS A FORCING-RELATEDCLASSIFICATION OF RELATIONAL STRUCTURES

Published online by Cambridge University Press:  17 April 2014

MILOŠ S. KURILIĆ*
Affiliation:
DEPARTMENT OF MATHEMATICS AND INFORMATICS, UNIVERSITY OF NOVI SAD TRG DOSITEJA OBRADOVIĆA 4, 21000 NOVI SAD, SERBIA. E-mail: milos@dmi.uns.ac.rs
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We investigate the partial orderings of the form P(X),⊂〉,where X is a relational structure and P(X) the set of the domains of itsisomorphic substructures. A rough classification of countable binary structurescorresponding to the forcing-related properties of the posets of their copies isobtained.

Information

Type
Articles
Copyright
Copyright © Association for Symbolic Logic 2014