Arrow Research search
Back to I&C

I&C 2010

Adjunct elimination in Context Logic for trees

Journal Article journal-article Computer Science · Theoretical Computer Science

Abstract

We study adjunct-elimination results for Context Logic applied to trees, following previous results by Lozes for Separation Logic and Ambient Logic. In fact, it is not possible to prove such elimination results for the original single-holed formulation of Context Logic. Instead, we prove our results for multi-holed Context Logic.

Authors

Keywords

  • Context Logic
  • Adjunct elimination
  • Ehrenfeucht–Fraïssé games

Context

Venue
Information and Computation
Archive span
1987-2026
Indexed papers
3021
Paper id
327673526053495446
v2026.09.13