Propositional Linear Temporal Logic with Initial Validity Semantics1

Mariusz Giero

doi:10.1515/forma-2015-0030

.blurhash-client-img { display: none !important; }

Propositional Linear Temporal Logic with Initial Validity Semantics1

Formalized Mathematics

Volume 23 (2015): Issue 4 (December 2015)

By: Mariusz Giero

Open Access

|Mar 2016

Full Article

Notes

[1] ¹ This work was supported by the University of Bialystok grants: BST447 Formalization of temporal logics in a proof-assistant. Application to System Verification, and BST225 Database of mathematical texts checked by computer.

References

Authors

Metrics

Articles in this issue

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)