Journal & Issues

Volume 31 (2023): Issue 1 (September 2023)

Volume 30 (2022): Issue 4 (December 2022)

Volume 30 (2022): Issue 3 (October 2022)

Volume 30 (2022): Issue 2 (July 2022)

Volume 30 (2022): Issue 1 (April 2022)

Volume 29 (2021): Issue 4 (December 2021)

Volume 29 (2021): Issue 3 (September 2021)

Volume 29 (2021): Issue 2 (July 2021)

Volume 29 (2021): Issue 1 (April 2021)

Volume 28 (2020): Issue 4 (December 2020)

Volume 28 (2020): Issue 3 (October 2020)

Volume 28 (2020): Issue 2 (July 2020)

Volume 28 (2020): Issue 1 (April 2020)

Volume 27 (2019): Issue 4 (December 2019)

Volume 27 (2019): Issue 3 (October 2019)

Volume 27 (2019): Issue 2 (July 2019)

Volume 27 (2019): Issue 1 (April 2019)

Volume 26 (2018): Issue 4 (December 2018)

Volume 26 (2018): Issue 3 (October 2018)

Volume 26 (2018): Issue 2 (July 2018)

Volume 26 (2018): Issue 1 (April 2018)

Volume 25 (2017): Issue 4 (December 2017)

Volume 25 (2017): Issue 3 (October 2017)

Volume 25 (2017): Issue 2 (July 2017)

Volume 25 (2017): Issue 1 (March 2017)

Volume 24 (2016): Issue 4 (December 2016)

Volume 24 (2016): Issue 3 (September 2016)

Volume 24 (2016): Issue 2 (June 2016)

Volume 24 (2016): Issue 1 (March 2016)

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

Volume 23 (2015): Issue 3 (September 2015)

Volume 23 (2015): Issue 2 (June 2015)

Volume 23 (2015): Issue 1 (March 2015)

Volume 22 (2014): Issue 4 (December 2014)

Volume 22 (2014): Issue 3 (September 2014)

Volume 22 (2014): Issue 2 (June 2014)
Special Issue: 25 years of the Mizar Mathematical Library

Volume 22 (2014): Issue 1 (March 2014)

Volume 21 (2013): Issue 4 (December 2013)

Volume 21 (2013): Issue 3 (October 2013)

Volume 21 (2013): Issue 2 (June 2013)

Volume 21 (2013): Issue 1 (January 2013)

Volume 20 (2012): Issue 4 (December 2012)

Volume 20 (2012): Issue 3 (December 2012)

Volume 20 (2012): Issue 2 (December 2012)

Volume 20 (2012): Issue 1 (January 2012)

Volume 19 (2011): Issue 4 (January 2011)

Volume 19 (2011): Issue 3 (January 2011)

Volume 19 (2011): Issue 2 (January 2011)

Volume 19 (2011): Issue 1 (January 2011)

Volume 18 (2010): Issue 4 (January 2010)

Volume 18 (2010): Issue 3 (January 2010)

Volume 18 (2010): Issue 2 (January 2010)

Volume 18 (2010): Issue 1 (January 2010)

Volume 17 (2009): Issue 4 (January 2009)

Volume 17 (2009): Issue 3 (January 2009)

Volume 17 (2009): Issue 2 (January 2009)

Volume 17 (2009): Issue 1 (January 2009)

Volume 16 (2008): Issue 4 (January 2008)

Volume 16 (2008): Issue 3 (January 2008)

Volume 16 (2008): Issue 2 (January 2008)

Volume 16 (2008): Issue 1 (January 2008)

Volume 15 (2007): Issue 4 (January 2007)

Volume 15 (2007): Issue 3 (January 2007)

Volume 15 (2007): Issue 2 (January 2007)

Volume 15 (2007): Issue 1 (January 2007)

Volume 14 (2006): Issue 4 (January 2006)

Volume 14 (2006): Issue 3 (January 2006)

Volume 14 (2006): Issue 2 (January 2006)

Volume 14 (2006): Issue 1 (January 2006)

Journal Details
Format
Journal
eISSN
1898-9934
ISSN
1426-2630
First Published
09 Jun 2008
Publication timeframe
4 times per year
Languages
English

Search

Volume 15 (2007): Issue 1 (January 2007)

Journal Details
Format
Journal
eISSN
1898-9934
ISSN
1426-2630
First Published
09 Jun 2008
Publication timeframe
4 times per year
Languages
English

Search

0 Articles
Open Access

Several Classes of BCI-algebras and their Properties

Published Online: 13 Jun 2008
Page range: 1 - 9

Abstract

Several Classes of BCI-algebras and their Properties

I have formalized the BCI-algebras closely following the book [6], sections 1.1 to 1.3, 1.6, 2.1 to 2.3, and 2.7. In this article the general theory of BCI-algebras and several classes of BCI-algebras are given. MML identifier: BCIALG 1 , version: 7.8.04 4.81.962

Open Access

Formal Languages - Concatenation and Closure

Published Online: 13 Jun 2008
Page range: 11 - 15

Abstract

Formal Languages - Concatenation and Closure

Formal languages are introduced as subsets of the set of all 0-based finite sequences over a given set (the alphabet). Concatenation, the n -th power and closure are defined and their properties are shown. Finally, it is shown that the closure of the alphabet (understood here as the language of words of length 1) equals to the set of all words over that alphabet, and that the alphabet is the minimal set with this property. Notation and terminology were taken from [5] and [13]. MML identifier: FLANG 1 , version: 7.8.04 4.81.962

Open Access

Basic Properties of Determinants of Square Matrices over a Field1

Published Online: 13 Jun 2008
Page range: 17 - 25

Abstract

Basic Properties of Determinants of Square Matrices over a Field<sup>1</sup>

In this paper I present basic properties of the determinant of square matrices over a field and selected properties of the sign of a permutation. First, I define the sign of a permutation by the requirement where p is any fixed permutation of a set with n elements. I prove that the sign of a product of two permutations is the same as the product of their signs and show the relation between signs and parity of permutations. Then I consider the determinant of a linear combination of lines, the determinant of a matrix with permutated lines and the determinant of a matrix with a repeated line. Finally, at the end I prove that the determinant of a product of two square matrices is equal to the product of their determinants. MML identifier: MATRIX11 , version: 7.8.04 4.81.962

0 Articles
Open Access

Several Classes of BCI-algebras and their Properties

Published Online: 13 Jun 2008
Page range: 1 - 9

Abstract

Several Classes of BCI-algebras and their Properties

I have formalized the BCI-algebras closely following the book [6], sections 1.1 to 1.3, 1.6, 2.1 to 2.3, and 2.7. In this article the general theory of BCI-algebras and several classes of BCI-algebras are given. MML identifier: BCIALG 1 , version: 7.8.04 4.81.962

Open Access

Formal Languages - Concatenation and Closure

Published Online: 13 Jun 2008
Page range: 11 - 15

Abstract

Formal Languages - Concatenation and Closure

Formal languages are introduced as subsets of the set of all 0-based finite sequences over a given set (the alphabet). Concatenation, the n -th power and closure are defined and their properties are shown. Finally, it is shown that the closure of the alphabet (understood here as the language of words of length 1) equals to the set of all words over that alphabet, and that the alphabet is the minimal set with this property. Notation and terminology were taken from [5] and [13]. MML identifier: FLANG 1 , version: 7.8.04 4.81.962

Open Access

Basic Properties of Determinants of Square Matrices over a Field1

Published Online: 13 Jun 2008
Page range: 17 - 25

Abstract

Basic Properties of Determinants of Square Matrices over a Field<sup>1</sup>

In this paper I present basic properties of the determinant of square matrices over a field and selected properties of the sign of a permutation. First, I define the sign of a permutation by the requirement where p is any fixed permutation of a set with n elements. I prove that the sign of a product of two permutations is the same as the product of their signs and show the relation between signs and parity of permutations. Then I consider the determinant of a linear combination of lines, the determinant of a matrix with permutated lines and the determinant of a matrix with a repeated line. Finally, at the end I prove that the determinant of a product of two square matrices is equal to the product of their determinants. MML identifier: MATRIX11 , version: 7.8.04 4.81.962