179
click to vote
LICS
15 years 7 months ago
1995 IEEE 
We present new proofs of cut elimination for intuitionistic, classical, and linear sequent calculi. In all cases the proofs proceed by three nested structural inductions, avoiding...
125
click to vote
LICS
15 years 7 months ago
1995 IEEE 
We prove that tree isomorphism is not expressible in the language (FO + TC + COUNT). This is surprising since in the presence of ordering the language captures NL, whereas tree is...
120
click to vote
LICS
15 years 7 months ago
1995 IEEE
The decision problem is studied for fragments of second-order linear logic without modalities. It is shown that the structural rules of contraction and weakening may be simulated ...
|
Automated Reasoning