Pages that link to "Item:Q3620031"
From MaRDI portal
The following pages link to In the beginning was game semantics (Q3620031):
Displaying 17 items.
- Introduction to clarithmetic. II (Q259084) (← links)
- A cirquent calculus system with clustering and ranking (Q301368) (← 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)
- On abstract resource semantics and computability logic (Q980944) (← links)
- Sequential operators in computability logic (Q999265) (← links)
- Many concepts and two logics of algorithmic reduction (Q1005975) (← links)
- The parallel versus branching recurrences in computability logic (Q1934954) (← links)
- The countable versus uncountable branching recurrences in computability logic (Q1948283) (← links)
- From truth to computability. II. (Q2373705) (← links)
- On the toggling-branching recurrence of computability logic (Q2434574) (← links)
- Build your own clarithmetic I: Setup and completeness (Q2974779) (← links)
- Supervenience, Dependence, Disjunction (Q5215498) (← links)
- A PSPACE-complete first-order fragment of computability logic (Q5410328) (← links)
- A propositional cirquent calculus for computability logic. (Q6661240) (← links)
