Sciweavers

835 search results - page 137 / 167
» Geometric Logic in Computer Science
Sort
View
KER
2006
158views more  KER 2006»
13 years 9 months ago
Formal systems for persuasion dialogue
This article reviews formal systems that regulate persuasion dialogues. In such dialogues two or more participants aim to resolve a difference of opinion, each trying to persuade ...
Henry Prakken
IJAC
2010
231views more  IJAC 2010»
13 years 7 months ago
Descriptive Complexity of Finite Abelian Groups
Title of dissertation: MODEL THEORY AND COMPLEXITY THEORY Walid Gomaa Doctor of Philosophy, 2007 Dissertation directed by: Professor William Gasarch Department of Computer Science...
Walid Gomaa
CADE
2007
Springer
14 years 10 months ago
Barendregt's Variable Convention in Rule Inductions
Abstract. Inductive definitions and rule inductions are two fundamental reasoning tools in logic and computer science. When inductive definitions involve binders, then Barendregt&#...
Christian Urban, Stefan Berghofer, Michael Norrish
LICS
2007
IEEE
14 years 4 months ago
A Dependent Set Theory
Set theories are traditionally based on first-order logic. We show that in a constructive setting, basing a set theory on a dependent logic yields many benefits. To this end, we...
Wojciech Moczydlowski
LICS
2007
IEEE
14 years 4 months ago
Static Name Control for FreshML
FreshML extends ML with constructs for declaring and ting abstract syntax trees that involve names and statically scoped binders. It is impure: name generation is an observable si...
François Pottier