Ruess, H.; Shankar, N.
Page(s): 19-28
Digital Object Identifier 10.1109/LICS.2001.932479 Abstract
| Full Text: PDF (768 KB)
Rights and Permissions
A decision procedure for an extensional theory of arrays
Stump, A.; Barrett, C.W.; Dill, D.L.; Levitt, J.
Page(s): 29-37
Digital Object Identifier 10.1109/LICS.2001.932480 Abstract
| Full Text: PDF (604 KB)
Rights and Permissions
On ordering constraints for deduction with built-in Abelian
semigroups, monoids and groups
Godoy, G.; Nieuwenhuis, R.
Page(s): 38-47
Digital Object Identifier 10.1109/LICS.2001.932481 Abstract
| Full Text: PDF (788 KB)
Rights and Permissions
Successive approximation of abstract transition relations
Das, S.; Dill, D.L.
Page(s): 51-58
Digital Object Identifier 10.1109/LICS.2001.932482 Abstract
| Full Text: PDF (564 KB)
Rights and Permissions
A bound on attacks on payment protocols
Stoller, S.D.
Page(s): 61-70
Digital Object Identifier 10.1109/LICS.2001.932483 Abstract
| Full Text: PDF (796 KB)
Rights and Permissions
A dichotomy in the complexity of propositional circumscription
Kirousis, L.M.; Lolaitis, P.G.
Page(s): 71-80
Digital Object Identifier 10.1109/LICS.2001.932484 Abstract
| Full Text: PDF (880 KB)
Rights and Permissions
Relating semantic and proof-theoretic concepts for polynomial time
decidability of uniform word problems
Ganzinger, H.
Page(s): 81-90
Digital Object Identifier 10.1109/LICS.2001.932485 Abstract
| Full Text: PDF (856 KB)
Rights and Permissions
Semantics of name and value passing
Firore, M.; Turi, D.
Page(s): 93-104
Digital Object Identifier 10.1109/LICS.2001.932486 Abstract
| Full Text: PDF (764 KB)
Rights and Permissions
A fully abstract game semantics of local exceptions
A universal characterization of the closed Euclidean interval
Escardo, M.H.; Simpson, A.K.
Page(s): 115-125
Digital Object Identifier 10.1109/LICS.2001.932488 Abstract
| Full Text: PDF (824 KB)
Rights and Permissions
Logician in the land of OS: abstract state machines in Microsoft
Gurevich, Y.
Page(s): 129-136
Digital Object Identifier 10.1109/LICS.2001.932489 Abstract
| Full Text: PDF (544 KB)
Rights and Permissions
Eliminating definitions and Skolem functions in first-order logic
Avigad, J.
Page(s): 139-146
Digital Object Identifier 10.1109/LICS.2001.932490 Abstract
| Full Text: PDF (528 KB)
Rights and Permissions
On the decision problem for the guarded fragment with transitivity
Szwast, W.; Tendera, L.
Page(s): 147-156
Digital Object Identifier 10.1109/LICS.2001.932491 Abstract
| Full Text: PDF (756 KB)
Rights and Permissions
The hierarchy inside closed monadic Σ1 collapses
on the infinite binary tree
Arnold, A.; Lenzi, G.; Marcinkowski, J.
Page(s): 157-166
Digital Object Identifier 10.1109/LICS.2001.932492 Abstract
| Full Text: PDF (764 KB)
Rights and Permissions
On definability of order in logic with choice
Huuskonen, T.; Hyttinen, T.
Page(s): 167-172
Digital Object Identifier 10.1109/LICS.2001.932493 Abstract
| Full Text: PDF (456 KB)
Rights and Permissions
A second-order system for polytime reasoning using Gradel's theorem
Cook, S.; Kolokova, A.
Page(s): 177-186
Digital Object Identifier 10.1109/LICS.2001.932495 Abstract
| Full Text: PDF (784 KB)
Rights and Permissions
The Crane Beach Conjecture
Barrington, D.A.; Immerman, N.; Lautemann, C.; Schweikardt, N.; Therien, D.
Page(s): 187-196
Digital Object Identifier 10.1109/LICS.2001.932496 Abstract
| Full Text: PDF (740 KB)
Rights and Permissions
“An n! lower bound on formula size”
Adler, M.; Immerman, N.
Page(s): 197-206
Digital Object Identifier 10.1109/LICS.2001.932497 Abstract
| Full Text: PDF (744 KB)
Rights and Permissions
Light affine lambda calculus and polytime strong normalization
Cart
