1894 search results - page 108 / 379 » A TLA Proof System |
108
Voted
COCO
2010
Springer
15 years 4 months ago
2010
Springer
The last decade has seen a revival of interest in pebble games in the context of proof complexity. Pebbling has proven to be a useful tool for studying resolution-based proof syst...
92
Voted
MCU
2007
15 years 2 months ago
2007
Abstract. In this paper we will give an outline of the proof of the solvability of the halting and reachability problem for 2-symbolic tag systems with a deletion number v = 2. Thi...
102
Voted
JUCS
2007
15 years 21 days ago
2007
: This paper introduces the notion of pedagogical natural deduction systems, which are natural deduction systems with the following additional constraint: all hypotheses made in a ...
70
Voted
CADE
2007
Springer
16 years 1 months ago
2007
Springer
This paper describes the design, implementation, and testing of a system for selecting necessary axioms from a large set also containing superfluous axioms, to obtain a proof of a...
119
Voted
ENTCS
2008
15 years 26 days ago
2008
Yi and Sakai [9] showed that the termination problem is a decidable property for the class of semi-constructor term rewriting systems, which is a superclass of the class of right ...