The decision problem for some logics for finite words on infinite alphabets
type: Item
instance of: scholarly article
title: The decision problem for some logics for finite words on infinite alphabets
zbMATH Open document ID: 1179.03017
author: Serge Grigorieff
author: Christian Choffrut
published in: Journal of Mathematical Sciences (New York)
publication date: 2010-01-15T00:00:00Z
Mathematics Subject Classification ID: 03B25
Mathematics Subject Classification ID: 03D05
zbMATH DE Number: 5659081
MaRDI profile type: Publication
full work available at URL: s10958-009-9407-1
OpenAlex ID: W1963525214
cites work: Definable relations and first-order query languages over strings
cites work: Model theory
cites work: Finite \(n\)-tape automata over possibly infinite alphabets: Extending a theorem of Eilenberg et al.
cites work: Model Checking Freeze LTL over One-Counter Automata
cites work: Undecidability of the positive \(\forall\exists^ 3\)-theory of a free semigroup
cites work: Sets recognized by n-tape automata
cites work: Decision problems for semi-Thue systems with a few rules
cites work: Q4779173
cites work: A course in model theory. An introduction to contemporary mathematical logic. Transl. from the French by Moses Klein
cites work: Concatenation as a basis for arithmetic
cites work: Decision problems for multiple successor arithmetics
cites work: Q3926793
DOI: 10.1007/S10958-009-9407-1
description: scientific article; zbMATH DE number 5659081