نتایج جستجو برای: stone duality

تعداد نتایج: 47413  

Nader Khedri

The aim of this study is to investigate the effects of corporate governance mechanisms in preventing the bankruptcy of companies listed in Tehran Stock Exchange. For this purpose, corporate governance mechanisms, including institutional ownership, non-executive members of the board, CEO dual responsibility and free float stock are determined as independent variables and Bankruptcy based on the ...

2009
Jean-Éric Pin

This survey paper presents the success story of the topological approach to automata theory. It is based on profinite topologies, which are built from finite topogical spaces. The survey includes several concrete applications to automata theory. In mathematics, p-adic analysis is a powerful tool of number theory. The p-adic topology is the emblematic example of a profinite topology, a topology ...

2016
Mai Gehrke Daniela Petrisan Luca Reggio

Starting from Boolean algebras of languages closed under quotients and using duality theoretic insights, we derive the notion of Boolean spaces with internal monoids as recognisers for arbitrary formal languages of finite words over finite alphabets. This leads to recognisers and syntactic spaces equivalent to those proposed in [8], albeit in a setting that is well-suited for applying existing ...

2008
Damien A. Easson

We initiate the study of Brane Gas Cosmology (BGC) on manifolds with non-trivial holonomy. Such compactifications are required within the context of superstring theory in order to make connections with realistic particle physics. We study the dynamics of brane gases constructed from various string theories on background spaces having a K3 submanifold. The K3 compactifications provide a stepping...

Journal: :J. Log. Comput. 2007
Stefano Aguzzoli Manuela Busaniche Vincenzo Marra

In nilpotent minimum logic, the conjunction is semantically interpreted by a left-continuous (but not continuous) triangular norm; implication is obtained through residuation. We shall focus attention on finitely axiomatized theories in nilpotent minimum logic; their algebraic counterparts are finite NM-algebras. Building on results in [1] and [2], we establish a spectral (or Stone-type) dualit...

2009
BENJAMIN STEINBERG

Let K be a commutative ring with unit and S an inverse semigroup. We show that the semigroup algebra KS can be described as a convolution algebra of functions on the universal étale groupoid associated to S by Paterson. This result is a simultaneous generalization of the author’s earlier work on finite inverse semigroups and Paterson’s theorem for the universal C-algebra. It provides a convenie...

1993
PIETRO DI GIANANTONIO

The aim of this paper is to give an alternative description of the game semantics (). The main idea is to mimic, in the game semantics setting, a duality existing in domain theory. In domain theory, the denotational semantics of a language can be given in two forms: a term can be interpreted by some point in a particular domain, or by a set of properties. The Stone-duality theorems, for domain ...

1992
Marta Kwiatkowska

In concurrent constraint programming, divergence (i.e. an innnite computation) and failure are often identiied. This is undesirable when modelling systems in which innnite behaviour arises naturally. This paper sets out a framework for an axiomatic and denotational view of concurrent constraint programming, and considers the relationship of both views as an instance of Stone duality. We propose...

Journal: :Fuzzy Sets and Systems 2011
David Buhagiar Emmanuel Chetcuti Anatolij Dvurecenskij

Recently Flaminio and Montagna, [FlMo], extended the language of MV-algebras by adding a unary operation, called a state-operator. This notion is introduced here also for effect algebras. Having it, we generalize the Loomis–Sikorski Theorem for monotone σ-complete effect algebras with internal state. In addition, we show that the category of divisible state-morphism effect algebras satisfying (...

Journal: :Fundam. Inform. 2006
Pascal Hitzler Markus Krötzsch Guo-Qiang Zhang

Formal concept analysis has grown from a new branch of the mathematical field of lattice theory to a widely recognized tool in Computer Science and elsewhere. In order to fully benefit from this theory, we believe that it can be enriched with notions such as approximation by computation or representability. The latter are commonly studied in denotational semantics and domain theory and captured...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید