z-logo
open-access-imgOpen Access
Infinite arguments and semantics of dialectical proof procedures
Author(s) -
Phan Minh Thang,
Phan Minh Dung,
Jiraporn Pooksook
Publication year - 2022
Publication title -
argument and computation
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.38
H-Index - 20
eISSN - 1946-2166
pISSN - 1946-2174
DOI - 10.3233/aac-200546
Subject(s) - dialectic , semantics (computer science) , characterization (materials science) , structural proof theory , computer science , calculus (dental) , proof theory , mathematics , programming language , mathematical proof , epistemology , philosophy , medicine , materials science , geometry , dentistry , nanotechnology
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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here