1322 search results - page 133 / 265 » Unsound Theorem Proving |
STACS
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. It is well known that one-dimensional cellular automata working on the usual neighborhood are Turing complete, and many acceleration theorems are known. However very litt...
TLCA
2005
Springer
14 years 3 months ago
2005
Springer
Cut elimination is a central result of the proof theory. This paper proposes a new approach for proving the theorem for Gentzen’s intuitionistic sequent calculus LJ, that relies ...
ER
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. Recent developments in reification of ER schemata include automatic generation of webbased database administration systems [1,2]. These systems enforce the schema cardin...
ICALP
2004
Springer
14 years 3 months ago
2004
Springer
We consider the multiplicative and exponential fragment of linear logic (MELL) and give a Geometry of Interaction (GoI) semantics for it based on unique decomposition categories. ...
LATIN
2004
Springer
14 years 3 months ago
2004
Springer
In a preceding paper [6], automata have been introduced for words indexed by linear orderings. These automata are a generalization of automata for finite, infinite, bi-infinite...