Advertisement

You have not understood a sentence, unless you can prove it

  • Hans-Jürgen Brämik
Chapter
Part of the Lecture Notes in Computer Science book series (LNCS, volume 270)

Keywords

Exact Science Inductive Definition Isomorphic Embedding Positive Proof Contextual Circumstance 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Brämik H J (1981) Vom Denken in Begriffen in: Börger E, Barnocchi D, Kaulbach F (eds) Zur Philosophie der mathematischen Erkenntnis Königshausen + Neumann, Würzburg 1981: 67–80Google Scholar
  2. Brüggemann A, Priese L, Rödding D, Schätz R (1984) Modular Decomposition of Automata in: Börger E, Hasenjaeger G, Rödding D (eds) Logic and Machines: Decision Problems and Complexity Springer LNCS 171: 198–236Google Scholar
  3. Kleine Büning H (1984) Complexity of Loop-Problems in Normed Networks in: LNCS 171 (see 2): 245–269Google Scholar
  4. Müller J (1981) Netzwerke endlicher Automaten — eine modulare Zerlegungstheorie für Automaten Ausarbeitung am Institut für mathematische Logik und Grundlagenforschung der Universität MünsterGoogle Scholar
  5. Priese L (1981) Über eine mathematische Theorie von Automaten und deren Anwendung in: see 1 107–123Google Scholar
  6. Rödding D (1983) Modular Decomposition of Automata (Survey) in: Karpinski M (ed) Foundations of Computation Theory Springer LNCS 158: 394–412Google Scholar
  7. Rödding D (1984) Some Logical Problems Connected with a Modular Decomposition Theory of Automata in: Richter M M, Börger E, Oberschelp W, Schinzel B, Thomas W (eds) Computation and Proof Theory Springer LNM 1104: 365–388Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Hans-Jürgen Brämik
    • 1
  1. 1.Münster

Personalised recommendations