Lattice of definability (of reducts) for integers with successor

IF 0.8 3区数学 Q2 MATHEMATICS

Izvestiya Mathematics Pub Date : 2021-01-01 DOI:10.1070/IM9107

Alexei L. Semenov, S. Soprunov

引用次数: 1

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.

查看原文本刊更多论文

具有后继整数的可定义性(约化)格

本文描述了带后继整数(关系)的可定义格。格，其元素也被称为约化，由三个(自然描述的)无穷级数的关系组成。这个证明使用了Svenonius定理的一个版本来证明特殊形式的结构。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Izvestiya Mathematics 数学-数学

CiteScore

1.30

自引率

0.00%

发文量

审稿时长

6-12 weeks

期刊介绍： 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.