Concatenation as a basis for arithmetic
From MaRDI portal
Publication:5845416
DOI10.2307/2268308zbMath0063.06362OpenAlexW2035476945MaRDI QIDQ5845416
Publication date: 1946
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2268308
Related Items (59)
Inception of Quine's ontology ⋮ MUTUAL INTERPRETABILITY OF WEAK ESSENTIALLY UNDECIDABLE THEORIES ⋮ The decision problem for some logics for finite words on infinite alphabets ⋮ On some algorithmic problems for groups and monoids ⋮ Undecidability of free pseudo-complemented semilattices ⋮ Unnamed Item ⋮ Languages with self-reference. II: Knowledge, belief, and modality ⋮ Undecidability of relatively free Hilbert algebras ⋮ Elementary functions and loop programs ⋮ CONSISTENCY AND THE THEORY OF TRUTH ⋮ Word equations in the context of string solving ⋮ The origins of combinatorics on words ⋮ Undecidability of the positive \(\forall\exists^ 3\)-theory of a free semigroup ⋮ Unnamed Item ⋮ Joining k- and l-recognizable sets of natural numbers ⋮ On the Axiom of Canonicity ⋮ A descriptive complexity approach to the linear hierarchy. ⋮ Algebraic and logical aspects of unification ⋮ Bases for structures and theories. I. ⋮ INTERLEAVING LOGIC AND COUNTING ⋮ Unnamed Item ⋮ The logical strength of compositional principles ⋮ Weak theories of concatenation and arithmetic ⋮ WORD EQUATIONS OVER GRAPH PRODUCTS ⋮ On ``simple undecidable fragments of the positive theory of a free semigroup ⋮ On arithmetical first-order theories allowing encoding and decoding of lists ⋮ First-order concatenation theory with bounded quantifiers ⋮ Unnamed Item ⋮ Language in action ⋮ Weak theories of concatenation and minimal essentially undecidable theories. An encounter of \(\mathsf{WTC}\) and \(\mathsf{S2S}\) ⋮ Chain-Free String Constraints ⋮ MUTUAL INTERPRETABILITY OF ROBINSON ARITHMETIC AND ADJUNCTIVE SET THEORY WITH EXTENSIONALITY ⋮ Weak cardinality theorems ⋮ Infinite trees and automaton-definable relations over \(\omega\)-words ⋮ AXIOMATIC TRUTH, SYNTAX AND METATHEORETIC REASONING ⋮ Arithmetische Prädikate über einem Bereich endlicher Automaten ⋮ Bi-interpretability of some monoids with the arithmetic and applications ⋮ A new method for undecidability proofs of first order theories ⋮ A list of arithmetical structures complete with respect to the first-order definability ⋮ The role of rudimentary relations in complexity theory ⋮ Set existence axioms for general (not necessarily countable) stability theory ⋮ Arithmetic on semigroups ⋮ On equations and first-order theory of one-relator monoids ⋮ Definability in the Infix Order on Words ⋮ Logic, semigroups and automata on words ⋮ The Reachability Problem over Infinite Graphs ⋮ A finitary metalanguage for extended basic logic ⋮ On the existence of a modal antinomy ⋮ A logic for document spanners ⋮ On generalization of definitional equivalence to non-disjoint languages ⋮ Undecidability of a simple fragment of a positive theory with a single constant for a free semigroup of rank two ⋮ A decision procedure for string to code point conversion ⋮ Classes of Predictably Computable Functions ⋮ The undecidability of the first-order theories of one step rewriting in linear canonical systems ⋮ Weak sequential theories of finite full binary trees ⋮ Tarski’s problem about the elementary theory of free groups has a positive solution ⋮ La théorie des fonctions récursives et ses applications. (Exposé d'information générale) ⋮ \(\forall \exists^{5}\)-equational theory of context unification is undecidable ⋮ Positive theories of free monoids
Cites Work
This page was built for publication: Concatenation as a basis for arithmetic
