247 search results - page 21 / 50 » A Computational Structure for the Propositional Calculus |
ENTCS
1998
15 years 5 days ago
1998
We obtain a new formalism for concurrent object-oriented languages by extending Abadi and Cardelli's imperative object calculus with operators for concurrency from the -calc...
107
Voted
JAR
2002
15 years 5 days ago
2002
Abstract. Can theorem proving in mathematical logic be addressed by classical mathematical techniques like the calculus of variations? The answer is surprisingly in the affirmative...
89
Voted
APAL
2000
15 years 10 days ago
2000
It is shown how to restrict recursion on notation in all finite types so as to characterize the polynomial time computable functions. The restrictions are obtained by using a rami...
AAAI
2006
15 years 1 months ago
2006
Some search problems are most directly specified by boolean combinations of pseudo-boolean constraints. We study a logic PL(PB) whose formulas are of this form, and design local-s...
107
Voted
ENTCS
2008
15 years 17 days ago
2008
We study the algebraic structure of directed bigraphs, a bigraphical model of computations with locations, connections and resources previously introduced as a unifying generaliza...