Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnnals of Pure and Applied Logic, Volume 130
Volume 130, Numbers 1-3, December 2004
Papers presented at the 2002 IEEE Symposium on Logic in Computer Science (LICS)
- Gordon D. Plotkin:
Foreword. 1- - Markus Frick, Martin Grohe
:
The complexity of first-order and monadic second-order logic revisited. 3-31 - Guillem Godoy, Ashish Tiwari, Rakesh M. Verma:
Deciding confluence of certain term rewriting systems in polynomial time. 33-59 - Stephan Kreutzer:
Expressive equivalence of least and inflationary fixed-point logic. 61-78 - Olivier Laurent:
Polarized games. 79-123 - C.-H. Luke Ong:
An approach to deciding the observational equivalence of Algol-like languages. 125-171 - Martin Otto:
Modal and guarded characterisation theorems over finite transition systems. 173-205 - Alex K. Simpson:
Computational adequacy for recursive types in models of intuitionistic set theory. 207-275 - Michael Soltys, Stephen A. Cook:
The proof complexity of linear algebra. 277-323 - Richard Statman:
On the lambdaY calculus. 325-337
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-07-19 19:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
