Adjunct elimination in context logic for trees

DOI10.1016/j.ic.2009.02.013zbMath1200.68224OpenAlexW2161948124MaRDI QIDQ964499

Thomas Dinsdale-Young, Philippa Gardner, Cristiano Calcagno

Publication date: 22 April 2010

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10044/1/33266

zbMATH Keywords

Ehrenfeucht-Fraïssé gamesadjunct eliminationcontext logic

Mathematics Subject Classification ID

Other nonclassical logic (03B60) Logic in artificial intelligence (68T27)

Related Items (5)

On Composing Finite Forests with Modal Logics ⋮ An algebraic glimpse at bunched implications and separation logic ⋮ An auxiliary logic on trees: on the tower-hardness of logics featuring reachability and submodel reasoning ⋮ An auxiliary logic on trees: on the tower-hardness of logics featuring reachability and submodel reasoning ⋮ On Model Checking Boolean BI

Cites Work

• Unnamed Item
• Unnamed Item
• Context logic as modal logic
• Adjunct Elimination in Context Logic for Trees
• Forest Expressions
• First-order properties of trees, star-free expressions, and aperiodicity
• The Logic of Bunched Implications
• Anytime, anywhere
• BI as an assertion language for mutable data structures
• Context logic and tree update
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science

This page was built for publication: Adjunct elimination in context logic for trees