532 search results - page 72 / 107 » The Logic of Quasi-MV Algebras |
FSTTCS
1993
Springer
14 years 2 months ago
1993
Springer
Abstract. We provide a complete system of transformation rules for semantic unification with respect to theories defined by convergent rewrite systems. We show that this standard u...
APSEC
2003
IEEE
14 years 1 months ago
2003
IEEE
Using the language Z for more than specification is hindered by the fact that its algebra of schemas is not monotonic with respect to refinement; so specification is modular, but ...
AML
2006
13 years 10 months ago
2006
Simpson introduced the lattice P of 0 1 classes under Medvedev reducibility. Questions regarding completeness in P are related to questions about measure and randomness. We presen...
ICCAD
2004
IEEE
14 years 6 months ago
2004
IEEE
Polynomial expressions are used to compute a wide variety of mathematical functions commonly found in signal processing and graphics applications, which provide good opportunities...
LPAR
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. We present Zenon, an automated theorem prover for first order classical logic (with equality), based on the tableau method. Zenon is intended to be the dedicated prover ...