61 search results - page 2 / 13 » What Is the Problem with Proof Nets for Classical Logic |
RP
2009
Springer
13 years 11 months ago
2009
Springer
In [13], Yen defines a class of formulas for paths in Petri nets and claims that its satisfiability problem is EXPSPACE-complete. In this paper, we show that in fact the satisfi...
APLAS
2010
ACM
13 years 5 months ago
2010
ACM
We describe an approach to using one logic to reason about specifications written in a second logic. One level of logic, called the "reasoning logic", is used to state th...
PPDP
1999
Springer
13 years 9 months ago
1999
Springer
hemical abstract machine Shinya Sato Himeji Dokkyo University, Faculty of Econoinformatics, 7-2-1 Kamiohno, Himeji-shi, Hyogo 670-8524, Japan Ian Mackie LIX, CNRS UMR 7161, ´Ecole...
CLIMA
2004
13 years 6 months ago
2004
Abstract. We present an encoding of a sequent calculus for a multiagent epistemic logic in Athena, an interactive theorem proving system for many-sorted first-order logic. We then ...
CSL
2009
Springer
13 years 8 months ago
2009
Springer
We study the confluence of Ehrhard and Regnier's differential nets with exponential promotion, in a pure setting. Confluence fails with promotion and codereliction in absence ...