AbstractWe consider modal analogues of Hintikka et al.'s ‘independence-friendly first-order logic’, and discuss their relationship to equivalences previously studied in concurrency theory
This dissertation describes three distinct but complementary ways in which epistemic reasoning plays...
We start from two closure operators defined on the elements of a special kind of partially ordered...
AbstractWe present an approach to linear logic planning where an explicit correspondence between par...
EP/G012962/1In concurrency theory—the branch of (theoretical) computer science that studies the logi...
AbstractWe consider modal analogues of Hintikka et al.'s ‘independence-friendly first-order logic’, ...
Based on a simple axiomatization of concurrent behaviour we define two ways of observing parallel co...
Herbrand's theorem, widely regarded as a cornerstone of proof theory, exposes some of the constructi...
International audienceHerbrand's theorem, widely regarded as a cornerstone of proof theory, exposes ...
In concurrency, processes can be studied using a partial order or an interleaving semantics. In part...
AbstractA simple domain theory for concurrency is presented. Based on a categorical model of linear ...
In a recent paper by Joyal, Nielsen, and Winskel, bisimulation is defined in an abstract and unifor...
We propose a logic for true concurrency whose formulae predicate about events in computations and th...
Herbrand\u27s theorem, widely regarded as a cornerstone of proof theory, exposes some of the constru...
Independence between two sets of random variables is a well-known relation in probability theory. It...
A simple domain theory for concurrency is presented. Based on a categorical model of linear logic an...
This dissertation describes three distinct but complementary ways in which epistemic reasoning plays...
We start from two closure operators defined on the elements of a special kind of partially ordered...
AbstractWe present an approach to linear logic planning where an explicit correspondence between par...
EP/G012962/1In concurrency theory—the branch of (theoretical) computer science that studies the logi...
AbstractWe consider modal analogues of Hintikka et al.'s ‘independence-friendly first-order logic’, ...
Based on a simple axiomatization of concurrent behaviour we define two ways of observing parallel co...
Herbrand's theorem, widely regarded as a cornerstone of proof theory, exposes some of the constructi...
International audienceHerbrand's theorem, widely regarded as a cornerstone of proof theory, exposes ...
In concurrency, processes can be studied using a partial order or an interleaving semantics. In part...
AbstractA simple domain theory for concurrency is presented. Based on a categorical model of linear ...
In a recent paper by Joyal, Nielsen, and Winskel, bisimulation is defined in an abstract and unifor...
We propose a logic for true concurrency whose formulae predicate about events in computations and th...
Herbrand\u27s theorem, widely regarded as a cornerstone of proof theory, exposes some of the constru...
Independence between two sets of random variables is a well-known relation in probability theory. It...
A simple domain theory for concurrency is presented. Based on a categorical model of linear logic an...
This dissertation describes three distinct but complementary ways in which epistemic reasoning plays...
We start from two closure operators defined on the elements of a special kind of partially ordered...
AbstractWe present an approach to linear logic planning where an explicit correspondence between par...
DOI
Add to ORKG