|
Journals in DBLP
Logic, Language, Information and Computation. [Citation Graph (, )][DBLP]
Game-based notions of locality over finite models. [Citation Graph (, )][DBLP]
Choiceless polynomial time, counting and the Cai-Fürer-Immerman graphs. [Citation Graph (, )][DBLP]
Lowness properties and approximations of the jump. [Citation Graph (, )][DBLP]
A quantified logic of evidence. [Citation Graph (, )][DBLP]
Characterising nested database dependencies by fragments of propositional logic. [Citation Graph (, )][DBLP]
System BV is NP-complete. [Citation Graph (, )][DBLP]
Probabilistic verification and approximation. [Citation Graph (, )][DBLP]
Full classical S5 in natural deduction with weak normalization. [Citation Graph (, )][DBLP]
Cut elimination for a simple formulation of epsilon calculus. [Citation Graph (, )][DBLP]
Approximations of modal logics: K and beyond. [Citation Graph (, )][DBLP]
The complexity of random ordered structures. [Citation Graph (, )][DBLP]
|