scientific article; zbMATH DE number 4033140

From MaRDI portal
Publication:3773399





The author's previous results concerning unformalized procedures and systems are modified and further developed. K-systems are introduced to represent unformalized knowledge as a possible basis for automatization of a formalization process and understanding of meaning of mathematical texts. On the intuitive level, a K-system consists of a set of rules on which a binary relation ``general rule : exception is defined. The relation controls rules application - in the domain of an exception the application of a general rule is forbidden. Definitions of basic notions of K-systems are given, the closure properties of K-systems are studied. The existence of a universal K- system is proved, as well as the existence of a set representable but not decidable in K-systems. The corresponding theorems are analogous to the well-known results concerning recursively enumerable sets. The problem of representation of sets in K-systems is discussed in detail. First, arithmetical sets are considered; then, ``intuitive set representation is described in terms of both classical and constructivistic approach.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3773399)