Constructive validity is nonarithmetic
From MaRDI portal
Publication:5202185
DOI10.2307/2274603zbMath0724.03034OpenAlexW4239436968MaRDI QIDQ5202185
Publication date: 1988
Published in: The Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2274603
incompleteness theoremKleene hierarchyrecursive models of arithmeticarithmetical definability of logical validityHeyting's intuitionistic second-order arithmetic
Models of arithmetic and set theory (03C62) Second- and higher-order arithmetic and fragments (03F35) Computable structure theory, computable model theory (03C57) Intuitionistic mathematics (03F55) Categoricity and completeness of theories (03C35)
Related Items (5)
Intuitionistic completeness and classical logic ⋮ Lewis meets Brouwer: constructive strict implication ⋮ Satisfiability is false intuitionistically: a question from Dana Scott ⋮ Montague's paradox, informal provability, and explicit modal logic ⋮ Efficient boundary extraction from orthogonal pseudo-polytopes: an approach based on the \(n\)D-EVM
This page was built for publication: Constructive validity is nonarithmetic