### Table A.1: The sequent calculus for classical linear logic LL

### Table A.1: The sequent calculus for classical linear logic LL

2000

### Table A.1: The sequent calculus for classical linear logic LL

### Table 2. Classical multiplicative-exponential linear logic with n-ary contraction

in Strong Normalization of Explicit Substitutions via Cut Elimination in Proof Nets (Extended Abstract)

1997

Cited by 22

### Table 3: Classical multiplicative-exponential linear logic with n-ary contraction

### Table 1 : Representing uncertainty with classical logic

"... In PAGE 2: ... Probabilistic Argumentation Systems Classical logic cannot be used to represent, handle and compute numerical uncertainty [vR86], nevertheless, it is one of the simplest as well as one of the most powerful ways to encode knowledge, for the purpose of reasoning (making inferences) from that knowledge. But is it really impossible to represent uncertainty with classical logic ? In fact, if we add a certain type of propositional symbols called assumptions to represent uncertainty, we can model uncertain facts and rules, as shown in Table1 . Facts and rules are true under the condition that specific assumptions are true.... ..."

### Table 3: The models of the document 100 in the Classical Logic

1998

Cited by 28

### Table 4: Evaluation of different queries in Classical Logic

1998

Cited by 28