72 search results - page 4 / 15 » Proving Consistency of Equational Theories in Bounded Arithm... |
IANDC
2008
13 years 7 months ago
2008
We are interested in the design of automated procedures for analyzing the (in)security of cryptographic protocols in the Dolev-Yao model for a bounded number of sessions when we t...
MLQ
1998
13 years 7 months ago
1998
We develop arithmetical measure theory along the lines of Lutz [10]. This yields the same notion of “measure 0 set” as considered before by Martin-L¨of, Schnorr, and others. W...
MLQ
2010
13 years 5 months ago
2010
We investigate the provability of some properties of abelian groups and quadratic residues in variants of bounded arithmetic. Specifically, we show that the structure theorem for...
JSYML
2007
13 years 7 months ago
2007
A Turing degree d is homogeneous bounding if every complete decidable (CD) theory has a d-decidable homogeneous model A, i.e., the elementary diagram De (A) has degree d. It follo...
COMPUTING
2006
13 years 7 months ago
2006
The idea of containment sets (csets) is due to Walster and Hansen, and the theory is mainly due to the first author. Now that floating point computation with infinities is widely a...