Sciweavers

13 search results - page 1 / 3
» Complete Axiomatization of an Algebraic Construction of Grap...
Sort
View
FLOPS
2004
Springer
14 years 4 months ago
Complete Axiomatization of an Algebraic Construction of Graphs
This paper presents a complete (infinite) axiomatization for an algebraic construction of graphs, in which a finite fragment denotes the class of graphs with bounded tree width.
Mizuhito Ogawa
BIRTHDAY
2005
Springer
14 years 4 months ago
Finite Equational Bases in Process Algebra: Results and Open Questions
Abstract. Van Glabbeek (1990) presented the linear time/branching time spectrum of behavioral equivalences for finitely branching, concrete, sequential processes. He studied these...
Luca Aceto, Wan Fokkink, Anna Ingólfsd&oacu...
TYPES
2000
Springer
14 years 2 months ago
A Constructive Proof of the Fundamental Theorem of Algebra without Using the Rationals
Abstract. In the FTA project in Nijmegen we have formalized a constructive proof of the Fundamental Theorem of Algebra. In the formalization, we have first defined the (constructiv...
Herman Geuvers, Freek Wiedijk, Jan Zwanenburg
JSYML
2010
107views more  JSYML 2010»
13 years 9 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
LICS
2008
IEEE
14 years 5 months ago
Nonlocal Flow of Control and Kleene Algebra with Tests
Kleene algebra with tests (KAT) is an equational system for program verification that combines Kleene algebra (KA), or the algebra of regular expressions, with Boolean algebra. I...
Dexter Kozen