Skip to main content
Have a personal or library account? Click to login
The Properties of Sets of Temporal Logic Subformulas Cover

The Properties of Sets of Temporal Logic Subformulas

Formalized Mathematics
Volume 20 (2012): Issue 3 (September 2012)
By:   
Open Access
|Feb 2013
References

References

  1. [1] Grzegorz Bancerek. Cardinal numbers., 1():377-382, 1990.
    Search in Google Scholar
  2. [2] Grzegorz Bancerek. The fundamental properties of natural numbers., 1():41-46, 1990.
    Search in Google Scholar
  3. [3] Grzegorz Bancerek. Introduction to trees., 1():421-427, 1990.
    Search in Google Scholar
  4. [4] Grzegorz Bancerek. The ordinal numbers., 1():91-96, 1990.
    Search in Google Scholar
  5. [5] Grzegorz Bancerek. K¨onig’s lemma., 2():397-402, 1991.
    Search in Google Scholar
  6. [6] Grzegorz Bancerek and Krzysztof Hryniewiecki. Segments of natural numbers and finite sequences., 1():107-114, 1990.
    Search in Google Scholar
  7. [7] Czesław Bylinski. Finite sequences and tuples of elements of a non-empty sets., 1():529-536, 1990.
    Search in Google Scholar
  8. [8] Czesław Bylinski. Functions and their basic properties., 1():55-65, 1990.
    Search in Google Scholar
  9. [9] Czesław Bylinski. Functions from a set to a set., 1():153-164, 1990.
    Search in Google Scholar
  10. [10] Czesław Bylinski. Partial functions., 1():357-367, 1990.
    Search in Google Scholar
  11. [11] Czesław Bylinski. Some basic properties of sets., 1():47-53, 1990.
    Search in Google Scholar
  12. [12] Agata Darmochwał. Finite sets., 1():165-167, 1990.
    Search in Google Scholar
  13. [13] Mariusz Giero. The axiomatization of propositional linear time temporal logic., 19():113-119, 2011, doi: 10.2478/v10037-011-0018-1.
    Open DOISearch in Google Scholar
  14. [14] Mariusz Giero. The derivations of temporal logic formulas., 20():215-219, 2012, doi: 10.2478/v10037-012-0025-x.
    Open DOISearch in Google Scholar
  15. [15] Adam Grabowski. Hilbert positive propositional calculus., 8():69-72, 1999.
    Search in Google Scholar
  16. [16] Jarosław Kotowicz. Functions and finite sequences of real numbers., 3():275-278, 1992.
    Search in Google Scholar
  17. [17] Fred Kr¨oger and Stephan Merz.. Springer-Verlag, 2008.
    Search in Google Scholar
  18. [18] Beata Padlewska. Families of sets., 1():147-152, 1990.
    Search in Google Scholar
  19. [19] Andrzej Trybulec. Binary operations applied to functions., 1():329-334, 1990.
    Search in Google Scholar
  20. [20] Andrzej Trybulec. Domains and their Cartesian products., 1():115-122, 1990.
    Search in Google Scholar
  21. [21] Andrzej Trybulec. Enumerated sets., 1():25-34, 1990.
    Search in Google Scholar
  22. [22] Andrzej Trybulec. Tuples, projections and Cartesian products., 1():97-105, 1990.
    Search in Google Scholar
  23. [23] Andrzej Trybulec. Defining by structural induction in the positive propositional language., 8():133-137, 1999.
    Search in Google Scholar
  24. [24] Zinaida Trybulec. Properties of subsets., 1():67-71, 1990.
    Search in Google Scholar
  25. [25] Edmund Woronowicz. Many argument relations., 1():733-737, 1990.
    Search in Google Scholar
  26. [26] Edmund Woronowicz. Relations and their basic properties., 1():73-83, 1990.
    Search in Google Scholar
  27. [27] Edmund Woronowicz. Relations defined on sets., 1():181-186, 1990.
    Search in Google Scholar
DOI: https://doi.org/10.2478/v10037-012-0026-9 | Journal eISSN: 1898-9934 | Journal ISSN: 1426-2630
Journal RSS Feed
Language: English
Page range: 221 - 226
Published on: Feb 2, 2013
Published by: University of Białystok
In partnership with: Paradigm Publishing Services
Related subjects:
Computer sciences,
Artificial intelligence,
Computer sciences, other,
Mathematics,
Logic and set theory,
General mathematics

© 2013 Mariusz Giero, published by University of Białystok
This work is licensed under the Creative Commons License.

Volume 20 (2012): Issue 3 (September 2012)
Previous article
Next article