421 search results - page 24 / 85 » CSL |
155
click to vote
CSL
2005
Springer
15 years 11 months ago
2005
Springer
We show that the modular decomposition of a countable graph can be defined from this graph, given with an enumeration of its set of vertices, by formulas of Monadic Second-Order l...
136
click to vote
CSL
2005
Springer
15 years 11 months ago
2005
Springer
We consider the setting of L-nets, recently introduced by Faggian and Maurel as a game model of concurrent interaction and based on Girard’s Ludics. We show how L-nets satisfying...
147
click to vote
CSL
2004
Springer
15 years 11 months ago
2004
Springer
By viewing random 3-SAT as a distributional problem, we go over some of the notions of average-case complexity that were considered in the literature. We note that for dense formul...
170
click to vote
CSL
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. We show how to automatically generate analytic hypersequent calculi for a large class of logics containing the linearity axiom (lin) (A ⊃ B) ∨ (B ⊃ A) starting from...
152
click to vote
CSL
2004
Springer
15 years 11 months ago
2004
Springer
Interpretation of Proofs: Classical Propositional Calculus Martin Hyland DPMMS, Centre for Mathematical Sciences, University of Cambridge, England Representative abstract interpret...