Sciweavers

835 search results - page 54 / 167
» Geometric Logic in Computer Science
Sort
View
CORR
2008
Springer
120views Education» more  CORR 2008»
13 years 8 months ago
On the Complexity of Elementary Modal Logics
Modal logics are widely used in computer science. The complexity of modal satisfiability problems has been investigated since the 1970s, usually proving results on a case-by-case b...
Edith Hemaspaandra, Henning Schnoor
CORR
2002
Springer
67views Education» more  CORR 2002»
13 years 8 months ago
The prospects for mathematical logic in the twenty-first century
Abstract. The four authors present their speculations about the future developments of mathematical logic in the twenty-first century. The areas of recursion theory, proof theory a...
Samuel R. Buss, Alexander S. Kechris, Anand Pillay...
LICS
2005
IEEE
14 years 2 months ago
Semantics of Separation-Logic Typing and Higher-Order Frame Rules
We show how to give a coherent semantics to programs that are well-specified in a version of separation logic for a language with higher types: idealized algol extended with heap...
Lars Birkedal, Noah Torp-Smith, Hongseok Yang
APAL
2005
117views more  APAL 2005»
13 years 8 months ago
About cut elimination for logics of common knowledge
The notions of common knowledge or common belief play an important role in several areas of computer science (e.g. distributed systems, communication), in philosophy, game theory,...
Luca Alberucci, Gerhard Jäger
AML
2008
57views more  AML 2008»
13 years 8 months ago
Sheaf toposes for realizability
We compare realizability models over partial combinatory algebras by embedding them into sheaf toposes. We then use the machinery of Grothendieck toposes and geometric morphisms t...
Steven Awodey, Andrej Bauer