Pages that link to "Item:Q5957916"
From MaRDI portal
The following pages link to Arithmetic complexity of the predicate logics of certain complete arithmetic theories (Q5957916):
Displaying 10 items.
- Polynomially bounded recursive realizability (Q817959) (← links)
- Arithmetic complexity of first-order definable subsets of recursive Boolean algebras (Q1284381) (← links)
- On strictly arithmetical completeness in logics of programs (Q2277248) (← links)
- A simplified proof of arithmetical completeness theorem for provability logic GLP (Q2510758) (← links)
- Challenges to predicative foundations of arithmetic (Q2755496) (← links)
- (Q3199407) (← links)
- (Q3760514) (← links)
- Comparing Constructive Arithmetical Theories Based on NP-PIND and coNP-PIND (Q4812318) (← links)
- (Q5208872) (← links)
- (Q5459305) (← links)