Algebraic Approach to Algorithmic Logic

Pole DC	Wartość	Język
dc.contributor.author	Bancerek, Grzegorz	-
dc.date.accessioned	2015-12-09T20:41:02Z	-
dc.date.available	2015-12-09T20:41:02Z	-
dc.date.issued	2014	-
dc.identifier.citation	Formalized Mathematics, Volume 22, Issue 3, 2014, Pages 225-255	-
dc.identifier.issn	1426-2630	-
dc.identifier.issn	1898-9934	-
dc.identifier.uri	http://hdl.handle.net/11320/3721	-
dc.description.abstract	We introduce algorithmic logic - an algebraic approach according to [25]. It is done in three stages: propositional calculus, quantifier calculus with equality, and finally proper algorithmic logic. For each stage appropriate signature and theory are defined. Propositional calculus and quantifier calculus with equality are explored according to [24]. A language is introduced with language signature including free variables, substitution, and equality. Algorithmic logic requires a bialgebra structure which is an extension of language signature and program algebra. While-if algebra of generator set and algebraic signature is bialgebra with appropriate properties and is used as basic type of algebraic logic.	-
dc.language.iso	en	-
dc.publisher	De Gruyter Open	-
dc.subject	propsitional calcus	-
dc.subject	quantifier calcus	-
dc.subject	algorithmic logic	-
dc.title	Algebraic Approach to Algorithmic Logic	-
dc.type	Article	-
dc.identifier.doi	10.2478/forma-2014-0025	-
dc.description.Affiliation	Association of Mizar Users Białystok, Poland	-
dc.description.references	Grzegorz Bancerek. Mizar analysis of algorithms: Preliminaries. Formalized Mathematics, 15(3):87-110, 2007. doi:10.2478/v10037-007-0011-x.	-
dc.description.references	Grzegorz Bancerek. Program algebra over an algebra. Formalized Mathematics, 20(4): 309-341, 2012. doi:10.2478/v10037-012-0037-6.	-
dc.description.references	Grzegorz Bancerek. Cardinal numbers. Formalized Mathematics, 1(2):377-382, 1990.	-
dc.description.references	Grzegorz Bancerek. König’s theorem. Formalized Mathematics, 1(3):589-593, 1990.	-
dc.description.references	Grzegorz Bancerek. Algebra of morphisms. Formalized Mathematics, 6(2):303-310, 1997.	-
dc.description.references	Grzegorz Bancerek. Institution of many sorted algebras. Part I: Signature reduct of an algebra. Formalized Mathematics, 6(2):279-287, 1997.	-
dc.description.references	Grzegorz Bancerek. Translations, endomorphisms, and stable equational theories. Formalized Mathematics, 5(4):553-564, 1996.	-
dc.description.references	Grzegorz Bancerek. The fundamental properties of natural numbers. Formalized Mathematics, 1(1):41-46, 1990.	-
dc.description.references	Grzegorz Bancerek. The ordinal numbers. Formalized Mathematics, 1(1):91-96, 1990.	-
dc.description.references	Grzegorz Bancerek. Sequences of ordinal numbers. Formalized Mathematics, 1(2):281-290, 1990.	-
dc.description.references	Grzegorz Bancerek. Ordinal arithmetics. Formalized Mathematics, 1(3):515-519, 1990.	-
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	Grzegorz Bancerek and Andrzej Trybulec. Miscellaneous facts about functions. Formalized Mathematics, 5(4):485-492, 1996.	-
dc.description.references	Ewa Burakowska. Subalgebras of the universal algebra. Lattices of subalgebras. Formalized Mathematics, 4(1):23-27, 1993.	-
dc.description.references	Czesław Bylinski. Binary operations. Formalized Mathematics, 1(1):175-180, 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. The modification of a function by a function and the iteration of the composition of a function. Formalized Mathematics, 1(3):521-527, 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	Jarosław Kotowicz, Beata Madras, and Małgorzata Korolkiewicz. Basic notation of universal algebra. Formalized Mathematics, 3(2):251-253, 1992.	-
dc.description.references	Elliott Mendelson. Introduction to Mathematical Logic. Chapman Hall/CRC, 1997. http://books.google.pl/books?id=ZO1p4QGspoYC	-
dc.description.references	Grazyna Mirkowska and Andrzej Salwicki. Algorithmic Logic. PWN-Polish Scientific Publisher, 1987.	-
dc.description.references	Beata Perkowska. Free universal algebra construction. Formalized Mathematics, 4(1): 115-120, 1993.	-
dc.description.references	Beata Perkowska. Free many sorted universal algebra. Formalized Mathematics, 5(1): 67-74, 1996.	-
dc.description.references	Krzysztof Retel. Properties of first and second order cutting of binary relations. Formalized Mathematics, 13(3):361-365, 2005.	-
dc.description.references	Andrzej Trybulec. Binary operations applied to functions. Formalized Mathematics, 1 (2):329-334, 1990.	-
dc.description.references	Andrzej Trybulec. Tuples, projections and Cartesian products. Formalized Mathematics, 1(1):97-105, 1990.	-
dc.description.references	Andrzej Trybulec. Many sorted algebras. Formalized Mathematics, 5(1):37-42, 1996.	-
dc.description.references	Andrzej Trybulec. Many sorted sets. Formalized Mathematics, 4(1):15-22, 1993.	-
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.	-
Występuje w kolekcji(ach):	Formalized Mathematics, 2014, Volume 22, Issue 3

Pliki w tej pozycji:

Plik	Opis	Rozmiar	Format
forma-2014-0025.pdf		359,88 kB	Adobe PDF	Otwórz

Pokaż uproszczony widok rekordu Zobacz statystyki

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