Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Blumensath, Achim - Fachbereich Mathematik, Technische Universität Darmstadt
AN ALGEBRAIC PROOF OF RABIN'S TREE THEOREM
Boundedness of monadic second-order formulae over finite words
Research Rsum My research interest is model theory for monadic second-order logic. In particular, I consider
RECOGNISABILITY FOR ALGEBRAS OF INFINITE TREES
SIMPLE MONADIC THEORIES AND PARTITION WIDTH
LOCALITY AND MODULAR EHRENFEUCHT-FRASS GAMES
RECOGNIZABILITY, HYPERGRAPH OPERATIONS,
Finite Presentations of Infinite Structures: Automata and Interpretations
Achim Blumensath Partition Width
Bounded Arithmetic and Descriptive Complexity Achim Blumensath
Automatic Structures Achim Blumensath and Erich Grdel
Achim Blumensath blumensath@mathematik.tu-darmstadt.de
Axiomatising Tree-interpretable Structures Achim Blumensath
Achim Blumensath blumensath@mathematik.tu-darmstadt.de
Achim Blumensath blumensath@mathematik.tu-darmstadt.de
GUARDED SECOND-ORDER LOGIC, SPANNING TREES, AND NETWORK
SIMPLE MONADIC THEORIES VOM FACHBEREICH MATHEMATIK DER
Axiomatising tree-interpretable structures Achim Blumensath
Department of Computer Science Technical Report
Achim Blumensath blumensath@mathematik.tu-darmstadt.de
Achim Blumensath blumensath@mathematik.tu-darmstadt.de
Department of Computer Science Technical Report
Finite Presentations of Infinite Structures: Automata and Interpretations
ON THE MONADIC SECOND-ORDER TRANSDUCTION HIERARCHY
SIMPLE MONADIC THEORIES AND INDISCERNIBLES
Achim Blumensath blumensath@mathematik.tu-darmstadt.de
Achim Blumensath blumensath@mathematik.tu-darmstadt.de
Achim Blumensath blumensath@mathematik.tu-darmstadt.de
