On Multiset Ordering

Pole DC	Wartość	Język
dc.contributor.author	Bancerek, Grzegorz	-
dc.date.accessioned	2017-05-16T09:36:12Z	-
dc.date.available	2017-05-16T09:36:12Z	-
dc.date.issued	2016	pl
dc.identifier.citation	Formalized Mathematics, Volume 24, Issue 2, pp. 95–106	pl
dc.identifier.issn	1426-2630	pl
dc.identifier.issn	1898-9934	pl
dc.identifier.uri	http://hdl.handle.net/11320/5495	-
dc.description.abstract	Formalization of a part of [11]. Unfortunately, not all is possible to be formalized. Namely, in the paper there is a mistake in the proof of Lemma 3. It states that there exists x ∈ M1 such that M1(x) > N1(x) and (∀y ∈ N1)x ⊀ y. It should be M1(x) ⩾ N1(x). Nevertheless we do not know whether x ∈ N1 or not and cannot prove the contradiction. In the article we referred to [8], [9] and [10].	-
dc.language.iso	en	-
dc.publisher	De Gruyter Open	-
dc.subject	ordering	-
dc.subject	Dershowitz-Manna ordering	-
dc.title	On Multiset Ordering	-
dc.type	Article	-
dc.identifier.doi	10.1515/forma-2016-0008	-
dc.description.Affiliation	Bancerek Grzegorz - Association of Mizar Users, Białystok, Poland	-
dc.description.references	Grzegorz Bancerek. The fundamental properties of natural numbers. Formalized Mathematics, 1(1):41–46, 1990.	-
dc.description.references	Grzegorz Bancerek. Reduction relations. Formalized Mathematics, 5(4):469–478, 1996.	-
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 Byliński. Finite sequences and tuples of elements of a non-empty sets. Formalized Mathematics, 1(3):529–536, 1990.	-
dc.description.references	Czesław Byliński. Functions and their basic properties. Formalized Mathematics, 1(1): 55–65, 1990.	-
dc.description.references	Czesław Byliński. Some basic properties of sets. Formalized Mathematics, 1(1):47–53, 1990.	-
dc.description.references	Nachum Dershowitz. Orderings for term-rewriting systems. Theoretical Computer Science, 17(3):279–301, 1982. doi:10.1016/0304-3975(82)90026-3.	-
dc.description.references	Nachum Dershowitz and Zohar Manna. Proving termination with multiset orderings. Communications of the ACM, 22(8):465–476, 1979. doi:10.1145/359138.359142.	-
dc.description.references	Gerard Huet and Derek C. Oppen. Equations and rewrite rules: A survey. Technical report, Stanford, CA, USA, 1980.	-
dc.description.references	Jean-Pierre Jouannaud and Pierre Lescanne. On multiset ordering. Information Processing Letters, 15(2):57–63, 1982. doi:10.1016/0020-0190(82)90107-7.	-
dc.description.references	Robert Milewski. Natural numbers. Formalized Mathematics, 7(1):19–22, 1998.	-
dc.description.references	Eliza Niewiadomska and Adam Grabowski. Introduction to formal preference spaces. Formalized Mathematics, 21(3):223–233, 2013. doi:10.2478/forma-2013-0024.	-
dc.description.references	Andrzej Trybulec. Binary operations applied to functions. Formalized Mathematics, 1 (2):329–334, 1990.	-
dc.description.references	Wojciech A. Trybulec. Non-contiguous substrings and one-to-one finite sequences. Formalized Mathematics, 1(3):569–573, 1990.	-
dc.description.references	Wojciech A. Trybulec and Grzegorz Bancerek. Kuratowski – Zorn lemma. Formalized Mathematics, 1(2):387–393, 1990.	-
Występuje w kolekcji(ach):	Formalized Mathematics, 2016, Volume 24, Issue 2

Pliki w tej pozycji:

Plik	Opis	Rozmiar	Format
forma-2016-0008.pdf		291,9 kB	Adobe PDF	Otwórz

Pokaż uproszczony widok rekordu Zobacz statystyki

Pozycja ta dostępna jest na podstawie licencji Licencja Creative Commons CCL