Sciweavers

10 search results - page 2 / 2
» Greibach Normal Form in Algebraically Complete Semirings
Sort
View
MCMASTER
1993
13 years 10 months ago
A Taste of Rewrite Systems
Abstract. This survey of the theory and applications of rewriting with equations discusses the existence and uniqueness of normal forms, the Knuth-Bendix completion procedure and i...
Nachum Dershowitz
IGPL
2010
156views more  IGPL 2010»
13 years 4 months ago
Fusion of sequent modal logic systems labelled with truth values
Fusion is a well-known form of combining normal modal logics endowed with a Hilbert calculi and a Kripke semantics. Herein, fusion is studied over logic systems using sequent calc...
João Rasga, Karina Roggia, Cristina Sernada...
JSYML
2008
66views more  JSYML 2008»
13 years 5 months ago
Special groups whose isometry relation is a finite union of cosets
0-stable 0-categorical linked quaternionic mappings are studied and are shown to correspond (in some sense) to special groups which are 0stable, 0-categorical, satisfy AP(3) and ha...
Vincent Astier
DEXA
2000
Springer
147views Database» more  DEXA 2000»
13 years 10 months ago
Lattice-Structured Domains, Imperfect Data and Inductive Queries
The relational model, as proposed by Codd, contained the concept of relations as tables composed of tuples of single valued attributes taken from a domain. In most of the early lit...
Sally Rice, John F. Roddick
APAL
2010
115views more  APAL 2010»
13 years 6 months ago
Kripke semantics for provability logic GLP
A well-known polymodal provability logic GLP is complete w.r.t. the arithmetical semantics where modalities correspond to reflection principles of restricted logical complexity in...
Lev D. Beklemishev