40 search results - page 5 / 8 » On Beta-Shifts Having Arithmetical Languages |
CSL
2010
Springer
13 years 8 months ago
2010
Springer
By a Euclidean logic, we understand a formal language whose variables range over subsets of Euclidean space, of some fixed dimension, and whose non-logical primitives have fixed me...
LATA
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Motivated by strong Karp-Lipton collapse results in bounded arithmetic, Cook and Kraj´ıˇcek [7] have recently introduced the notion of propositional proof systems with...
TACAS
2007
Springer
14 years 1 months ago
2007
Springer
Reasoning about heap-allocated data structures such as linked lists and arrays is challenging. The reachability predicate has proved to be useful for reasoning about the heap in ty...
SAT
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. SAT Modulo Theories (SMT) consists of deciding the satisfiability of a formula with respect to a decidable background theory, such as linear integer arithmetic, bit-vect...
ESOP
2009
Springer
14 years 2 months ago
2009
Springer
Just as some functions have uniform behavior over distinct types, other functions have uniform behavior over distinct arities. These variable-arity functions are widely used in scr...