Your English writing platform
Free sign upSuggestions(2)
Exact(16)
The use of the tautology introduction rule or one of the essentially equivalent rules is the main vehicle of shortening proofs.
In some logic texts, the introduction rule is proved as a "deduction theorem".
For example, the success of the 1-right introduction rule requires that the surrounding context must be empty and the success of the ⊗-right introduction rule can depends on how the agent's surround context is divided into two different sequents.
Prawitz (1985; 2005) argues that any formally suitable introduction rule can fix the meaning for a logical constant.
As a consequence, it destroys the introduction form property that every closed derivation can be reduced to one which uses an introduction rule in the last step.
For example, the agent (B ⅋ C) becomes (by applying the ⅋-right introduction rule) the two agents B and C (now working in parallel).
Similar(44)
r1 uses → E and introduction rules, r2 uses ∧E and introduction rules, and r3 uses both → E and ∧E, and introduction rules.
(i) Either the right-introduction or or the left-introduction rules are considered to be introduction rules.
Now consider a one-sided sequent calculus presentation of linear logic where the only introduction rules are right-introduction rules.
Such clauses can naturally be interpreted as describing introduction rules for atoms.
This means that not the introduction rules are considered basic but the consequences of defining conditions.
Write better and faster with AI suggestions while staying true to your unique style.
Since I tried Ludwig back in 2017, I have been constantly using it in both editing and translation. Ever since, I suggest it to my translators at ProSciEditing.
Justyna Jupowicz-Kozak
CEO of Professional Science Editing for Scientists @ prosciediting.com