Classical and Intuitionistic Arithmetic with Higher Order Comprehension Coincide on Inductive Well-Foundedness
type: Item
instance of: scholarly article
zbMATH Open document ID: 1373.03126
author: Stefano Berardi
publication date: 2017-08-31T00:00:00Z
Mathematics Subject Classification ID: 03F35
Mathematics Subject Classification ID: 03B20
zbMATH DE Number: 6767605
zbMATH Keywords: intuitionism
zbMATH Keywords: inductive definitions
zbMATH Keywords: proof theory
zbMATH Keywords: impredicativity
zbMATH Keywords: omega rule
MaRDI profile type: Publication
full work available at URL: 21.pdf
OpenAlex ID: W2293094391
title: Classical and Intuitionistic Arithmetic with Higher Order Comprehension Coincide on Inductive Well-Foundedness
DOI: 10.4230/LIPICS.CSL.2015.343
Recommended article: Intuitionistic completeness and classical logic
Recommended article: Arithmetical Completeness of the Intuitionistic Logic of Proofs
Recommended article: A generalization of a conservativity theorem for classical versus intuitionistic arithmetic
Recommended article: On the Hierarchy of Intuitionistic Bounded Arithmetic
Recommended article: Q4664249
Recommended article: Q3481700
Recommended article: Intuitionistic completeness for first order classical logic
Recommended article: Classical and intuitionistic models of arithmetic
Recommended article: On the proofs of arithmetical completeness for interpretability logic
Recommended article: Q3801546
description: scientific article; zbMATH DE number 6767605