Cut-free sequent calculi for the predicate intermediate logic CD of constant domains have appeared only very recently in literature, even if this logic has been axiomatized since the early seventies. In the present paper we propose a different cut-free sequent calculus for CD, in which a great care is devoted in avoiding duplications of formulas.
A cut-free sequent calculus for the logic of constant domains with a limited amount of duplications / C. Fiorentini, P. Miglioli. - In: LOGIC JOURNAL OF THE IGPL. - ISSN 1367-0751. - 7:6(1999), pp. 733-753. [10.1093/jigpal/7.6.733]
A cut-free sequent calculus for the logic of constant domains with a limited amount of duplications
C. FiorentiniPrimo
;
1999
Abstract
Cut-free sequent calculi for the predicate intermediate logic CD of constant domains have appeared only very recently in literature, even if this logic has been axiomatized since the early seventies. In the present paper we propose a different cut-free sequent calculus for CD, in which a great care is devoted in avoiding duplications of formulas.File in questo prodotto:
File | Dimensione | Formato | |
---|---|---|---|
1999_igpl.pdf
accesso aperto
Tipologia:
Publisher's version/PDF
Dimensione
230.37 kB
Formato
Adobe PDF
|
230.37 kB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.