Axiomatising tree-interpretable structures

DOI10.1007/S00224-003-1104-8zbMATH Open1070.03017OpenAlexW2001017256MaRDI QIDQ705058FDOQ705058

Authors: 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

Recommendations

• 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

zbMATH Keywords

decidabilitymonadic second-order logicdefinabilitymodel-checkingcardinality quantifiersrelational structuresguarded logicalgorithmic properties of infinite structuresfinitely axiomatizable

Mathematics Subject Classification ID

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

Cited In (5)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Axiomatising extended computation tree logic
• Simple monadic theories and partition width
• Automatic presentations and semigroup constructions

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)