368 search results - page 12 / 74 » Arithmetic as a Theory Modulo |
JSYML
2008
13 years 8 months ago
2008
In this paper we give a new proof of the characterization of the closed fragment of the provability logic of Heyting's Arithmetic. We also provide a characterization of the c...
ICCD
2001
IEEE
14 years 5 months ago
2001
IEEE
In 1987 Sedlak proposed a modulo multiplication algorithm which is suitable for smart card implementation due to it’s low latency time. It is based on ZDN (zwei_drittel_N) arith...
JSC
2010
13 years 7 months ago
2010
The topic of this article is decision procedures for satisfiability modulo theories (SMT) of arbitrary quantifier-free formulæ. We propose an approach that decomposes the formu...
ICTAC
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. Model programs are used as high-level behavioral specifications typically representing abstract state machines. For modeling reactive systems, one uses input-output mode...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
G