Pages that link to "Item:Q5845416"
From MaRDI portal
The following pages link to Concatenation as a basis for arithmetic (Q5845416):
Displaying 44 items.
- Weak theories of concatenation and arithmetic (Q435240) (← links)
- Weak theories of concatenation and minimal essentially undecidable theories. An encounter of \(\mathsf{WTC}\) and \(\mathsf{S2S}\) (Q481870) (← links)
- Set existence axioms for general (not necessarily countable) stability theory (Q580327) (← links)
- The decision problem for some logics for finite words on infinite alphabets (Q843605) (← links)
- The origins of combinatorics on words (Q872058) (← links)
- Undecidability of free pseudo-complemented semilattices (Q1098833) (← links)
- Languages with self-reference. II: Knowledge, belief, and modality (Q1101099) (← links)
- Undecidability of relatively free Hilbert algebras (Q1103604) (← links)
- Language in action (Q1177646) (← links)
- Infinite trees and automaton-definable relations over \(\omega\)-words (Q1199531) (← links)
- A new method for undecidability proofs of first order theories (Q1209623) (← links)
- Positive theories of free monoids (Q1320694) (← links)
- A descriptive complexity approach to the linear hierarchy. (Q1401413) (← links)
- Undecidability of a simple fragment of a positive theory with a single constant for a free semigroup of rank two (Q1582961) (← links)
- \(\forall \exists^{5}\)-equational theory of context unification is undecidable (Q1607219) (← links)
- The logical strength of compositional principles (Q1704080) (← links)
- Logic, semigroups and automata on words (Q1817074) (← links)
- The undecidability of the first-order theories of one step rewriting in linear canonical systems (Q1854538) (← links)
- Elementary functions and loop programs (Q1903128) (← links)
- Undecidability of the positive \(\forall\exists^ 3\)-theory of a free semigroup (Q1921846) (← links)
- On arithmetical first-order theories allowing encoding and decoding of lists (Q1960537) (← links)
- Bi-interpretability of some monoids with the arithmetic and applications (Q2003186) (← links)
- On equations and first-order theory of one-relator monoids (Q2051781) (← links)
- A decision procedure for string to code point conversion (Q2096448) (← links)
- Weak sequential theories of finite full binary trees (Q2104270) (← links)
- Word equations in the context of string solving (Q2163975) (← links)
- Bases for structures and theories. I. (Q2198318) (← links)
- On ``simple'' undecidable fragments of the positive theory of a free semigroup (Q2211367) (← links)
- First-order concatenation theory with bounded quantifiers (Q2219089) (← links)
- A logic for document spanners (Q2322723) (← links)
- On generalization of definitional equivalence to non-disjoint languages (Q2323696) (← links)
- On the existence of a modal antinomy (Q2554687) (← links)
- Inception of Quine's ontology (Q3160444) (← links)
- CONSISTENCY AND THE THEORY OF TRUTH (Q3195585) (← links)
- Classes of Predictably Computable Functions (Q3293402) (← links)
- Chain-Free String Constraints (Q3297597) (← links)
- The role of rudimentary relations in complexity theory (Q3347299) (← links)
- The Reachability Problem over Infinite Graphs (Q3392937) (← links)
- MUTUAL INTERPRETABILITY OF ROBINSON ARITHMETIC AND ADJUNCTIVE SET THEORY WITH EXTENSIONALITY (Q4640303) (← links)
- MUTUAL INTERPRETABILITY OF WEAK ESSENTIALLY UNDECIDABLE THEORIES (Q5052004) (← links)
- La théorie des fonctions récursives et ses applications. (Exposé d'information générale) (Q5536266) (← links)
- Weak cardinality theorems (Q5718691) (← links)
- On the Axiom of Canonicity (Q6107281) (← links)
- INTERLEAVING LOGIC AND COUNTING (Q6199174) (← links)
