The calculus of higher-level rules, propositional quantification, and the foundational approach to proof-theoretic harmony

DOI10.1007/s11225-014-9562-3zbMath1344.03046OpenAlexW2089716623MaRDI QIDQ2259011

Peter Schroeder-Heister

Publication date: 27 February 2015

Published in: Studia Logica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11225-014-9562-3

zbMATH Keywords

harmonypropositional quantificationassumptionsproof-theoretic semanticshigher-level rules

Mathematics Subject Classification ID

History of mathematics in the 20th century (01A60) Cut-elimination and normal-form theorems (03F05) Structure of proofs (03F07) History of mathematical logic and foundations (03-03) Proof theory in general (including proof-theoretic semantics) (03F03)

Related Items (14)

Stabilizing quantum disjunction ⋮ The naturality of natural deduction ⋮ Proof-theoretic harmony: towards an intensional account ⋮ At least not false, at most possible: between truth and assertibility of superlative quantifiers ⋮ On the concurrent computational content of intermediate logics ⋮ General-elimination stability ⋮ Harmony in multiple-conclusion natural-deduction ⋮ Gentzen and Jaśkowski natural deduction: fundamentally similar but importantly different ⋮ The calculus of higher-level rules, propositional quantification, and the foundational approach to proof-theoretic harmony ⋮ Failure of completeness in proof-theoretic semantics ⋮ Prawitz, Proofs, and Meaning ⋮ Constructibility and Geometry ⋮ A new connective in natural deduction, and its application to quantum computing ⋮ A Poly-Connexive Logic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on harmony
• General-elimination harmony and the meaning of the logical constants
• An intuitionistic Sheffer function
• Partial inductive definitions
• On the idea of a general proof theory
• The adequacy problem for inferential logic
• Natural deduction with general elimination rules
• Definitional reflection and basic logic
• Gentzen and Jaśkowski natural deduction: fundamentally similar but importantly different
• The calculus of higher-level rules, propositional quantification, and the foundational approach to proof-theoretic harmony
• Validity concepts in proof-theoretic semantics
• Failure of completeness in proof-theoretic semantics
• ON FLATTENING ELIMINATION RULES
• Ultimate Normal Forms for Parallelized Natural Deductions
• A Proof-Theoretic Approach to Logic Programming. I. Clauses as Rules
• A natural extension of natural deduction
• Uniqueness, definability and interpolation
• General-Elimination Harmony and Higher-Level Rules
• Generalized Elimination Inferences, Higher-Level Rules, and the Implications-as-Rules Interpretation of the Sequent Calculus
• Some Remarks on Proof-Theoretic Semantics

This page was built for publication: The calculus of higher-level rules, propositional quantification, and the foundational approach to proof-theoretic harmony