16626 search results - page 206 / 3326 » Computing is a natural science |
125
click to vote
CSR
2009
Springer
16 years 1 months ago
2009
Springer
We apply the semantic tool of non-deterministic matrices to characterize two important properties of canonical Gentzen-type calculi: invertibility of rules and axiom expansion. We ...
159
click to vote
STACS
2007
Springer
16 years 22 days ago
2007
Springer
We consider Sturmian trees as a natural generalization of Sturmian words. A Sturmian tree is a tree having n+1 distinct subtrees of height n for each n. As for the case of words, S...
155
click to vote
RTA
2005
Springer
16 years 3 days ago
2005
Springer
Abstract. We show that the structures of binding algebras and Σmonoids by Fiore, Plotkin and Turi are sound and complete models of Klop’s Combinatory Reduction Systems (CRSs). T...
153
click to vote
FOCS
1989
IEEE
15 years 10 months ago
1989
IEEE
We introduce a temporal logic for the speci cation of real-time systems. Our logic, TPTL, employs a novel quanti er construct for referencing time: the freeze quanti er binds a var...
169
click to vote
CSR
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We prove a conjecture by A. Pnueli and strengthen it showing a sequence of "counting modalities" none of which is expressible in the temporal logic generated by...