Skip to main content
Have a personal or library account? Click to login
Propositional Linear Temporal Logic with Initial Validity Semantics1 Cover

Propositional Linear Temporal Logic with Initial Validity Semantics1

Formalized Mathematics
Volume 23 (2015): Issue 4 (December 2015)
By:   
Open Access
|Mar 2016
References

References

  1. [1] Grzegorz Bancerek. The fundamental properties of natural numbers., 1():41–46, 1990.
    Search in Google Scholar
  2. [2] Grzegorz Bancerek. The ordinal numbers., 1():91–96, 1990.
    Search in Google Scholar
  3. [3] Grzegorz Bancerek and Krzysztof Hryniewiecki. Segments of natural numbers and finite sequences., 1():107–114, 1990.
    Search in Google Scholar
  4. [4] Grzegorz Bancerek, Czesław Byliński, Adam Grabowski, Artur Korniłowicz, Roman Matuszewski, Adam Naumowicz, Karol Pąk, and Josef Urban. Mizar: State-of-the-art and beyond. In Manfred Kerber, Jacques Carette, Cezary Kaliszyk, Florian Rabe, and Volker Sorge, editors,, volume 9150 of, pages 261–279. Springer International Publishing, 2015. ISBN 978-3-319-20614-1. doi:10.1007/978-3-319-20615-8 17.
    Open DOISearch in Google Scholar
  5. [5] Czesław Byliński. Functions and their basic properties., 1(): 55–65, 1990.
    Search in Google Scholar
  6. [6] Czesław Byliński. Functions from a set to a set., 1():153–164, 1990.
    Search in Google Scholar
  7. [7] Czesław Byliński. Partial functions., 1():357–367, 1990.
    Search in Google Scholar
  8. [8] Czesław Byliński. Some basic properties of sets., 1():47–53, 1990.
    Search in Google Scholar
  9. [9] Agata Darmochwał. Finite sets., 1():165–167, 1990.
    Search in Google Scholar
  10. [10] 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
  11. [11] Adam Grabowski. Hilbert positive propositional calculus., 8(): 69–72, 1999.
    Search in Google Scholar
  12. [12] Fred Kröger and Stephan Merz.. Springer-Verlag, 2008.
    Search in Google Scholar
  13. [13] Andrzej Trybulec. Domains and their Cartesian products., 1(): 115–122, 1990.
    Search in Google Scholar
  14. [14] Andrzej Trybulec. Defining by structural induction in the positive propositional language., 8():133–137, 1999.
    Search in Google Scholar
  15. [15] Zinaida Trybulec. Properties of subsets., 1():67–71, 1990.
    Search in Google Scholar
  16. [16] Edmund Woronowicz. Many argument relations., 1():733–737, 1990.
    Search in Google Scholar
  17. [17] Edmund Woronowicz. Relations and their basic properties., 1 ():73–83, 1990.
    Search in Google Scholar
DOI: https://doi.org/10.1515/forma-2015-0030 | Journal eISSN: 1898-9934 | Journal ISSN: 1426-2630
Journal RSS Feed
Language: English
Page range: 379 - 386
Submitted on: Oct 22, 2015
Published on: Mar 25, 2016
Published by: University of Białystok
In partnership with: Paradigm Publishing Services
Keywords:
temporal logic,
very strict until operator,
completeness
MSC:
03B70,
03B35
MML:
identifier: LTLAXIO5,
version: 8.1.04 5.34.1256
Related subjects:
Computer sciences,
Artificial intelligence,
Computer sciences, other,
Mathematics,
Logic and set theory,
General mathematics

© 2016 Mariusz Giero, published by University of Białystok
This work is licensed under the Creative Commons Attribution-ShareAlike 3.0 License.

Volume 23 (2015): Issue 4 (December 2015)
Previous article
Next article