New answers tagged lo.logic
2
votes
Connection between strong normalization of the simply typed λ-calculus, and cut elimination for propositional logic
How “standard” is it? A post by Anupam Das on the proof theory blog attacks the folklore by comparing the following two results:
Proposition 1 (Folklore). For any theorem A of IPL, we can compute a ...
Top 50 recent answers are included
Related Tags
lo.logic × 540type-theory × 94
cc.complexity-theory × 80
reference-request × 73
pl.programming-languages × 60
lambda-calculus × 60
computability × 51
proof-theory × 29
sat × 25
proof-complexity × 24
descriptive-complexity × 24
automata-theory × 21
dependent-type × 21
automated-theorem-proving × 20
model-checking × 20
finite-model-theory × 20
temporal-logic × 19
ct.category-theory × 17
proof-assistants × 17
coq × 16
linear-logic × 14
soft-question × 13
type-systems × 13
first-order-logic × 13
ds.algorithms × 12