Sciweavers

2012 search results - page 154 / 403
» CORAL - Control, Relations and Logic
Sort
View
ENTCS
2007
113views more  ENTCS 2007»
15 years 6 months ago
A Formalization of Strong Normalization for Simply-Typed Lambda-Calculus and System F
We formalize in the logical framework ATS/LF a proof based on Tait’s method that establishes the simply-typed lambda-calculus being strongly normalizing. In malization, we emplo...
Kevin Donnelly, Hongwei Xi
SYNTHESE
2008
177views more  SYNTHESE 2008»
15 years 6 months ago
On the role of language in social choice theory
Axiomatic characterization results in social choice theory are usually compared either regarding the normative plausibility or regarding the logical strength of the axioms involved...
Marc Pauly
CORR
1999
Springer
95views Education» more  CORR 1999»
15 years 6 months ago
Fixed-parameter tractability, definability, and model checking
In this article, we study parameterized complexity theory from the perspective of logic, or more specifically, descriptive complexity theory. We propose to consider parameterized ...
Jörg Flum, Martin Grohe
CORR
2010
Springer
194views Education» more  CORR 2010»
15 years 3 months ago
A Focused Sequent Calculus Framework for Proof Search in Pure Type Systems
Basic proof search tactics in logic and type theory can be seen as the root-rst applications of rules in an appropriate sequent calculus, preferably without the redundancies gener...
Stéphane Lengrand, Roy Dyckhoff, James McKi...
ADC
2008
Springer
146views Database» more  ADC 2008»
16 years 26 days ago
A Typed Higher-Order Calculus for Querying XML Databases
As the eXtensible Markup Language (XML) is about to emerge as a new standard for databases, the problem of providing solid logical grounds for XML query languages arises. For the ...
Qing Wang, Klaus-Dieter Schewe