21 search results - page 3 / 5 » A Natural Axiomatization of Computability and Proof of Churc... |
BIRTHDAY
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. We present a new proof of axiomatic completeness for Proposition Temporal Logic (PTL) for discrete, linear time for both finite and infinite time (without past-time). T...
105
click to vote
TLCA
1997
Springer
15 years 1 months ago
1997
Springer
We present new sound and complete axiomatizations of type equality and subtype inequality for a first-order type language with regular recursive types. The rules are motivated by ...
CORR
2006
Springer
14 years 9 months ago
2006
Springer
Physical processes are computations only when we use them to externalize thought. Entities provide nature with a way to preserve structure over time. We think in terms of entities ...
FOSSACS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Nominal logic is a variant of first-order logic equipped with a “freshname quantifier” N and other features useful for reasoning about languages with bound names. I...
IANDC
2008
14 years 9 months ago
2008
The main goal of this paper is to apply rewriting termination technology --enjoying a quite mature set of termination results and tools-- to the problem of proving automatically t...