Decidability and complexity of tree share formulas

DOI10.4230/LIPICS.FSTTCS.2016.19MaRDI QIDQ4636566zbMATH OpenOpenAlexFDO

Authors Xuan-Bach Le, Aquinas Hobor, Anthony Widjaja Lin

Publication date 19 April 2018

Full work available at URL http://dblp.uni-trier.de/db/conf/fsttcs/fsttcs2016.html#LeHL16

zbMATH Keywords

countable atomless Boolean algebrasfractional share modelsresource accountingtree automatic structuresword equations

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Logic in computer science (03B70) Computable structure theory, computable model theory (03C57) Automata and formal grammars in connection with logical questions (03D05) Logical aspects of Boolean algebras (03G05) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Complexity analysis of tree share structure
• Complexity of two-variable logic on finite trees
• Complexity of two-variable logic on finite trees
• On the computational complexity of the theory of complete binary trees
• A decidable logic for tree data-structures with measurements

Cited in

(1)

• Complexity analysis of tree share structure

This page was built for publication: Decidability and complexity of tree share formulas

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