Concatenation as a basis for arithmetic
From MaRDI portal
Cites work
Cited in
(71)- Elementary functions and loop programs
- The undecidability of the first-order theories of one step rewriting in linear canonical systems
- Mutual interpretability of Robinson arithmetic and adjunctive set theory with extensionality
- Joining k- and l-recognizable sets of natural numbers
- On equations and first-order theory of one-relator monoids
- \(\forall \exists^{5}\)-equational theory of context unification is undecidable
- Infinite trees and automaton-definable relations over -words
- A new method for undecidability proofs of first order theories
- Definability in the Infix Order on Words
- scientific article; zbMATH DE number 7120897 (Why is no real title available?)
- A descriptive complexity approach to the linear hierarchy.
- On ``simple undecidable fragments of the positive theory of a free semigroup
- Undecidability of relatively free Hilbert algebras
- On the existence of a modal antinomy
- The role of rudimentary relations in complexity theory
- Bi-interpretability of some monoids with the arithmetic and applications
- On generalization of definitional equivalence to non-disjoint languages
- The decision problem for some logics for finite words on infinite alphabets
- Weak sequential theories of finite full binary trees
- Language in action
- A closer look at the expressive power of logics based on word equations
- Languages with self-reference. II: Knowledge, belief, and modality
- Weak cardinality theorems
- A weak theory of building blocks
- Weak theories of concatenation and arithmetic
- Quadratic word equations with length constraints, counter systems, and Presburger arithmetic with divisibility
- Positive theories of free monoids
- Classes of Predictably Computable Functions
- Set existence axioms for general (not necessarily countable) stability theory
- WORD EQUATIONS OVER GRAPH PRODUCTS
- Axiomatic truth, syntax and metatheoretic reasoning
- On arithmetical first-order theories allowing encoding and decoding of lists
- Defining recursive predicates in graph orders
- Quantifier-free induction for lists
- Experiential attitudes are propositional
- The origins of combinatorics on words
- Putnam's model-theoretic argument (meta)reconstructed. In the mirror of Carpintero's and van Douven's interpretations
- The theory of concatenation over finite models
- Arithmetische Prädikate über einem Bereich endlicher Automaten
- Word equations in the context of string solving
- The Reachability Problem over Infinite Graphs
- INTERLEAVING LOGIC AND COUNTING
- A logic for document spanners
- On the Axiom of Canonicity
- On some algorithmic problems for groups and monoids
- Inception of Quine's ontology
- MUTUAL INTERPRETABILITY OF WEAK ESSENTIALLY UNDECIDABLE THEORIES
- Algebraic and logical aspects of unification
- A finitary metalanguage for extended basic logic
- Weak theories of concatenation and minimal essentially undecidable theories. An encounter of \(\mathsf{WTC}\) and \(\mathsf{S2S}\)
- When bi-interpretability implies synonymy
- Undecidability of free pseudo-complemented semilattices
- Logic, semigroups and automata on words
- On the first order theory of plactic monoids
- Undecidable fragments of positive theories of free semigroups
- scientific article; zbMATH DE number 3251412 (Why is no real title available?)
- La théorie des fonctions récursives et ses applications. (Exposé d'information générale)
- Satisfiability of context-free string constraints with subword-ordering and transducers
- The logical strength of compositional principles
- Chain-free string constraints
- Bases for structures and theories. I.
- Tarski’s problem about the elementary theory of free groups has a positive solution
- A list of arithmetical structures complete with respect to the first-order definability
- Mathematical Foundations of Computer Science 2004
- First-order concatenation theory with bounded quantifiers
- Undecidability of a simple fragment of a positive theory with a single constant for a free semigroup of rank two
- Consistency and the theory of truth
- A decision procedure for string to code point conversion
- First steps towards taming description logics with strings
- Arithmetic on semigroups
- Undecidability of the positive \(\forall\exists^ 3\)-theory of a free semigroup
This page was built for publication: Concatenation as a basis for arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5845416)
