Presburger arithmetic and recognizability of sets of natural numbers by automata: New proofs of Cobham's and Semenov's theorems (Q1919534): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: DBLP publication ID (P1635): journals/apal/MichauxV96, #quickstatements; #temporary_batch_1731483406851
 
(7 intermediate revisions by 6 users not shown)
Property / author
 
Property / author: Roger Villemaire / rank
Normal rank
 
Property / author
 
Property / author: Roger Villemaire / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q56059272 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0168-0072(95)00022-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2092583023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3673137 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic and \(p\)-recognizable sets of integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak Second‐Order Arithmetic and Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the base-dependence of sets of numbers recognizable by finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4052071 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5772619 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3312199 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4722056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3837737 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The definable criterion for definability in Presburger arithmetic and its applications. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4103466 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3764203 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Presburgerness of predicates regular in two number systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON CERTAIN EXTENSIONS OF THE ARITHMETIC OF ADDITION OF NATURAL NUMBERS / rank
 
Normal rank
Property / cites work
 
Property / cites work: The theory of \(\langle \mathbb{N} , +, V_ k, V_ l\rangle\) is undecidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Joining k- and l-recognizable sets of natural numbers / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/apal/MichauxV96 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:59, 13 November 2024

scientific article
Language Label Description Also known as
English
Presburger arithmetic and recognizability of sets of natural numbers by automata: New proofs of Cobham's and Semenov's theorems
scientific article

    Statements

    Presburger arithmetic and recognizability of sets of natural numbers by automata: New proofs of Cobham's and Semenov's theorems (English)
    0 references
    0 references
    0 references
    11 March 1997
    0 references
    Presburger arithmetic
    0 references
    Cobham's theorem
    0 references
    Semenov's theorem
    0 references
    definability
    0 references
    recognizability by automata
    0 references

    Identifiers