A cut-free sequent calculus for the logic of constant domains with a limited amount of duplications (Q4934883)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A cut-free sequent calculus for the logic of constant domains with a limited amount of duplications |
scientific article; zbMATH DE number 1394709
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A cut-free sequent calculus for the logic of constant domains with a limited amount of duplications |
scientific article; zbMATH DE number 1394709 |
Statements
A cut-free sequent calculus for the logic of constant domains with a limited amount of duplications (English)
0 references
30 January 2000
0 references
tableau calculus
0 references
context-rule
0 references
predicate intermediate logic of constant domains
0 references
cut-free sequent calculus
0 references
duplications of formulas
0 references
0.90321267
0 references
0.90079784
0 references
0.9003601
0 references
0.8988209
0 references
0.8975886
0 references
0.89310163
0 references
0.8908684
0 references
0.8899454
0 references
0 references
