Normalization theorems for full first order classical natural deduction
From MaRDI portal
Recommendations
- A semantical proof of the strong normalization theorem for full propositional classical natural deduction
- Strong normalization of classical natural deduction with disjunctions
- Proofs of strong normalisation for second order classical natural deduction
- A normalization-procedure for the first order classical natural deduction with full logical symbols
Cites work
Cited in
(39)- Subformula and separation properties in natural deduction via small Kripke models
- On natural deduction in classical first-order logic: Curry-Howard correspondence, strong normalization and Herbrand's theorem
- Proofs of strong normalisation for second order classical natural deduction
- A normalization-procedure for the first order classical natural deduction with full logical symbols
- Normality, non-contamination and logical depth in classical natural deduction
- Normalisation and subformula property for a system of classical logic with Tarski's rule
- Church-Rosser property of a simple reduction for full first-order classical natural deduction
- Normalisation for negative free logics without and with definite descriptions
- Normal derivability in classical natural deduction
- scientific article; zbMATH DE number 3853043 (Why is no real title available?)
- Postponement of $\mathsf {raa}$ and Glivenko's theorem, revisited
- Normal natural deduction proofs (in classical logic)
- Peirce's rule in a full natural deduction system
- Peirce's rule in natural deduction.
- A note on strong normalization in classical natural deduction
- Problems of a proof-theoretic characterization of paradoxes
- The normalization theorem for extended natural deduction
- Proof-theoretic semantics: an autobiographical survey
- A short proof of the strong normalization of classical natural deduction with disjunction
- A classical first-order normalization procedure with and based on the Milne-Kürbis approach
- HARMONISING HARMONY
- scientific article; zbMATH DE number 1406467 (Why is no real title available?)
- A normative model of classical reasoning in higher order languages
- Transformations via Geometric Perspective Techniques Augmented with Cycles Normalization
- scientific article; zbMATH DE number 1189064 (Why is no real title available?)
- Reduction in first-order logic compared with reduction in implicational logic
- A NORMAL FORM THEOREM FOR SECOND-ORDER CLASSICAL LOGIC WITH AN AXIOM OF CHOICE
- A semantical proof of the strong normalization theorem for full propositional classical natural deduction
- A new S4 classical modal logic in natural deduction
- Full classical S5 in natural deduction with weak normalization
- A note on how to extend Gentzen's second consistency proof to a proof of normalization for first order arithmetic
- Realizability Proof for Normalization of Full Differential Linear Logic
- Bilateralism does not provide a proof theoretic treatment of classical logic (for technical reasons)
- scientific article; zbMATH DE number 3950526 (Why is no real title available?)
- Unified natural deduction for logics of strong negation
- Intrinsic reasoning about functional programs. II: Unipolar induction and primitive-recursion
- Gentzen's proof systems: byproducts in a work of genius
- Non-strictly positive fixed points for classical natural deduction
- Cut elimination and normalization for generalized single and multi-conclusion sequent and natural deduction calculi
This page was built for publication: Normalization theorems for full first order classical natural deduction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3981450)
