Towards a proof theory for quantifier macros

DOI10.1016/j.ic.2021.104753OpenAlexW3158976078WikidataQ113872843 ScholiaQ113872843MaRDI QIDQ2672659

Anela Lolic, Matthias Baaz

Publication date: 13 June 2022

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2021.104753

zbMATH Keywords

sequent calculuscut-eliminationquantifier macros

Mathematics Subject Classification ID

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

Cites Work

• Gentzen calculi for modal propositional logic
• A globally sound analytic calculus for Henkin quantifiers
• Herbrand-Analysen zweier Beweise des Satzes von Roth: Polynomiale Anzahlschranken
• UNSOUND INFERENCES MAKE PROOFS SHORTER
• A Machine-Oriented Logic Based on the Resolution Principle
• Unnamed Item
• Unnamed Item

This page was built for publication: Towards a proof theory for quantifier macros