Abstract
Two hereditary classes of matroids – the class of matroids of rank doesn’t exceeding a fixed positive integer k and the class of matroids of finite rank – are studied by means of the model theory. The problems of axiomatizability of these two classes of matroids as structures and the problems of algorithmic decidability of universal theories of these classes are considered. It is shown that the first class is finitely axiomatizable whereas the second one is nonaxiomatizable. Decidability of the universal theories of the both classes is proved.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
