Pages that link to "Item:Q3570163"
From MaRDI portal
The following pages link to Towards applied theories based on computability logic (Q3570163):
Displaying 15 items.
- Introduction to clarithmetic. II (Q259084) (← links)
- Introduction to clarithmetic. III (Q392285) (← links)
- 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)
- Many concepts and two logics of algorithmic reduction (Q1005975) (← links)
- The taming of recurrences in computability logic through cirquent calculus. I (Q1935369) (← links)
- The countable versus uncountable branching recurrences in computability logic (Q1948283) (← links)
- Applicative theories for logarithmic complexity classes (Q2346995) (← links)
- From truth to computability. II. (Q2373705) (← links)
- A logical basis for constructive systems (Q2893325) (← links)
- On the system CL12 of computability logic (Q2941766) (← links)
- Build your own clarithmetic I: Setup and completeness (Q2974779) (← links)
- (Q4817211) (← links)