Definability and decidability issues in extensions of the integers with the divisibility predicate (Q4894724): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q56896689, #quickstatements; #temporary_batch_1711055989931 |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Definability and decision problems in arithmetic / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Answer to a problem raised by J. Robinson: The arithmetic of positive or negative integers is definable from successor and divisibility / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A uniform method for proving lower bounds on the computational complexity of logical theories / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Recognition and parsing of context-free languages in time n3 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: All arithmetical sets of powers of primes are first-order definable in terms of the successor function and the coprimeness predicate / rank | |||
Normal rank |
Latest revision as of 13:41, 24 May 2024
scientific article; zbMATH DE number 932349
Language | Label | Description | Also known as |
---|---|---|---|
English | Definability and decidability issues in extensions of the integers with the divisibility predicate |
scientific article; zbMATH DE number 932349 |
Statements
Definability and decidability issues in extensions of the integers with the divisibility predicate (English)
0 references
24 November 1996
0 references
divisibility predicate
0 references
positive integers
0 references
definability
0 references
divisibility relation
0 references
0 references