I've been getting into intuitionistic logic lately, starting from propositional logic. I am interested in proof-theoretic semantics, meaning the idea that the truth of a proposition is derived from the existence of a proof of it. I have read different texts and while some authors mention Gentzen's Natural Deduction as the beginning of this proof theoretic semantics, many don't mention it at all and only refer to it as a proof system which is not based on axioms.
Those authors generally mention the Brouwer Heyting Kolmogorov interpretation as the source of this proof theoretic point of view, or Per Martin Lof's theory of verification.
My question is, how exactly are those three things related? Does Natural Deduction, except for being a proof system, provide proof theoretic semantics for propositional calculus? Lastly, what is the BHK interpretation regarded as exactly? I mean does it define a system of sorts?
2026-03-25 19:05:06.1774465506
What is the relationship between the BHK interpretation of propositional logic and Natural Deduction?
502 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in LOGIC
- Theorems in MK would imply theorems in ZFC
- What is (mathematically) minimal computer architecture to run any software
- What formula proved in MK or Godel Incompleteness theorem
- Determine the truth value and validity of the propositions given
- Is this a commonly known paradox?
- Help with Propositional Logic Proof
- Symbol for assignment of a truth-value?
- Find the truth value of... empty set?
- Do I need the axiom of choice to prove this statement?
- Prove that any truth function $f$ can be represented by a formula $φ$ in cnf by negating a formula in dnf
Related Questions in PROOF-THEORY
- Decision procedure in Presburger arithmetic
- Is this proof correct? (Proof Theory)
- Finite axiomatizability of theories in infinitary logic?
- Stochastic proof variance
- If $(x^{(n)})^∞_{n=m}$ is Cauchy and if some subsequence of $(x^{(n)})^∞_{n=m}$ converges then so does $(x^{(n)})^∞_{n=m}$
- Deduction in polynomial calculus.
- Are there automated proof search algorithms for extended Frege systems?
- Exotic schemes of implications, examples
- Is there any formal problem that cannot be proven using mathematical induction?
- Proofs using theorems instead of axioms
Related Questions in NATURAL-DEDUCTION
- Predicate logic: Natural deduction: Introducing universal quantifier
- Deduce formula from set of formulas
- Prove the undecidability of a formula
- Natural deduction proof for $(P\to\lnot Q)\to(\lnot P \lor\lnot Q)$
- How do I build a proof in natural deduction?
- Deductive Logic Proof
- Can the natural deduction system prove $P \iff ¬P$ to show that it's a contradiction?
- Exercises and solutions for natural deduction proofs in Robinson and Peano arithmetic
- How would I show that X is equivalent to ((¬X ↔ X ) ∨ X )?
- Equivalence proof by using identities and ‘n series of substitutions: (P ⋁ Q) → (P ⋀ Q) ≡ (P → Q) ⋀ (Q → P).
Related Questions in CONSTRUCTIVE-MATHEMATICS
- How do set theories base on Intuitionistic Logic deal with ordinals?
- Constructive Proof- How to Start?
- Does Diaconescu's theorem imply cubical type theory is non-constructive?
- Attempt at constructive proof of compactness of [0,1], does this use LEM? Does a constructive proof exist?
- Constructive proof of existence of maximal ideal
- Is there a theorem that can easily be proved to be non intuitionistic?
- What kinds of variables range over proofs?
- Construct a real $x$ such that ZF does not prove whether $x\in\mathbb{Q}$
- Infinitesimal Approaches To Differential Geometry As Conservative Extension
- Confusion around quantifiers in intuitionistic logic
Related Questions in INTUITIONISTIC-LOGIC
- Are Proofs of Dependent Pair Types Equivalent to Finding an Inverse Function?
- Prove the undecidability of a formula
- Semantics for minimal logic
- Is minimal logic equivalent to intuitionistic?
- How do set theories base on Intuitionistic Logic deal with ordinals?
- Why is intuitionistic modelling called forcing?
- Attempt at constructive proof of compactness of [0,1], does this use LEM? Does a constructive proof exist?
- Is there a theorem that can easily be proved to be non intuitionistic?
- Interpretation of implication in intuitionistic logic
- $\mathbb Q$ topological semantics for intuitionistic propositional logic
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
You have to compare e.g. The Development of Proof Theory for an overview regarding proof systems, including Gentzen's creations: Sequent calculus and Natural Deduction, with Intuitionistic Logic.
Intuitionism gave birth to the first "alternative" logic, characterized by the rejection of some "classically" valid principles, like the Law of Excluded Middle.
Intuitionistic logic can be foramlized with suitable proof systems, i.e. with a peculiar version of the many well-known proof systems: Hilbert-style, Natural Deduction, Sequent Calculus, Tableau.
In short, we have an intuitionistic Natural Deduction as well as a classical one.
Classical logic has its standard two-valued semantics: the truth-functional one (see Boolean Algebra and the usual truth tables).
Intuitionsitic logic has been equipped with its own semantics, based on Brouwer–Heyting–Kolmogorov interpretation.
For classical logic we have a Completeness Theorem, stating that every (classically) valid formula is provable with e.g. Natural Deduction, while for intuitionistic logic we have the corresponding Completeness Theorem with respect to Heyting semantics as well as Kripke semantics.