Infinite arguments and semantics of dialectical proof procedures
Keyword(s):
We study the semantics of dialectical proof procedures. As dialectical proof procedures are in general sound but not complete wrt admissibility semantics, a natural question here is whether we could give a more precise semantical characterization of what they compute. Based on a new notion of infinite arguments representing (possibly infinite) loops, we introduce a stricter notion of admissibility, referred to as strict admissibility, and show that dialectical proof procedures are in general sound and complete wrt strict admissibility.
2010 ◽
Vol Vol. 12 no. 5
(Combinatorics)
◽
1974 ◽
Vol 32
◽
pp. 254-255
1983 ◽
Vol 41
◽
pp. 270-271
1973 ◽
Vol 31
◽
pp. 144-145
1973 ◽
Vol 31
◽
pp. 132-133
◽
1983 ◽
Vol 41
◽
pp. 194-195
Keyword(s):
1983 ◽
Vol 41
◽
pp. 160-161
1983 ◽
Vol 41
◽
pp. 72-73
Keyword(s):