368 search results - page 28 / 74 » Arithmetic as a Theory Modulo |
FOSSACS
2004
Springer
14 years 13 days ago
2004
Springer
We prove that if a finite alphabet of actions contains at least two elements, then the equational theory for the process algebra BCCSP modulo any semantics no coarser than readines...
LATIN
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. We present a probability logic (essentially a first order language extended with quantifiers that count the fraction of elements in a model that satisfy a first order ...
APAL
2011
13 years 3 months ago
2011
We formalize the construction of Paterson’s variant of the Ajtai–Koml´os–Szemer´edi sorting network of logarithmic depth in the bounded arithmetical theory VNC1 ∗ (an ex...
SIGSOFT
2005
ACM
14 years 9 months ago
2005
ACM
We present Arithmetic Program Paths, a novel, efficient way to compress program control-flow traces that reduces program bit traces to less than a fifth of their original size whi...
APAL
2005
13 years 8 months ago
2005
Abstract. There is a very simple way in which the safe/normal variable discipline of Bellantoni-Cook recursion (1992) can be imposed on arithmetical theories like PA: quantify over...