A calculus of substitutions for DPL

Studia Logica 68 (3):357-387 (2001)
We consider substitutions in order sensitive situations, having in the back of our minds the case of dynamic predicate logic (DPL) with a stack semantics. We start from the semantic intuition that substitutions are move instructions on stacks: the syntactic operation [y/x] is matched by the instruction to move the value of the y-stack to the x-stack. We can describe these actions in the positive fragment of DPLE. Hence this fragment counts as a logic for DPL-substitutions. We give a calculus for the fragment and prove soundness and completeness.
Keywords Philosophy   Logic   Mathematical Logic and Foundations   Computational Linguistics
Categories (categorize this paper)
Reprint years 2004
DOI 10.1023/A:1012439021359
 Save to my reading list
Follow the author(s)
Edit this record
My bibliography
Export citation
Find it on Scholar
Mark as duplicate
Request removal from index
Revision history
Download options
Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 30,224
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles
Added to PP index

Total downloads
18 ( #277,521 of 2,192,041 )

Recent downloads (6 months)
6 ( #33,506 of 2,192,041 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature