Sciweavers

2145 search results - page 157 / 429
» Lax Logical Relations
Sort
View
ENGL
2007
144views more  ENGL 2007»
13 years 10 months 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
ENTCS
2007
113views more  ENTCS 2007»
13 years 10 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»
13 years 10 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»
13 years 10 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»
13 years 8 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...