The Böhm–Jacopini Theorem Is False, Propositionally

  • Dexter Kozen
  • Wei-Lung Dustin Tseng
Conference paper

DOI: 10.1007/978-3-540-70594-9_11

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5133)
Cite this paper as:
Kozen D., Tseng WL.D. (2008) The Böhm–Jacopini Theorem Is False, Propositionally. In: Audebaud P., Paulin-Mohring C. (eds) Mathematics of Program Construction. MPC 2008. Lecture Notes in Computer Science, vol 5133. Springer, Berlin, Heidelberg

Abstract

The Böhm–Jacopini theorem (Böhm and Jacopini, 1966) is a classical result of program schematology. It states that any deterministic flowchart program is equivalent to a while program. The theorem is usually formulated at the first-order interpreted or first-order uninterpreted (schematic) level, because the construction requires the introduction of auxiliary variables. Ashcroft and Manna (1972) and Kosaraju (1973) showed that this is unavoidable. As observed by a number of authors, a slightly more powerful structured programming construct, namely loop programs with multi-level breaks, is sufficient to represent all deterministic flowcharts without introducing auxiliary variables. Kosaraju (1973) established a strict hierarchy determined by the maximum depth of nesting allowed. In this paper we give a purely propositional account of these results. We reformulate the problems at the propositional level in terms of automata on guarded strings, the automata-theoretic counterpart to Kleene algebra with tests. Whereas the classical approaches do not distinguish between first-order and propositional levels of abstraction, we find that the purely propositional formulation allows a more streamlined mathematical treatment, using algebraic and topological concepts such as bisimulation and coinduction. Using these tools, we can give more mathematically rigorous formulations and simpler and more revealing proofs.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Dexter Kozen
    • 1
  • Wei-Lung Dustin Tseng
    • 1
  1. 1.Department of Computer ScienceCornell University, IthacaNew YorkUSA

Personalised recommendations