Program Semantics and Classical Logic

In the tradition of Denotational Semantics one usually lets program constructs take their denotations in reflexive domains, i.e. in domains where self-application is possible. For the bulk of programming constructs, however, working with reflexive domains is an unnecessary complication. In this paper we shall use the domains of ordinary classical type logic to provide the semantics of a simple programming language containing choice and recursion. We prove that the rule of {\em Scott Induction\/} holds in this new setting, prove soundness of a Hoare calculus relative to our semantics, give a direct calculus ${\cal C}$ on programs, and prove that the denotation of any program $P$ in our semantics is equal to the union of the denotations of all those programs $L$ such that $P$ follows from $L$ in our calculus and $L$ does not contain recursion or choice

2. Wochenbericht SO201/1b

SO201 Leg 1b KALMAR Wochenbericht Nr. 2 (18.06. – 24.06.2009

2. Wochenbericht SO225

SO225 MANIHIKI II Wochenbericht Nr. 2 (26.11. – 02.12.2012

Anaphora and the Logic of Change

This paper shows how the dynamic interpretation of natural language introduced in work by Hans Kamp and Irene Heim can be modeled in classical type logic. This provides a synthesis between Richard Montague's theory of natural language semantics and the work by Kamp and Heim

Top Cross-Sections and Single Top

This paper summarizes top quark cross-section measurements at the Tevatron and the LHC. Top quark pair production cross-sections have been measured in all decay modes by the ATLAS and CMS collaborations at the LHC and by the CDF and D0 collaborations at the Tevatron. Single top quark production has been observed at both the Tevatron and the LHC. The t-channel and associated Wt production modes have been observed at the LHC and evidence for s-channel production has been reported by the Tevatron collaborations.Comment: Proceedings for PIC 201