119 search results - page 13 / 24 » Tree-Width for First Order Formulae |
CORR
2006
Springer
15 years 10 days ago
2006
Springer
We formalise and mechanise a construtive, proof theoretic proof of Craig's Interpolation Theorem in Isabelle/HOL. We give all the definitions and lemma statements both formal...
88
Voted
NDJFL
2002
14 years 12 months ago
2002
In any nonstandard model of Peano arithmetic, the standard part is not first order definable. But we show that in some model the standard part is definable as the unique solution ...
119
click to vote
ICTL
1994
15 years 4 months ago
1994
We introduce a temporal logic TAL and prove that it has several nice features. The formalism is a two-dimensional modal system in the sense that formulas of the language are evalua...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. We prove that interactive learning based classical realizability (introduced by Aschieri and Berardi for first order arithmetic [1]) is sound with respect to Coquand game...
128
click to vote
PLANX
2007
15 years 1 months ago
2007
We present an algorithm to solve XPath decision problems under regular tree type constraints and show its use to statically typecheck XPath queries. To this end, we prove the deci...