scientific article; zbMATH DE number 3557788

zbMATH Open0358.02066MaRDI QIDQ4133634FDOQ4133634

Authors: Jean-Luc Paillet 

Publication date: 1976

Title of this publication is not available (Why is that?)

Recommendations

• The complexity of isomorphism for complete theories of linear orders with unary predicates
• scientific article; zbMATH DE number 3884139
• Binary relational structures having only countably many nonisomorphic substructures
• scientific article; zbMATH DE number 4029520
• scientific article; zbMATH DE number 4195916
• Primitively recursively categorical linear orderings
• scientific article; zbMATH DE number 663783
• Countably categorical coloured linear orders
• Complete Theories with Finitely Many Countable Models. I
• Minimal accessible categories

Mathematics Subject Classification ID

Categoricity and completeness of theories (03C35) Other classical first-order model theory (03C68)

Cited In (2)

• HOMOGENEITY AND FIX-POINTS: GOING FORTH!
• Classifying \(\aleph_ 0\)-categorical theories

This page was built for publication:

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