On intuitionistic branching tense logic with weak induction
In the paper, the first-order branching tense logic calculus is given: LB J with the weak induction, that is to say with the axiom (A ∧ A O ☐ A) ⊃ ☐ A instead of the induction axiom (A ∧ ☐ (A ⊃ O A)) ⊃ ☐ A. The syntactical cut elimination theorem, Harrop's theorem and the interpolation theorem...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Vilnius University Press
1998-12-01
|
| Series: | Lietuvos Matematikos Rinkinys |
| Online Access: | https://ojs.test/index.php/LMR/article/view/37921 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|