On the unity of logic

AbstractNous présentons un calcul des séquents unifié, commun aux logiques classique, intuitionniste et linéaire. La principale nouveautéest que les logiques classique, intuitionniste et linéaire apparaissent comme des fragments, c'estádire comme des classes particuliéres de formules et de séquents. Par exemple la démonstration d'unénoncéintuitionniste pourra utiliser des lemmes classiques ou intuitionnistes sans limitation: simplement aprèsélimination des coupures, la démonstration se fera entièrement dans le fragment intuitionniste, ce qui est superficiellement assurépar la propriétéde la sous-formule (seulement des formules intuitionnistes sont utilisées) et plus profondément par un traitement très rigoureux des règles structurelles. Cette approche est radicalement différente de l'approche habituelle qui consiste tout bonnementàchanger la règle du jeu quand on veut changer de logique, c'estàdire de style de séquent: ici il n'y a plus qu'une seule logique, qui au grédes utilisation peut apparaître classique, intuitionniste ou linéaire

Dynamic UNITY

Dynamic distributed systems, where a changing set of communicating processes must interoperate to accomplish particular computational tasks, are becoming extremely important. Designing and implementing these systems, and verifying the correctness of the designs and implementations, are difficult tasks. The goal of this thesis is to make these tasks easier. This thesis presents a specification language for dynamic distributed systems, based on Chandy and Misra's UNITY language. It extends the UNITY language to enable process creation, process deletion, and dynamic communication patterns. The thesis defines an execution model for systems specified in this language, which leads to a proof logic similar to that of UNITY. While extending UNITY logic to correctly handle systems with dynamic behavior, this logic retains the familiar UNITY operators and most of the proof rules associated with them. The thesis presents specifications for three example dynamic distributed systems to demonstrate the use of the specification language, and full correctness proofs for two of these systems and a partial correctness proof for the third to demonstrate the use of the proof logic. The thesis details a method for determining whether a system in the specification language can be transformed into an implementation in a standard programming language, as well as a method for performing this transformation on those specifications that can. This guarantees a correct implementation for any specification that can be so transformed

UNITY and Büchi automata

UNITY is a model for concurrent specifications with a complete logic for proving progress properties of the form ``$P$ leads to $Q$''. UNITY is generalized to U-specifications by giving more freedom to specify the steps that are to be taken infinitely often. In particular, these steps can correspond to non-total relations. The generalization keeps the logic sound and complete. The paper exploits the generalization in two ways. Firstly, the logic remains sound when the specification is extended with hypotheses of the form ``$F$ leads to $G$''. As the paper shows, this can make the logic incomplete. The generalization is used to show that the logic remains complete, if the added hypotheses ``$F$ leads to $G$'' satisfy ``$F$ unless $G$''. The main result extends the applicability and completeness of UNITY logic to proofs that a given concurrent program satisfies any given formula of LTL, linear temporal logic, without the next-operator which is omitted because it is sensitive to stuttering. For this purpose, the program, written as a UNITY program, is extended with a number of boolean variables. The proof method relies on implementing the LTL formula, i.e., restricting the specification in such a way that only those runs remain that satisfy the formula. This result is a variation of the classical construction of a B\"uchi automaton for a given LTL formula that accepts precisely those runs that satisfy the formula

Call-by-name, call-by-value, call-by-need and the linear lambda calculus

this paper is a minor refinement of one previously presented by Wadler [41,42], which is based on Girard's successor to linear logic, the Logic of Unity [15]. A similar calculus has been devised by Plotkin and Barber [6]. In many presentations of logic a key role is played by the structural rules: contraction provides the only way to duplicate an assumption, while weakening provides the only way to discard one. In linear logic [14], the presence of contraction or weakening is revealed in a formula by the presence of the `of course' connective, written `!'. The Logic of Unity [15] takes this separation one step further by distinguishing linear assumptions, which one cannot contract or weaken, from nonlinear or intuitionistic assumptions, which one can. Corresponding to Girard's first translation we define a mapping ffi from the call-byname to the linear calculus and show that this mapping is sound, in that M \Gamma\Gamma\Gamma\Gamma

Streamlining Progress-Based Derivations of Concurrent Programs

The logic of Owicki and Gries is a well known logic for verifying safety properties of concurrent programs. Using this logic, Feijen and van Gasteren describe a method for deriving concurrent programs based on safety. In this work, we explore derivation techniques of concurrent programs using progress-based reasoning. We use a framework that combines the safety logic of Owicki and Gries, and the progress logic of UNITY. Our contributions improve the applicability of our earlier techniques by reducing the calculational overhead in the formal proofs and derivations. To demonstrate the effectiveness of our techniques, a derivation of Dekker's mutual exclusion algorithm is presented. This derivation leads to the discovery of some new and simpler variations of this famous algorithm

The Informal Logic of Mathematical Proof

Informal logic is a method of argument analysis which is complementary to that of formal logic, providing for the pragmatic treatment of features of argumentation which cannot be reduced to logical form. The central claim of this paper is that a more nuanced understanding of mathematical proof and discovery may be achieved by paying attention to the aspects of mathematical argumentation which can be captured by informal, rather than formal, logic. Two accounts of argumentation are considered: the pioneering work of Stephen Toulmin [The uses of argument, Cambridge University Press, 1958] and the more recent studies of Douglas Walton, [e.g. The new dialectic: Conversational contexts of argument, University of Toronto Press, 1998]. The focus of both of these approaches has largely been restricted to natural language argumentation. However, Walton's method in particular provides a fruitful analysis of mathematical proof. He offers a contextual account of argumentational strategies, distinguishing a variety of different types of dialogue in which arguments may occur. This analysis represents many different fallacious or otherwise illicit arguments as the deployment of strategies which are sometimes admissible in contexts in which they are inadmissible. I argue that mathematical proofs are deployed in a greater variety of types of dialogue than has commonly been assumed. I proceed to show that many of the important philosophical and pedagogical problems of mathematical proof arise from a failure to make explicit the type of dialogue in which the proof is introduced.Comment: 14 pages, 1 figure, 3 tables. Forthcoming in Perspectives on Mathematical Practices: Proceedings of the Brussels PMP2002 Conference (Logic, Epistemology and the Unity of the Sciences Series), J. P. Van Bendegem & B. Van Kerkhove, edd. (Dordrecht: Kluwer, 2004

Identity, culture and democratization: the case of Egypt

This article seeks to present an alternative approach to understanding the failure of democratization in the Arab world by locating the problem of democracy-building within the logic of the process of reproducing national identity and culture. The conceptual framework draws on the writings of Antonio Gramsci and postcolonial theorists such as Edward Said. Taking Egypt as a case study, I examine a series of events surrounding a human rights report about police brutality in Egypt to illustrate how the struggle to reproduce Egyptian national identity impacts upon the practice of democracy. In the course of searching for an “authentic” Egyptian identity, uncorrupted by Western influences, a critical mass of Egyptian civil society participates in producing a political consensus in which civil and political freedoms may be legitimately sacrificed in the name of national unity and security. This is despite attempts by some Egyptian activists to challenge dominant conceptions of national identity and culture in order to open up democratic spaces