Axiomatising tree-interpretable structures
This paper is a new contribution to the study of the algorithmic properties of infinite structures. The topic is motivated by several problems in various areas of computer science. The author extends the notion of a prefix-recognizable graph to general relational structures by introducing tree-interpretable structures. The main result is that any tree-interpretable structure is finitely axiomatizable in guarded second-order logic with cardinality quantifiers, but also several other results are obtained. Moreover, the author poses some open problems.
- scientific article; zbMATH DE number 2086419
- Axiomatising extended computation tree logic
- Axiomatising extended computation tree logic
- An axiomatization of full computation tree logic
- Lifted inference with tree axioms
- scientific article; zbMATH DE number 475422
- Axiomatizing proof tree concepts in bounded arithmetic
- Applying tree languages in proof theory
- scientific article; zbMATH DE number 475414
This page was built for publication: Axiomatising tree-interpretable structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q705058)