Sciweavers

2432 search results - page 190 / 487
» Cryptographic logical relations
Sort
View
ENGL
2007
144views more  ENGL 2007»
15 years 28 days ago
Constructive Analysis of Intensional Phenomena in Natural Language
Abstract— Chierchia [2, 3, 4], pointed out the inadequacy of Montague’s approach in the analysis of certain natural language constructions, such as nominalization and propositi...
Rogelio Davila, Leonardo Soto, Nahitt H. Padilla
104
Voted
ENTCS
2007
113views more  ENTCS 2007»
15 years 28 days 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
115
Voted
SYNTHESE
2008
177views more  SYNTHESE 2008»
15 years 27 days 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 20 days 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
123
Voted
ADC
2008
Springer
146views Database» more  ADC 2008»
15 years 7 months 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