Bazsites.com Computational Logic

Directory Topics

On the Web

Game Semantics or Linear Logic? - A discussion of how linear logic relates to computability logic - the game-sematically introduced logic of computational resources and interactive computation.
Imperial College London: Logic and Artificial Intelligence - Department of Computing, Imperial College of Science, Technology and Medicine, University of London: research group on logic and artificial intelligence focusing on communicating agents, computational logic and computational bioinformatics. Faculty home pages and departmental technical reports provide documentation on (the evolution) of logic programming.
Game Semantics or Linear Logic? - A discussion of how linear logic relates to computability logic, - the game-sematically introduced logic of computational resources and interactive computation.
Computational Isomorphisms in Classical Logic - Article by V. Danos, J. B. Joinet and H. Schellinx examining the categorical semantics of classical logic from a persepctive inspired by linear logic.
Game Semantics or Linear Logic? - A discussion of how linear logic relates to computability logic, - the game-sematically introduced logic of computational resources and interactive computation.
Computational Content of Classical Logic (1996) - Lecture notes from a research seminar series by Thierry Coquand covering double-negation translations, game semantics of classical logic and point-free topology.
On the computational content of the Axiom of Choice (1995) - Article by S. Berardi, M. Bezem and T. Coquand presenting a possible computational content of the negative translation of classical analysis with the Axiom of Choice.
MetaPRL logical programming environment - The next generation of the NuPrl proof development system. The main new features of MetaPRL include: 1) Modularity. Programs and logics are developed as modules that define computational, heuristic, and mathematical properties. 2) Speed. MetaPRL is more than two orders of magnitude faster than NuPrl.
Extracting Constructive Content from Classical Logic via Control-like Reductions - Article by F. Barbanera and S. Berardi showing how computational content may be extracted from proofs in Peano Arithmetic by a variant of a method proposed by William Tait.
Computability Logic - Encyclopedia article.

Wikipedia Articles

Fair Computational tree logic - Fair computational tree logic is conventional computational tree logic studied with explicit fairness constraints.
Computational tree logic - Computational tree logic (CTL) is a branching-time logic, meaning that its model of time is a tree-like structure in which the future is not determined; there are different paths in the future, any one of which might be 'actual' path that is realised.
Computability logic - Introduced by Giorgi Japaridze in 2003, Computability logic is a research programme and mathematical framework for redeveloping logic as a systematic formal theory of computability, as opposed to classical logic which is a formal theory of truth. In this approach logical formulas represent computational problems (or, equivalently, computational resources), and their validity means being "always computable".
Computational semiotics - Computational semiotics is an interdisciplinary field that applies, conducts, and draws on research in logic, mathematics, the theory and practice of computation, formal and natural language studies, the cognitive sciences generally, and semiotics proper. A common theme of this work is the adoption of a sign-theoretic perspective on issues of artificial intelligence and knowledge representation.
Descriptive complexity - Descriptive complexity is a branch of finite model theory, a subfield of computational complexity theory and mathematical logic, which seeks to characterize complexity classes by the type of logic needed to express the languages in them. For example, PH, the union of all complexity classes in the polynomial hierarchy, is precisely the class of languages expressible by statements of second-order logic.