MoL201204: Staudt, Daan (2012) Completeness for Two LeftSequential Logics. [Report]

Text (Full Text)
MoL201204.text.pdf Download (516kB)  Preview 

Text (Abstract)
MoL201204.abstract.txt Download (1kB) 
Abstract
Leftsequential logics provide a means for reasoning about (closed) propositional terms with atomic propositions that may have side effects and that are evaluated sequentially from left to right. Such propositional terms are commonly used in programming languages to direct the flow of a program. In this thesis we explore two such leftsequential logics. First we discuss Fully Evaluated LeftSequential Logic, which employs a full evaluation strategy, i.e., to evaluate a term every one of its atomic propositions is evaluated causing its possible side effects to occur. We then turn to ShortCircuit (LeftSequential) Logic as presented in [BP10b], where the evaluation may be 'shortcircuited', thus preventing some, if not all, of the atomic propositions in a term being evaluated. We propose evaluation trees as a natural semantics for both logics and provide axiomatizations for the least identifying variant of each. From this, we deﬁne a logic with connectives that prescribe a full evaluation strategy as well as connectives that prescribe a shortcircuit evaluation strategy.
Item Type:  Report 

Report Nr:  MoL201204 
Series Name:  Master of Logic Thesis (MoL) Series 
Year:  2012 
Date Deposited:  12 Oct 2016 14:38 
Last Modified:  12 Oct 2016 14:38 
URI:  https://eprints.illc.uva.nl/id/eprint/870 
Actions (login required)
View Item 