Cut-elimination and interpolation for -logic

DOI10.1007/BF01620764MaRDI QIDQ1114684zbMATH OpenOpenAlexFDO

Authors Jacqueline Vauzeilles

Publication date 1988

Published in Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01620764

zbMATH Keywords

category of well-founded ordersGirard's \(\Omega\)-logic

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05)

Review text

Girard's \(\Omega\)-logic is based on the category of well-founded orders, while his \(\beta\)-logic is based on the category of ordinals. Here Girard's (unpublished) results are extended from \(\beta\)-logic to \(\Omega\)-logic.

Recommendations

• Full cut elimination and interpolation for intuitionistic logic with existence predicate
• Cut Elimination in ε‐Calculi
• Bounds for cut elimination in intuitionistic propositional logic
• scientific article; zbMATH DE number 48659
• Cut elimination, identity elimination, and interpolation in super-Belnap logics
• Publication:3475264
• Cut-elimination and a permutation-free sequent calculus for intuitionistic logic
• Cut elimination in nested sequents for intuitionistic modal logics
• A cut-elimination proof in intuitionistic predicate logic
• Cut Elimination and Decidability for Classical Lambek Logic

Cites work

• Functorial bounds for cut elimination inL βω . I
• scientific article; zbMATH DE number 4033738 (Why is no real title available?)

Cited in

(4)

• Cut-elimination for \(\omega_{1}\)
• Cut-elimination for knowledge logics with interaction
• Functorial bounds for cut elimination inL βω . I
• MacNeille Completion and Buchholz' Omega Rule for Parameter-Free Second Order Logics

This page was built for publication: Cut-elimination and interpolation for \(\Omega\)-logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1114684)