1101 search results - page 130 / 221 » Forcing in proof theory |
100
click to vote
JACM
2006
15 years 19 days ago
2006
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
85
Voted
IPL
2007
15 years 17 days ago
2007
We prove that there is a polynomial time substitution (y1, . . . , yn) := g(x1, . . . , xk) with k << n such that whenever the substitution instance A(g(x1, . . . , xk)) of ...
121
Voted
FROCOS
2000
Springer
15 years 4 months ago
2000
Springer
We define a sound and complete logic, called FO , which extends classical first-order predicate logic with intuitionistic implication. As expected, to allow the interpretation of i...
211
Voted
PLDI
2009
ACM
16 years 1 months ago
2009
ACM
Reasoning about string variables, in particular program inputs, is an important aspect of many program analyses and testing frameworks. Program inputs invariably arrive as strings...
96
Voted
STOC
2007
ACM
16 years 29 days ago
2007
ACM
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...