Pages that link to "Item:Q5202185"
From MaRDI portal
The following pages link to Constructive validity is nonarithmetic (Q5202185):
Displaying 9 items.
- Efficient boundary extraction from orthogonal pseudo-polytopes: an approach based on the \(n\)D-EVM (Q555011) (← links)
- Constructive formalization of the Tennenbaum theorem and its applications (Q803126) (← links)
- Provability in principle and controversial constructivistic principles (Q1372941) (← links)
- Lewis meets Brouwer: constructive strict implication (Q1688950) (← links)
- Intuitionistic completeness and classical logic (Q1882403) (← links)
- Satisfiability is false intuitionistically: a question from Dana Scott (Q2193975) (← links)
- Montague's paradox, informal provability, and explicit modal logic (Q2452676) (← links)
- Predicate Logics of Constructive Arithmetical Theories (Q3416116) (← links)
- An analysis of Tennenbaum's theorem in constructive type theory (Q6563042) (← links)