Pages that link to "Item:Q1948283"
From MaRDI portal
The following pages link to The countable versus uncountable branching recurrences in computability logic (Q1948283):
Displaying 7 items.
- A cirquent calculus system with clustering and ranking (Q301368) (← links)
- Separating the basic logics of the basic recurrences (Q409329) (← links)
- A new face of the branching recurrence of computability logic (Q712555) (← links)
- On the toggling-branching recurrence of computability logic (Q2434574) (← links)
- Countable Lawvere theories and computational effects (Q2863882) (← links)
- Build your own clarithmetic I: Setup and completeness (Q2974779) (← links)
- A propositional cirquent calculus for computability logic. (Q6661240) (← links)