Page 1 Next

Displaying 1 – 20 of 21

Showing per page

Gaussian Integers

Yuichi Futa, Hiroyuki Okazaki, Daichi Mizushima, Yasunari Shidama (2013)

Formalized Mathematics

Gaussian integer is one of basic algebraic integers. In this article we formalize some definitions about Gaussian integers [27]. We also formalize ring (called Gaussian integer ring), Z-module and Z-algebra generated by Gaussian integer mentioned above. Moreover, we formalize some definitions about Gaussian rational numbers and Gaussian rational number field. Then we prove that the Gaussian rational number field and a quotient field of the Gaussian integer ring are isomorphic.

General operators binding variables in the interpreted modal calculus 𝒞 ν

Aldo Bressan, Alberto Zanardo (1981)

Atti della Accademia Nazionale dei Lincei. Classe di Scienze Fisiche, Matematiche e Naturali. Rendiconti Lincei. Matematica e Applicazioni

Si considera il calcolo modale interpretato 𝒞 ν , che è basato su un sistema di tipi con infiniti livelli, contiene descrizioni, ed è dotato di una semantica di tipo generale - v. [2], o [3], o [4], o [5]. In modo semplice e naturale si introducono in 𝒞 ν operatori vincolanti variabili, di tipo generale. Per teorie basate sul calcolo logico risultante 𝒞 ν vale un teorema di completezza, che si dimostra in modo immediato sulla base dell'estensione del teorema parziale di completezza stabilito in [11], fatta...

Generalized deductive systems in subregular varieties

Ivan Chajda (2003)

Mathematica Bohemica

An algebra 𝒜 = ( A , F ) is subregular alias regular with respect to a unary term function g if for each Θ , Φ Con 𝒜 we have Θ = Φ whenever [ g ( a ) ] Θ = [ g ( a ) ] Φ for each a A . We borrow the concept of a deductive system from logic to modify it for subregular algebras. Using it we show that a subset C A is a class of some congruence on Θ containing g ( a ) if and only if C is this generalized deductive system. This method is efficient (needs a finite number of steps).

Generalized E-algebras via λ-calculus I

Rüdiger Göbel, Saharon Shelah (2006)

Fundamenta Mathematicae

An R-algebra A is called an E(R)-algebra if the canonical homomorphism from A to the endomorphism algebra E n d R A of the R-module R A , taking any a ∈ A to the right multiplication a r E n d R A by a, is an isomorphism of algebras. In this case R A is called an E(R)-module. There is a proper class of examples constructed in [4]. E(R)-algebras arise naturally in various topics of algebra. So it is not surprising that they were investigated thoroughly in the last decades; see [3, 5, 7, 8, 10, 13, 14, 15, 18, 19]. Despite...

Generalized homogeneous, prelattice and MV-effect algebras

Zdena Riečanová, Ivica Marinová (2005)

Kybernetika

We study unbounded versions of effect algebras. We show a necessary and sufficient condition, when lattice operations of a such generalized effect algebra P are inherited under its embeding as a proper ideal with a special property and closed under the effect sum into an effect algebra. Further we introduce conditions for a generalized homogeneous, prelattice or MV-effect effect algebras. We prove that every prelattice generalized effect algebra P is a union of generalized MV-effect algebras and...

Generated fuzzy implications and fuzzy preference structures

Vladislav Biba, Dana Hliněná (2012)

Kybernetika

The notion of a construction of a fuzzy preference structures is introduced. The properties of a certain class of generated fuzzy implications are studied. The main topic in this paper is investigation of the construction of the monotone generator triplet ( p , i , j ) , which is the producer of fuzzy preference structures. Some properties of mentioned monotone generator triplet are investigated.

Generating methods for principal topologies on bounded lattices

Funda Karaçal, Ümit Ertuğrul, M. Nesibe Kesicioğlu (2021)

Kybernetika

In this paper, some generating methods for principal topology are introduced by means of some logical operators such as uninorms and triangular norms and their properties are investigated. Defining a pre-order obtained from the closure operator, the properties of the pre-order are studied.

Generation of fuzzy mathematical morphologies.

Pedro J. Burillo López, Noé Frago Paños, Ramón Fuentes González (2001)

Mathware and Soft Computing

Fuzzy Mathematical Morphology aims to extend the binary morphological operators to grey-level images. In order to define the basic morphological operations fuzzy erosion, dilation, opening and closing, we introduce a general method based upon fuzzy implication and inclusion grade operators, including as particular case, other ones existing in related literature. In the definition of fuzzy erosion and dilation we use several fuzzy implications (Annexe A, Table of fuzzy implications), the paper includes...

Group of Homography in Real Projective Plane

Roland Coghetto (2017)

Formalized Mathematics

Using the Mizar system [2], we formalized that homographies of the projective real plane (as defined in [5]), form a group. Then, we prove that, using the notations of Borsuk and Szmielew in [3] “Consider in space ℝℙ2 points P1, P2, P3, P4 of which three points are not collinear and points Q1,Q2,Q3,Q4 each three points of which are also not collinear. There exists one homography h of space ℝℙ2 such that h(Pi) = Qi for i = 1, 2, 3, 4.” (Existence Statement 52 and Existence Statement 53) [3]. Or,...

Groups – Additive Notation

Roland Coghetto (2015)

Formalized Mathematics

We translate the articles covering group theory already available in the Mizar Mathematical Library from multiplicative into additive notation. We adapt the works of Wojciech A. Trybulec [41, 42, 43] and Artur Korniłowicz [25]. In particular, these authors have defined the notions of group, abelian group, power of an element of a group, order of a group and order of an element, subgroup, coset of a subgroup, index of a subgroup, conjugation, normal subgroup, topological group, dense subset and basis...

Grzegorczyk’s Logics. Part I

Taneli Huuskonen (2015)

Formalized Mathematics

This article is the second in a series formalizing some results in my joint work with Prof. Joanna Golinska-Pilarek ([9] and [10]) concerning a logic proposed by Prof. Andrzej Grzegorczyk ([11]). This part presents the syntax and axioms of Grzegorczyk’s Logic of Descriptions (LD) as originally proposed by him, as well as some theorems not depending on any semantic constructions. There are both some clear similarities and fundamental differences between LD and the non-Fregean logics introduced by...

Currently displaying 1 – 20 of 21

Page 1 Next