The permutability of rules in the classical inferential calculus

DOI10.2307/2266612MaRDI QIDQ5813906zbMATH OpenOpenAlexFDO

Authors Haskell B. Curry

Publication date 1952

Published in Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2266612

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

Recommendations

• Permutability of proofs in intuitionistic sequent calculi
• Rules of inference with parameters for intuitionistic logic
• Calculizing classical inferential erotetic logic
• Tractability of cut-free Gentzen type propositional calculus with permutation inference
• scientific article; zbMATH DE number 3296223
• CRITERIA FOR ADMISSIBILITY OF RULES OF INFERENCE WITH PARAMETERS IN THE INTUITIONISTIC PROPOSITIONAL CALCULUS
• Tractability of cut-free Gentzen-type propositional calculus with permutation inference. II
• scientific article; zbMATH DE number 3959387
• Invariance principles in polyadic inductive logic
• The permutative -calculus

Cited in

(4)

• A simple treatment of truth functions
• scientific article; zbMATH DE number 1354105 (Why is no real title available?)
• scientific article; zbMATH DE number 1463150 (Why is no real title available?)
• Investigations into proof-search in a system of first-order dependent function types

This page was built for publication: The permutability of rules in the classical inferential calculus

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