Introduction to Dialectical Nets

10/14/2018 ∙ by Robert E. Kent, et al. ∙ 0

This paper initiates the dialectical approach to net theory. This approach views nets as special, but very important and natural, dialectical systems. By following this approach, a suitably generalized version of nets, called dialectical nets, can be defined in terms of the "fundamental contradiction" inherent in the structure of closed preorders. Dialectical nets are the least conceptual upper bound subsuming the notions of Petri nets, Kan quantification and transition systems. The nature of dialectical nets is that of logical dynamics, and is succinctly defined and summarized in the statement that "dialectical nets are transition systems relativized to closed preorders, and hence are general predicate transformers".



There are no comments yet.


page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.


  • [1] S. Bernow and P. Raskin, Ecology of Scientific Consciousness. Telos 28, Summer (1976).
  • [2] R.E. Kent, The Metric Closure Powerspace Construction. Third Workshop on the Mathematical Foundations of Programming Language Semantics (1987), Tulane University. LNCS (1988), Springer-Verlag, New York.
  • [3] R.E. Kent, Dialectical Development in First Order Logic: II: Horn Clause Logic Programming. manuscript to be submitted to the Logic in Computer Science conference 1988.
  • [4] F.W. Lawvere, Equality in Hyperdoctrines and the Comprehension Schema as an Adjoint Functor. In, Proceedings New York Symposium on Applications of Categorical Logic (A. Heller, ed.), American Mathematical Society (1970), 1-14.
  • [5] F.W. Lawvere, Metric Spaces, Generalized Logic, and Closed Categories. Seminario Matematico E. Fisico. Rendiconti. Milan. 43 (1973), 135-166.