Journal of Logic and Computation

Articles

E Ritter, D Pym, and L Wallen

Proof-terms for classical and intuitionistic resolution
J Logic Computation 2000 10: 173-207; doi:10.1093/logcom/10.2.173 [Abstract] [PDF] [Request Permissions]  

JT Baldwin

Stability, the finite cover property and 0-1 laws
J Logic Computation 2000 10: 209-212; doi:10.1093/logcom/10.2.209 [Abstract] [PDF] [Request Permissions]  

S Aguzzoli, A Ciabattoni, and A Di Nola

Sequent calculi for finite-valued Lukasiewicz logics via Boolean decompositions
J Logic Computation 2000 10: 213-222; doi:10.1093/logcom/10.2.213 [Abstract] [PDF] [Request Permissions]  

F Wolter

The product of converse PDL and polymodal K
J Logic Computation 2000 10: 223-251; doi:10.1093/logcom/10.2.223 [Abstract] [PDF] [Request Permissions]  

K Su, H Chen, and D Ding

Two alternative notions of 'possibility' satisfying Halpern's conditions
J Logic Computation 2000 10: 253-269; doi:10.1093/logcom/10.2.253 [Abstract] [PDF] [Request Permissions]  

R Barua, S Roy, and Z Chaochen

Completeness of neighbourhood logic
J Logic Computation 2000 10: 271-295; doi:10.1093/logcom/10.2.271 [Abstract] [PDF] [Request Permissions]  

BO Akinkunmi

On the expressive limits of reified theories
J Logic Computation 2000 10: 297-313; doi:10.1093/logcom/10.2.297 [Abstract] [PDF] [Request Permissions]  

S Thompson

Book review. Twenty-Five Years of Constructive Type Theory. G Sambin, J Smith
J Logic Computation 2000 10: 315-317; doi:10.1093/logcom/10.2.315 [PDF] [Request Permissions]  

Forthcoming Papers
J Logic Computation 2000 10: 319-320; doi:10.1093/logcom/10.2.319 [PDF] [Request Permissions]  

To see an article, click its [Full Text] or [PDF] link. To review many abstracts, check the boxes to the left of the titles you want, and click the 'Get All Checked Abstract(s)' button. To see one abstract at a time, click its [Abstract] link.