Implicational complexity in intuitionistic arithmetic

DOI10.2307/2273617MaRDI QIDQ3949044zbMATH OpenOpenAlexFDO

Authors Daniel M. Leivant

Publication date 1981

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

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

zbMATH Keywords

implicationintuitionismtruth-definitionintuitionistic arithmeticimplicational measurePrenex normal form

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Metamathematics of constructive systems (03F50)

Cites work

• Number theoretic concepts and recursive well-orderings
• On formulas of one variable in intuitionistic propositional calculus

Cited in

(4)

• An intuitionistic formula hierarchy based on high‐school identities
• Some forms of excluded middle for linear orders
• Substitutions of \(\Sigma_1^0\)-sentences: Explorations between intuitionistic propositional logic and intuitionistic arithmetic
• Revisiting the conservativity of fixpoints over intuitionistic arithmetic

This page was built for publication: Implicational complexity in intuitionistic arithmetic

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