{"title":"具有后继整数的可定义性(约化)格","authors":"Alexei L. Semenov, S. Soprunov","doi":"10.1070/IM9107","DOIUrl":null,"url":null,"abstract":"In this paper the lattice of definability for integers with a successor (the relation ) is described. The lattice, whose elements are also knows as reducts, consists of three (naturally described) infinite series of relations. The proof uses a version of the Svenonius theorem for structures of special form.","PeriodicalId":54910,"journal":{"name":"Izvestiya Mathematics","volume":"85 1","pages":"1257 - 1269"},"PeriodicalIF":0.8000,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Lattice of definability (of reducts) for integers with successor\",\"authors\":\"Alexei L. Semenov, S. Soprunov\",\"doi\":\"10.1070/IM9107\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper the lattice of definability for integers with a successor (the relation ) is described. The lattice, whose elements are also knows as reducts, consists of three (naturally described) infinite series of relations. The proof uses a version of the Svenonius theorem for structures of special form.\",\"PeriodicalId\":54910,\"journal\":{\"name\":\"Izvestiya Mathematics\",\"volume\":\"85 1\",\"pages\":\"1257 - 1269\"},\"PeriodicalIF\":0.8000,\"publicationDate\":\"2021-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Izvestiya Mathematics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1070/IM9107\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Izvestiya Mathematics","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1070/IM9107","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
Lattice of definability (of reducts) for integers with successor
In this paper the lattice of definability for integers with a successor (the relation ) is described. The lattice, whose elements are also knows as reducts, consists of three (naturally described) infinite series of relations. The proof uses a version of the Svenonius theorem for structures of special form.
期刊介绍:
The Russian original is rigorously refereed in Russia and the translations are carefully scrutinised and edited by the London Mathematical Society. This publication covers all fields of mathematics, but special attention is given to:
Algebra;
Mathematical logic;
Number theory;
Mathematical analysis;
Geometry;
Topology;
Differential equations.