Foundations of Software Science and Computation Structures

DOI10.1007/11690634zbMATH Open1138.03032OpenAlexW2504714231MaRDI QIDQ5899097FDOQ5899097

Authors: Dietrich Kuske, Markus Lohrey 

Publication date: 2 May 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11690634

Recommendations

• First-order and counting theories ofω-automatic structures
• Automatic structures of bounded degree revisited
• Theories of Automatic Structures and Their Complexity
• Cardinality and counting quantifiers on omega-automatic structures
• Automatic structures of bounded degree

Mathematics Subject Classification ID

Logic with extra quantifiers and operators (03C80) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25)

Cited In (8)

• Second-order finite automata: expressive power and simple proofs using automatic structures
• Cardinality Quantifiers in MLO over Trees
• First-order and counting theories ofω-automatic structures
• Cardinality and counting quantifiers on omega-automatic structures
• Model-theoretic properties of \(\omega\)-automatic structures
• Theories of Automatic Structures and Their Complexity
• Title not available (Why is that?)
• Ehrenfeucht-Fraïssé goes elementarily automatic for structures of bounded degree

This page was built for publication: Foundations of Software Science and Computation Structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5899097)