Pages that link to "Item:Q1206242"
From MaRDI portal
The following pages link to On arithmetic complexity of certain constructive logics (Q1206242):
Displaying 10 items.
- Arithmetic complexity of first-order definable subsets of recursive Boolean algebras (Q1284381) (← links)
- No escape from Vardanyan's theorem (Q2501168) (← links)
- A Function Elimination Method for Checking Satisfiability of Arithmetical Logics (Q2968852) (← links)
- (Q3705454) (← links)
- (Q3760514) (← links)
- On two questions about feasibly constructive arithmetic (Q4419272) (← links)
- Comparing Constructive Arithmetical Theories Based on NP-PIND and coNP-PIND (Q4812318) (← links)
- (Q5208872) (← links)
- (Q5459305) (← links)
- Rules and arithmetics (Q5937848) (← links)