ON CERTAIN EXTENSIONS OF THE ARITHMETIC OF ADDITION OF NATURAL NUMBERS

DOI10.1070/IM1980v015n02ABEH001252zbMath0443.03008OpenAlexW2072057555MaRDI QIDQ3885739

A. L. Semenov

Publication date: 1980

Published in: Mathematics of the USSR-Izvestiya (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1070/im1980v015n02abeh001252

zbMATH Keywords

definabilityalmost periodic system of predicatesfragment of elementary number theory

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) First-order arithmetic and fragments (03F30) Subsystems of classical logic (including intuitionistic logic) (03B20)

Related Items (9)

Almost periodicity, finite automata mappings, and related effectiveness issues ⋮ Presburger arithmetic and recognizability of sets of natural numbers by automata: New proofs of Cobham's and Semenov's theorems ⋮ Joining k- and l-recognizable sets of natural numbers ⋮ The lattice of definability: origins, recent developments, and further directions ⋮ Cobham's Theorem seen through Büchi's Theorem ⋮ The theory of \(\langle \mathbb{N} , +, V_ k, V_ l\rangle\) is undecidable ⋮ A list of arithmetical structures complete with respect to the first-order definability ⋮ Logic, semigroups and automata on words ⋮ Automata techniques for query inference machines

This page was built for publication: ON CERTAIN EXTENSIONS OF THE ARITHMETIC OF ADDITION OF NATURAL NUMBERS