Decidable and undecidable fragments of first-order concatenation theory
From MaRDI portal
Publication:1670748
DOI10.1007/978-3-319-94418-0_25OpenAlexW2809760744MaRDI QIDQ1670748FDOQ1670748
Authors: Lars Kristiansen, Juvenal Murwanashyaka 
Publication date: 6 September 2018
Full work available at URL: https://arxiv.org/abs/1804.06367
Recommendations
- First-order concatenation theory with bounded quantifiers
- On undecidability of concatenation theory for one-symbol languages
- Undecidable fragments of elementary theories
- Complexity and (un)decidability of fragments of \(\langle \omega^{\omega^{\lambda}};\times\rangle\)
- First-order Frege theory is undecidable
Decidability of theories and sets of sentences (03B25) Basic properties of first-order languages and structures (03C07)
Cited In (12)
- Weak essentially undecidable theories of concatenation
- Definability in the Existential Theory of Concatenation and Undecidable Extensions of this Theory
- Title not available (Why is that?)
- On interpretability in the theory of concatenation
- Decidable fragments of field theories
- First-order Frege theory is undecidable
- Decidability properties for fragments of CHR
- On undecidability of concatenation theory for one-symbol languages
- Title not available (Why is that?)
- First-order concatenation theory with bounded quantifiers
- Combinations of Theories for Decidable Fragments of First-Order Logic
- Notes on Fragments of First-Order Concatenation Theory
This page was built for publication: Decidable and undecidable fragments of first-order concatenation theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1670748)
