72 search results - page 4 / 15 » Proving Consistency of Equational Theories in Bounded Arithm... |
112
Voted
IANDC
2008
14 years 11 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...
68
Voted
MLQ
1998
14 years 11 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...
96
Voted
MLQ
2010
14 years 10 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...
77
Voted
JSYML
2007
14 years 11 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
14 years 11 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...