The Canonical Structure as a Minimum Structure

Yasuhiko Takahara, Junichi Hjima, Shingo Takahashi

研究成果: Article


In this paper a structure of a syslem is defined as a mathematical structure [formula omitted], where [formula omitted]is a first-order logic language and Σ is a set of sentences of the given first-order logic. It is shown that a canonical structure determined by I, which is similar to those used in proving the Gödel's completeness theorem, satisfies a universality in the sense of category theory when homomorphisms are used as morphisms, and a freeness in the sense of universal algebra when Σ-morphisms, which preserve Σ, are used. The universality and the freeness give the minimality of the canonical structure.As an example, a structure of a stationary system is defined as a pair [formula omitted] Its canonical structure is actually constructed. In a sense this canonical structure accords with models constructed by Nerode realization.

ジャーナルInternational Journal of General Systems
出版物ステータスPublished - 1989

ASJC Scopus subject areas

  • Computer Science Applications
  • Control and Systems Engineering
  • Modelling and Simulation
  • Theoretical Computer Science
  • Information Systems

フィンガープリント The Canonical Structure as a Minimum Structure' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用