The following pages link to From truth to computability. I. (Q2500484):
Displaying 13 items.
- Separating the basic logics of the basic recurrences (Q409329) (← links)
- Toggling operators in computability logic (Q631756) (← links)
- Introduction to clarithmetic. I (Q642523) (← links)
- A new face of the branching recurrence of computability logic (Q712555) (← links)
- Sequential operators in computability logic (Q999265) (← links)
- Many concepts and two logics of algorithmic reduction (Q1005975) (← links)
- The taming of recurrences in computability logic through cirquent calculus. II (Q1935368) (← links)
- The taming of recurrences in computability logic through cirquent calculus. I (Q1935369) (← links)
- The intuitionistic fragment of computability logic at the propositional level (Q2373697) (← links)
- From truth to computability. II. (Q2373705) (← links)
- Build your own clarithmetic I: Setup and completeness (Q2974779) (← links)
- Towards applied theories based on computability logic (Q3570163) (← links)
- A PSPACE-complete first-order fragment of computability logic (Q5410328) (← links)
