Adjunct elimination in Context Logic for trees
File(s)Calcagno2010Adjunct.pdf (420.87 KB)
Accepted version
Author(s)
Calcagno, C
Dinsdale-Young, T
Gardner, P
Type
Conference Paper
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.
Date Issued
2009-12-05
Date Acceptance
2009-02-18
Citation
Information and Computation, 2009, 208 (5), pp.474-499
ISSN
1090-2651
Publisher
Elsevier
Start Page
474
End Page
499
Journal / Book Title
Information and Computation
Volume
208
Issue
5
Copyright Statement
© 2009 Elsevier Inc. All rights reserved. Licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International http://creativecommons.org/licenses/by-nc-nd/4.0/
Identifier
http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000276120600006&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=1ba7043ffcc86c417c072aa74d649202
Source
14th International Workshop on Logic, Language, Information and Computation
Subjects
Science & Technology
Technology
Physical Sciences
Computer Science, Theory & Methods
Mathematics, Applied
Computer Science
Mathematics
COMPUTER SCIENCE, THEORY & METHODS
MATHEMATICS, APPLIED
Context Logic
Adjunct elimination
Ehrenfeucht-Fraisse games
EXPRESSIONS
Computation Theory & Mathematics
08 Information And Computing Sciences
Publication Status
Published
Start Date
2007-07-02
Finish Date
2007-07-05
Coverage Spatial
Rio de Janeiro, BRAZIL