A cut-free sequent calculus for the logic of constant domains with a limited amount of duplications

DOI10.1093/JIGPAL/7.6.733zbMath0939.03032OpenAlexW2115028558MaRDI QIDQ4934883

Pierangelo Miglioli, Camillo Fiorentini

Publication date: 30 January 2000

Published in: Logic Journal of IGPL (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/6389afb77abfe4cb43c8c659468a378e7f3b2eed

zbMATH Keywords

tableau calculuscut-free sequent calculuscontext-ruleduplications of formulaspredicate intermediate logic of constant domains

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Intermediate logics (03B55)

Related Items (1)

Nested sequents for intuitionistic logics

This page was built for publication: A cut-free sequent calculus for the logic of constant domains with a limited amount of duplications