First-order concatenation theory with bounded quantifiers (Q2219089): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W3028542372 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 2003.04964 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coding in the existential theory of concatenation / rank
 
Normal rank
Property / cites work
 
Property / cites work: String theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The satisfiability of word equations: decidable and undecidable theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidability without arithmetization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3509164 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5286672 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5144688 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5771775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak theories of concatenation and minimal essentially undecidable theories. An encounter of \(\mathsf{WTC}\) and \(\mathsf{S2S}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak theories of concatenation and arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: The expressibility of languages and relations by word equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidable and undecidable fragments of first-order concatenation theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Undecidability of the Generalized Collatz Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE PROBLEM OF SOLVABILITY OF EQUATIONS IN A FREE SEMIGROUP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive unsolvability of Post's problem of ''Tag'' und other topics in theory of Turing machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variant of a recursively unsolvable problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concatenation as a basis for arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: On interpretability in the theory of concatenation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5761282 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Growing commas. A study of sequentiality and concatenation / rank
 
Normal rank

Revision as of 08:16, 24 July 2024

scientific article
Language Label Description Also known as
English
First-order concatenation theory with bounded quantifiers
scientific article

    Statements

    First-order concatenation theory with bounded quantifiers (English)
    0 references
    0 references
    0 references
    19 January 2021
    0 references
    weak first-order theories
    0 references
    concatenation theory
    0 references
    bounded quantifiers
    0 references
    decidability
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references