Axiomatising tree-interpretable structures

DOI10.1007/S00224-003-1104-8zbMath1070.03017OpenAlexW2001017256MaRDI QIDQ705058

Achim Blumensath

Publication date: 25 January 2005

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-003-1104-8

zbMATH Keywords

monadic second-order logicdecidabilitymodel-checkingdefinabilityrelational structurescardinality quantifiersguarded logicalgorithmic properties of infinite structuresfinitely axiomatizable

Mathematics Subject Classification ID

Logic in computer science (03B70) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60) Logic with extra quantifiers and operators (03C80) Second- and higher-order model theory (03C85)

Related Items (2)

Simple monadic theories and partition width ⋮ Automatic presentations and semigroup constructions

This page was built for publication: Axiomatising tree-interpretable structures