Pages that link to "Item:Q4928705"
From MaRDI portal
The following pages link to Computability Logic: A Formal Theory of Interaction (Q4928705):
Displayed 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)
- Sequential operators in computability logic (Q999265) (← links)
- Many concepts and two logics of algorithmic reduction (Q1005975) (← links)
- Computability and realizability for interactive computations (Q2343137) (← links)
- The intuitionistic fragment of computability logic at the propositional level (Q2373697) (← links)
- From truth to computability. II. (Q2373705) (← links)
- On the toggling-branching recurrence of computability logic (Q2434574) (← links)
- Verifying of interface assertions for infinite state Mealy machines (Q2453549) (← links)
- From truth to computability. I. (Q2500484) (← links)
- Build your own clarithmetic I: Setup and completeness (Q2974779) (← links)
- Towards applied theories based on computability logic (Q3570163) (← links)