Bochvar-mccarthy logic and process algebra

Notre Dame Journal of Formal Logic

Volumn 39, Issue 4, 1998, Pages 464-485

  Bergstra, Jan A ^a,b   Ponse, Alban ^a,c  

^a UNIVERSITY OF AMSTERDAM   (Netherlands)

^b UTRECHT UNIVERSITY   (Netherlands)

^c CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85015583595     PISSN: 00294527     EISSN: 19390726     Source Type: Journal    
DOI: 10.1305/ndjfl/1039118863     Document Type: Article

References (23)

1. Apt, K. R., “Ten years of Hoare’s logic, a survey, part I,” ACM Transactions on Programming Languages and Systems, vol. 3 (1981), pp. 431–83.
2. Baeten, J. C. M., and J. A. Bergstra, “Process algebra with signals and conditions,” pp. 273–323 in Programming and Mathematical Method, Proceedings Summer School Marktoberdorf, 1990 NATO ASI Series F, edited by M. Broy, Springer-Verlag, 1992.
3. Baeten, J. C. M., and W. P. Weijland, Process algebra, Cambridge Tracts in Theoretical Computer Science 18, Cambridge University Press, Cambridge, 1990.
4. Bergstra, J. A., I. Bethke, and A. Ponse, “Process algebra with iteration and nesting,” Computer Journal, vol. 37 (1994), pp. 243–58.
5. Bergstra, J. A., I. Bethke, and P. H. Rodenburg, “A propositional logic with 4 values: true, false, divergent and meaningless,” Journal of Applied Non-Classical Logics, vol. 5 (1995), pp. 199–217.
6. Bergstra, J. A., and J.W. Klop, “The algebra of recursively defined processes and the algebra of regular processes,” pp. 1–25 in Algebra of Communicating Processes, Utrecht 1994, edited by A. Ponse, C. Verhoef, and S. F.M. van Vlijmen, Springer-Verlag, 1995.
7. Bergstra, J. A., and J. W. Klop, “Process algebra for synchronous communication,” Information and Control, vol. 60 (1984), pp. 109–37.
8. Bergstra, J. A., and A. Ponse, “Kleene’s three-valued logic and process algebra,” Information Processing Letters, vol. 67 (1998), pp. 95–103.
9. Bergstra, J. A., and A. Ponse, “Process algebra with five-valued conditions,” pp. 128–43, in Combinatorics, Complexity, and Logic, Proceedings of DMTCS’99 and CATS’99, vol. 21, nr. 3 of Australian Computer Science Communications, edited by C. S. Calude and M. J. Dinneen, Springer-Verlag, Singapore, 1999.
10. Bergstra, J.A., and A. Ponse, “Process algebra with four-valued logic,” Journal of Applied Non-Classical Logics, vol. 10 (2000), pp. 27–53.
11. Bochvar, D. A., “On a 3-valued logical calculus and its application to the analysis of contradictions (in Russian),” Matématičeskij sbornik, vol. 4 (1939), pp. 287–308.
12. Brookes, S. D., C. A. R. Hoare, and A.W. Roscoe, “A theory of communicating sequential processes,” Journal of the ACM, vol. 31 (1984), pp. 560–99.
13. Dijkstra, E. W., A Discipline of Programming, Prentice Hall International, Englewood Cliffs, 1976.
14. Fokkink, W. J., “Axiomatizations for the perpetual loop in process algebra,” pp. 571–81 in Proceedings of the 24th Colloquium on Automata, Languages and Programming—ICALP’97, Lecture Notes in Computer Science 1256, edited by P. Degano, R. Gorrieri, and A. Marchetti-Spaccamela, Springer-Verlag, 1997.
15. Fokkink, W. J., and R. J. Van Glabbeek, “Ntyft/ntyxt rules reduce to ntree rules,” Information and Computation, vol. 126 (1996), pp. 1–10.
16. Groote, J. F., “Transition system specifications with negative premises,” Theoretical Computer Science, vol. 118 (1993), pp. 263–99.
17. Hoare, C. A. R., I. J. Hayes, He Jifeng, C. C. Morgan, A. W. Roscoe, J. W. Sanders, I. H. Sorensen, J. M. Spivey, and B. A. Sufrin, “Laws of programming,” Communications of the ACM, vol. 30 (1987) pp. 672–86.
18. Kleene, S. C., “Representation of events in nerve nets and finite automata,” Automata Studies, pp. 3–41, edited by C. Shannon and J. McCarthy, Princeton University Press, Princeton, 1956.
19. Konikowska, B., “McCarthy algebras: a model of McCarthy’s logical calculus,” Fundamenta Informaticae, vol. 26 (1996), pp. 167–203.
20. McCarthy, J., “A basis for a mathematical theory of computation,” pp. 33–70 in Computer Programming and Formal Systems, edited by P. Braffort and D. Hirshberg, North-Holland, Amsterdam, 1963.
21. Milner, R., Communication and Concurrency, Prentice-Hall International, Englewood Cliffs, 1989.
22. Park, D. M. R., “Concurrency and automata on infinite sequences,” pp. 167–83 in Proceedings of the 5th GI (Gesellschaft für Informatik) Conference, Karlsruhe, LNCS 104, edited by P. Deussen, Springer-Verlag, 1981.
23. Verhoef, C., “A congruence theorem for structured operational semantics with predicates and negative premises,” Nordic Journal of Computing, vol. 2 (1995), pp. 274–302.