Paper Info
Title
A list of arithmetical structures complete with respect to the first-order definability
Abstract
A structure with base set N is complete with respect to the first-order definability in the class of arithmetical structures if and only if the operations +,× are definable in it. A list of such structures is presented. Although structures with Pascal's triangles modulo n are preferred a little, an effort was made to collect as many simply formulated results as possible.
Year
DOI
Venue
2001
10.1016/S0304-3975(00)00113-4
Theor. Comput. Sci.
Keywords
DocType
Volume
Pascal's triangle modulo n,secondary 11B65,first-order definability,03C07,Elementary definability,Arithmetical structures,11U07,primary 03B10,arithmetical structure,Undecidable theories
Journal
257
Issue
ISSN
Citations 
1-2
Theoretical Computer Science
4
PageRank 
References 
Authors
0.70
0
1
Name
Order
Citations
PageRank
Ivan Korec19821.18