Sciweavers

84 search results - page 12 / 17
» An Algebraic Proof of Deuber's Theorem
Sort
View
ACTA
2010
81views more  ACTA 2010»
13 years 8 months ago
Lifting non-finite axiomatizability results to extensions of process algebras
Abstract This paper presents a general technique for obtaining new results pertaining to the non-finite axiomatizability of behavioral semantics over process algebras from old ones...
Luca Aceto, Wan Fokkink, Anna Ingólfsd&oacu...
ATVA
2008
Springer
143views Hardware» more  ATVA 2008»
13 years 10 months ago
Automating Algebraic Specifications of Non-freely Generated Data Types
Abstract. Non-freely generated data types are widely used in case studies carried out in the theorem prover KIV. The most common examples are stores, sets and arrays. We present an...
Andriy Dunets, Gerhard Schellhorn, Wolfgang Reif
FCT
1999
Springer
14 years 21 days ago
On Recognizable Languages in Divisibility Monoids
Kleene’s theorem on recognizable languages in free monoids is considered to be of eminent importance in theoretical computer science. It has been generalized into various directi...
Manfred Droste, Dietrich Kuske
JSYML
2010
107views more  JSYML 2010»
13 years 6 months ago
A proof of completeness for continuous first-order logic
Continuous first-order logic has found interest among model theorists who wish to extend the classical analysis of “algebraic” structures (such as fields, group, and graphs) ...
Arthur Paul Pedersen, Itay Ben-Yaacov
COMBINATORICS
2006
126views more  COMBINATORICS 2006»
13 years 8 months ago
Constructions of Representations of Rank Two Semisimple Lie Algebras with Distributive Lattices
We associate one or two posets (which we call "semistandard posets") to any given irreducible representation of a rank two semisimple Lie algebra over C. Elsewhere we ha...
L. Wyatt Alverson II, Robert G. Donnelly, Scott J....