The Böhm–Jacopini Theorem Is False, Propositionally
From MaRDI portal
Publication:3521987
DOI10.1007/978-3-540-70594-9_11zbMath1156.68354WikidataQ55880202 ScholiaQ55880202MaRDI QIDQ3521987
Dexter Kozen, Wei-Lung Dustin Tseng
Publication date: 28 August 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-70594-9_11
68Q45: Formal languages and automata
03B70: Logic in computer science
68N30: Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)
Related Items
Unnamed Item, Concurrent NetKAT. Modeling and analyzing stateful, concurrent networks, Completeness and the finite model property for Kleene algebra, reconsidered, Dijkstra graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Regular expressions and the equivalence of programs
- Eliminating go to's while preserving program structure
- Unravelling Unstructured Programs
- Conversion of Unstructured Flow Diagrams to Structured Form
- On the capabilities of while, repeat, and exit statements
- Flow diagrams, turing machines and languages with only two formation rules