Pages that link to "Item:Q1408853"

The following pages link to Introduction to computability logic (Q1408853):

Displaying 40 items.

• Introduction to clarithmetic. II (Q259084) (← links)
• A cirquent calculus system with clustering and ranking (Q301368) (← links)
• Imperative programs as proofs via game semantics (Q388203) (← links)
• Separating the basic logics of the basic recurrences (Q409329) (← links)
• Martin Davis on computability, computational logic, and mathematical foundations (Q505399) (← 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)
• Propositional games with explicit strategies (Q731893) (← links)
• On abstract resource semantics and computability logic (Q980944) (← links)
• Sequential operators in computability logic (Q999265) (← links)
• Dialogue games for many-valued logics -- an overview (Q1005947) (← links)
• Many concepts and two logics of algorithmic reduction (Q1005975) (← links)
• Information-gain computation in the \textsc{Fifth} system (Q1726365) (← links)
• The parallel versus branching recurrences in computability logic (Q1934954) (← 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 countable versus uncountable branching recurrences in computability logic (Q1948283) (← links)
• The scope of Gödel's first incompleteness theorem (Q2254575) (← links)
• A game-semantic model of computation (Q2319854) (← 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)
• From truth to computability. I. (Q2500484) (← links)
• Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism (Q2637708) (← links)
• On the system CL12 of computability logic (Q2941766) (← links)
• Aristotle on Universal Quantification: A Study from the Point of View of Game Semantics (Q2963961) (← links)
• Build your own clarithmetic I: Setup and completeness (Q2974779) (← links)
• (Q3159146) (← links)
• The logic of interactive turing reduction (Q3426573) (← links)
• Towards applied theories based on computability logic (Q3570163) (← links)
• (Q3998431) (← links)
• (Q4263952) (← links)
• Intuitionistic Logic and Computability Theory (Q4931589) (← links)
• Cirquent Calculus in a Nutshell (Q5059715) (← links)
• Propositional computability logic I (Q5277750) (← links)
• Propositional computability logic II (Q5277751) (← links)
• A PSPACE-complete first-order fragment of computability logic (Q5410328) (← links)
• Enumerating Independent Linear Inferences (Q6135760) (← links)
• A propositional cirquent calculus for computability logic. (Q6661240) (← links)