Uniform schemata for proof rules

DOI10.1007/978-3-319-08019-2_6MaRDI QIDQ5175877zbMATH OpenOpenAlexFDO

Authors Ulrich Berger, Tie Hou

Publication date 25 February 2015

Published in Language, Life, Limits (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-08019-2_6

zbMATH Keywords

logic of computationproof calculirealizabilitysemantics

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Proof theory in general (including proof-theoretic semantics) (03F03) Structure of proofs (03F07)

Recommendations

• scientific article; zbMATH DE number 1927428
• scientific article; zbMATH DE number 6938205
• Program development schemata as derived rules
• Uniform proofs as a foundation for logic programming
• Cut-elimination and proof schemata

Cited in

(3)

• scientific article; zbMATH DE number 1927428 (Why is no real title available?)
• Unified decomposition-aggregation (UDA) rules: dynamic, schematic, novel axioms
• Form invariance of schema and exact schema theorem

This page was built for publication: Uniform schemata for proof rules

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