W BIAŁYMSTOKU
Proszę używać tego identyfikatora do cytowań lub wstaw link do tej pozycji:
http://hdl.handle.net/11320/3646Pełny rekord metadanych
| Pole DC | Wartość | Język |
|---|---|---|
| dc.contributor.author | Giero, Mariusz | - |
| dc.date.accessioned | 2015-12-06T19:05:55Z | - |
| dc.date.available | 2015-12-06T19:05:55Z | - |
| dc.date.issued | 2012 | - |
| dc.identifier.citation | Formalized Mathematics, Volume 20, Issue 3, 2012, Pages 221-226 | - |
| dc.identifier.issn | 1426-2630 | - |
| dc.identifier.issn | 1898-9934 | - |
| dc.identifier.uri | http://hdl.handle.net/11320/3646 | - |
| dc.description | I would like to thank Prof. Andrzej Trybulec, Dr. Artur Korniłowicz, Dr. Adam Naumowicz and Karol Pak for their help in preparation of the article. | - |
| dc.description.abstract | This is a second preliminary article to prove the completeness theorem of an extension of basic propositional temporal logic. We base it on the proof of completeness for basic propositional temporal logic given in [17]. We introduce two modified definitions of a subformula. In the former one we treat until-formula as indivisible. In the latter one, we extend the set of subformulas of until-formulas by a special disjunctive formula. This is needed to construct a temporal model. We also define an ordered positive-negative pair of finite sequences of formulas (PNP). PNPs represent states of a temporal model. | - |
| dc.description.sponsorship | This work has been supported by the Polish Ministry of Science and Higher Education project “Managing a Large Repository of Computer-verified Mathematical Knowledge” (N N519 385136). | - |
| dc.language.iso | en | - |
| dc.publisher | De Gruyter Open | - |
| dc.title | The Properties of Sets of Temporal Logic Subformulas | - |
| dc.type | Article | - |
| dc.identifier.doi | 10.2478/v10037-012-0026-9 | - |
| dc.description.Affiliation | Department of Logic, Informatics and Philosophy of Science, University of Białystok, Plac Uniwersytecki 1, 15-420 Białystok, Poland | - |
| dc.description.references | Grzegorz Bancerek. Cardinal numbers. Formalized Mathematics, 1(2):377-382, 1990. | - |
| dc.description.references | Grzegorz Bancerek. The fundamental properties of natural numbers. Formalized Mathematics, 1(1):41-46, 1990. | - |
| dc.description.references | Grzegorz Bancerek. Introduction to trees. Formalized Mathematics, 1(2):421-427, 1990. | - |
| dc.description.references | Grzegorz Bancerek. The ordinal numbers. Formalized Mathematics, 1(1):91-96, 1990. | - |
| dc.description.references | Grzegorz Bancerek. König’s lemma. Formalized Mathematics, 2(3):397-402, 1991. | - |
| dc.description.references | Grzegorz Bancerek and Krzysztof Hryniewiecki. Segments of natural numbers and finite sequences. Formalized Mathematics, 1(1):107-114, 1990. | - |
| dc.description.references | Czesław Bylinski. Finite sequences and tuples of elements of a non-empty sets. Formalized Mathematics, 1(3):529-536, 1990. | - |
| dc.description.references | Czesław Bylinski. Functions and their basic properties. Formalized Mathematics, 1(1):55-65, 1990. | - |
| dc.description.references | Czesław Bylinski. Functions from a set to a set. Formalized Mathematics, 1(1):153-164, 1990. | - |
| dc.description.references | Czesław Bylinski. Partial functions. Formalized Mathematics, 1(2):357-367, 1990. | - |
| dc.description.references | Czesław Bylinski. Some basic properties of sets. Formalized Mathematics, 1(1):47-53, 1990. | - |
| dc.description.references | Agata Darmochwał. Finite sets. Formalized Mathematics, 1(1):165-167, 1990. | - |
| dc.description.references | Mariusz Giero. The axiomatization of propositional linear time temporal logic. Formalized Mathematics, 19(2):113-119, 2011, doi: 10.2478/v10037-011-0018-1. | - |
| dc.description.references | Mariusz Giero. The derivations of temporal logic formulas. Formalized Mathematics, 20(3):215-219, 2012, doi: 10.2478/v10037-012-0025-x. | - |
| dc.description.references | Adam Grabowski. Hilbert positive propositional calculus. Formalized Mathematics, 8(1):69-72, 1999. | - |
| dc.description.references | Jarosław Kotowicz. Functions and finite sequences of real numbers. Formalized Mathematics, 3(2):275-278, 1992. | - |
| dc.description.references | Fred Kröger and Stephan Merz. Temporal Logic and State Systems. Springer-Verlag, 2008. | - |
| dc.description.references | Beata Padlewska. Families of sets. Formalized Mathematics, 1(1):147-152, 1990. | - |
| dc.description.references | Andrzej Trybulec. Binary operations applied to functions. Formalized Mathematics, 1(2):329-334, 1990. | - |
| dc.description.references | Andrzej Trybulec. Domains and their Cartesian products. Formalized Mathematics, 1(1):115-122, 1990. | - |
| dc.description.references | Andrzej Trybulec. Enumerated sets. Formalized Mathematics, 1(1):25-34, 1990. | - |
| dc.description.references | Andrzej Trybulec. Tuples, projections and Cartesian products. Formalized Mathematics, 1(1):97-105, 1990. | - |
| dc.description.references | Andrzej Trybulec. Defining by structural induction in the positive propositional language. Formalized Mathematics, 8(1):133-137, 1999. | - |
| dc.description.references | Zinaida Trybulec. Properties of subsets. Formalized Mathematics, 1(1):67-71, 1990. | - |
| dc.description.references | Edmund Woronowicz. Many argument relations. Formalized Mathematics, 1(4):733-737, 1990. | - |
| dc.description.references | Edmund Woronowicz. Relations and their basic properties. Formalized Mathematics, 1(1):73-83, 1990. | - |
| dc.description.references | Edmund Woronowicz. Relations defined on sets. Formalized Mathematics, 1(1):181-186, 1990. | - |
| Występuje w kolekcji(ach): | Formalized Mathematics, 2012, Volume 20, Issue 3 | |
Pliki w tej pozycji:
| Plik | Opis | Rozmiar | Format | |
|---|---|---|---|---|
| v10037-012-0026-9.pdf | 264,26 kB | Adobe PDF | Otwórz |
Pozycja ta dostępna jest na podstawie licencji Licencja Creative Commons CCL
