Studia Logica

, Volume 21, Issue 1, pp 81–88 | Cite as

Towards a general theory of sign systems. II

  • Olgierd Wojtasiewicz
Article
  • 14 Downloads

Keywords

General Theory Mathematical Logic Sign System Computational Linguistic 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Cf.Natural Language and the Computer, ed.P. L. Garvin, New York 1963, p. 9: “... signs or symbols, unless they are iconic in Charles Perice's terms, are arrived at by convention and hence are arbitrary in the sense that their physical shape is not necessarily related to their meaning”.Google Scholar
  2. 2.
    ProfessorZdzisław Pawlak has suggested an interesting broadening of the interpretation suggested in this paper: the system here presented holds ifH is interpreted as the set of finite automata,m as the set of signals, andB as the set of the states of such automata. This interpretation also waives aside all the philosophical considerations that might be pointed to in the case of the original interpretation. The very possibility of this broadened interpretation is, in the author's opinion, a strong argument in favour of the system adopted in this paper.Google Scholar
  3. 3.
    In Part I the relation of equisignificance was adopted as a primitive term and called the relation of isosemy. The term used here follows the terminology ofE. C. Luschei inThe Logical Systems of Leśniewski, Amsterdam 1962.Google Scholar
  4. 4.
    In Part I the concepts of expression and fragment were treated as primitive.Google Scholar
  5. 5.
    D. Hilbert andW. Ackermann,Grundzüge der theoretischen. Logik, Berlin 1928, pp. 44–45.Google Scholar
  6. 6.
    The connection between the two approaches will be established at another opportunity.Google Scholar

Copyright information

© Warszawa 1967

Authors and Affiliations

  • Olgierd Wojtasiewicz
    • 1
  1. 1.Uniwersytet WarszawskiWarszawa

Personalised recommendations