An Application of the Feferman-Vaught Theorem to Automata and Logics for Words over an Infinite Alphabet (Q3518274)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5308837
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An Application of the Feferman-Vaught Theorem to Automata and Logics for Words over an Infinite Alphabet |
scientific article; zbMATH DE number 5308837 |
Statements
An Application of the Feferman-Vaught Theorem to Automata and Logics for Words over an Infinite Alphabet (English)
0 references
7 August 2008
0 references
first-order logic
0 references
monadic second-order logic
0 references
logical structure
0 references
finite automaton
0 references
infinite alphabet
0 references
definability in logic
0 references
recognizability by automaton
0 references
decidability
0 references
relationship between definability and recognizability
0 references
Feferman-Vaught method
0 references
composition theorem
0 references
0.7597427368164062
0 references
0.7536420822143555
0 references
0.7448724508285522
0 references
0.7331113815307617
0 references
