INVERSION BY DEFINITIONAL REFLECTION AND THE ADMISSIBILITY OF LOGICAL RULES

DOI10.1017/S1755020309990165zbMath1185.03083MaRDI QIDQ3644805

Thomas Piecha, Wagner de Campos Sanz

Publication date: 12 November 2009

Published in: The Review of Symbolic Logic (Search for Journal in Brave)

zbMATH Keywords

inversion of rules

Mathematics Subject Classification ID

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

Related Items (3)

Failure of completeness in proof-theoretic semantics ⋮ Generalized Elimination Inferences, Higher-Level Rules, and the Implications-as-Rules Interpretation of the Sequent Calculus ⋮ Steps towards a proof-theoretical semantics

Uses Software

• Pesca

Cites Work

• Unnamed Item
• Proof theory for admissible rules
• Partial inductive definitions
• Natural deduction with general elimination rules
• Untersuchungen über das logische Schliessen. I
• Generalized definitional reflection and the inversion principle
• On the admissible rules of intuitionistic propositional logic
• A Proof-Theoretic Approach to Logic Programming. I. Clauses as Rules
• Independent Bases of Admissible Rules
• On Inversion Principles
• A natural extension of natural deduction
• A Proof-Theoretic Approach to Logic Programming
• Preservativity logic: An analogue of interpretability logic for constructive theories

This page was built for publication: INVERSION BY DEFINITIONAL REFLECTION AND THE ADMISSIBILITY OF LOGICAL RULES