Previous Page 20

Displaying 381 – 394 of 394

Showing per page

Automorphisms of concrete logics

Mirko Navara, Josef Tkadlec (1991)

Commentationes Mathematicae Universitatis Carolinae

The main result of this paper is Theorem 3.3: Every concrete logic (i.e., every set-representable orthomodular poset) can be enlarged to a concrete logic with a given automorphism group and with a given center. Since every sublogic of a concrete logic is concrete, too, and since not every state space of a (general) quantum logic is affinely homeomorphic to the state space of a concrete logic [8], our result seems in a sense the best possible. Further, we show that every group is an automorphism...

Automorphisms of ( λ ) / κ

Paul Larson, Paul McKenney (2016)

Fundamenta Mathematicae

We study conditions on automorphisms of Boolean algebras of the form ( λ ) / κ (where λ is an uncountable cardinal and κ is the ideal of sets of cardinality less than κ ) which allow one to conclude that a given automorphism is trivial. We show (among other things) that every automorphism of ( 2 κ ) / κ which is trivial on all sets of cardinality κ⁺ is trivial, and that M A implies both that every automorphism of (ℝ)/Fin is trivial on a cocountable set and that every automorphism of (ℝ)/Ctble is trivial.

Autour des groupes cycliquement ordonnés

G. Leloup (2012)

Annales de la faculté des sciences de Toulouse Mathématiques

Ce travail commence par rappeler les définitions et les résultats de base concernant les groupes cycliquement ordonnés, et mentionner différents domaines où ils apparaissent. Ensuite sont exposés quelques développements, notamment sur la théorie du premier ordre, les séries formelles à exposants dans un groupe cycliquement ordonné, les groupes valués dont la valuation est à valeurs dans un ensemble cycliquement ordonné, et un analogue pour les espaces ultramétriques.

Averaging premises.

Enric Trillas, Elena E. Castiñeira, Susana Cubillo (2001)

Mathware and Soft Computing

This paper deals with the sets of strict conjectures and consequences of a given collection P of premises. The set of Averaging Functions is introduced on lattices and some properties of these functions are shown. Averaging Functions allow to interpret restricted consequences as averages of premises. The subset of consequences C9*(P) and the subset of conjectures Φg*(P) defined by means of the averaging function g are introduced, and their properties are studied. This sets allow to give decomposition...

A-Verbände I

M. Stern, A. KERTÉSZ (1971)

Beiträge zur Algebra und Geometrie = Contributions to algebra and geometry

A-Verbände II

M. Stern, A. KERTÉSZ (1974)

Beiträge zur Algebra und Geometrie = Contributions to algebra and geometry

Axiom T D and the Simmons sublocale theorem

Jorge Picado, Aleš Pultr (2019)

Commentationes Mathematicae Universitatis Carolinae

More precisely, we are analyzing some of H. Simmons, S. B. Niefield and K. I. Rosenthal results concerning sublocales induced by subspaces. H. Simmons was concerned with the question when the coframe of sublocales is Boolean; he recognized the role of the axiom T D for the relation of certain degrees of scatteredness but did not emphasize its role in the relation between sublocales and subspaces. S. B. Niefield and K. I. Rosenthal just mention this axiom in a remark about Simmons’ result. In this...

Axiomatizing omega and omega-op powers of words

Stephen L. Bloom, Zoltán Ésik (2004)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

In 1978, Courcelle asked for a complete set of axioms and rules for the equational theory of (discrete regular) words equipped with the operations of product, omega power and omega-op power. In this paper we find a simple set of equations and prove they are complete. Moreover, we show that the equational theory is decidable in polynomial time.

Axiomatizing omega and omega-op powers of words

Stephen L. Bloom, Zoltán Ésik (2010)

RAIRO - Theoretical Informatics and Applications

In 1978, Courcelle asked for a complete set of axioms and rules for the equational theory of (discrete regular) words equipped with the operations of product, omega power and omega-op power. In this paper we find a simple set of equations and prove they are complete. Moreover, we show that the equational theory is decidable in polynomial time.

Axiomatizing quantum MV-algebras.

Roberto Giuntini (1997)

Mathware and Soft Computing

We introduce the notion of p-ideal of a QMV-algebra and we prove that the class of all p-ideals of a QMV-algebra M is in one-to-one correspondence with the class of all congruence relations of M.

Currently displaying 381 – 394 of 394

Previous Page 20