Sciweavers

532 search results - page 66 / 107
» The Logic of Quasi-MV Algebras
Sort
View
ISSAC
1997
Springer
105views Mathematics» more  ISSAC 1997»
14 years 2 months ago
Guarded Expressions in Practice
Computer algebra systems typically drop some degenerate cases when evaluating expressions, e.g., x=x becomes 1 dropping the case x = 0. We claim that it is feasible in practice to...
Andreas Dolzmann, Thomas Sturm
CORR
2010
Springer
120views Education» more  CORR 2010»
13 years 10 months ago
State machine models of timing and circuit design
This paper illustrates a technique for specifying the detailed timing, logical operation, and compositional circuit design of digital circuits in terms of ordinary state machines w...
Victor Yodaiken
APAL
2010
115views more  APAL 2010»
13 years 10 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
IGPL
2010
156views more  IGPL 2010»
13 years 8 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
2000
69views more  JSYML 2000»
13 years 9 months ago
Topological Elementary Equivalence of Closed Semi-Algebraic Sets in The Real Plane
We investigate topological properties of subsets S of the real plane, expressed by first-order logic sentences in the language of the reals augmented with a binary relation symbol...
Bart Kuijpers, Jan Paredaens, Jan Van den Bussche