Realization of Intuitionistic Logic by Proof Polynomials

DOI10.1080/11663081.1999.10510968MaRDI QIDQ4531579zbMATH OpenOpenAlexFDO

Authors Sergei Artemov

Publication date 22 May 2002

Published in Journal of Applied Non-Classical Logics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/11663081.1999.10510968

zbMATH Keywords

arithmetical semanticsfunctional completenessintuitionistic logicproof polynomialsproof realizabilityprovability

Mathematics Subject Classification ID

Subsystems of classical logic (including intuitionistic logic) (03B20) Provability logics and related algebras (e.g., diagonalizable algebras) (03F45)

Recommendations

• scientific article; zbMATH DE number 1497741
• Explicit provability and constructive semantics
• scientific article; zbMATH DE number 4099259
• scientific article; zbMATH DE number 4027437
• The logic of proofs, semantically

Cites work

• Constructivism in mathematics. An introduction. Volume I
• scientific article; zbMATH DE number 1170091 (Why is no real title available?)
• Logic and structure.
• Logic of proofs
• Some theorems about the sentential calculi of Lewis and Heyting

Cited in

(7)

• Intuitionistic formal theories with realizability in subrecursive classes
• Polynomial induction and length minimization in intuitionistic bounded arithmetic
• Self-referentiality in the Brouwer-Heyting-Kolmogorov semantics of intuitionistic logic
• Self-referentiality of Brouwer-Heyting-Kolmogorov semantics
• scientific article; zbMATH DE number 1497741 (Why is no real title available?)
• Computer Science Logic
• Polynomials over the reals in proofs of termination : from theory to practice

This page was built for publication: Realization of Intuitionistic Logic by Proof Polynomials

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