On abstract resource semantics and computability logic
From MaRDI portal
(Redirected from Publication:980944)
Recommendations
- Publication:3495341
- Publication:4720780
- Abstract computability and algebraic specification
- On the complexity of resource-bounded logics
- On the complexity of resource-bounded logics
- Introduction to Cirquent Calculus and Abstract Resource Semantics
- scientific article; zbMATH DE number 4125400
- On computability by logic programs
- A computable semantics for general logic programs
- Intuitionistic Logic and Computability Theory
Cites work
- scientific article; zbMATH DE number 1948155 (Why is no real title available?)
- scientific article; zbMATH DE number 3448545 (Why is no real title available?)
- A game semantics for linear logic
- Degrees of indeterminacy of games
- In the beginning was game semantics
- Introduction to Cirquent Calculus and Abstract Resource Semantics
- Introduction to computability logic
- Linear logic
- Many concepts and two logics of algorithmic reduction
- On Game Semantics of the Affine and Intuitionistic Logics
- Propositional Calculus and Realizability
- Propositional computability logic II
- Sequential operators in computability logic
- The intuitionistic fragment of computability logic at the propositional level
Cited in
(14)- On the toggling-branching recurrence of computability logic
- Separating the basic logics of the basic recurrences
- Introduction to clarithmetic. I
- Toggling operators in computability logic
- A new face of the branching recurrence of computability logic
- Build your own clarithmetic. I: Setup and completeness
- Resource graphs and countermodels in resource logics
- Relating structure and power: Comonadic semantics for computational resources
- Computing with Numbers and Other Non-syntactic Things: De re Knowledge of Abstract Objects†
- The parallel versus branching recurrences in computability logic
- The taming of recurrences in computability logic through cirquent calculus. I
- The countable versus uncountable branching recurrences in computability logic
- A propositional cirquent calculus for computability logic.
- On Game Semantics of the Affine and Intuitionistic Logics
This page was built for publication: On abstract resource semantics and computability logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q980944)