TY - GEN
T1 - Effective finite-valued semantics for labelled calculi
AU - Baaz, Matthias
AU - Lahav, Ori
AU - Zamansky, Anna
PY - 2012
Y1 - 2012
N2 - We provide a systematic and modular method to define non-deterministic finite-valued semantics for a natural and very general family of canonical labelled calculi, of which many previously studied sequent and labelled calculi are particular instances. This semantics is effective, in the sense that it naturally leads to a decision procedure for these calculi. It is then applied to provide simple decidable semantic criteria for crucial syntactic properties of these calculi, namely (strong) analyticity and cut-admissibility.
AB - We provide a systematic and modular method to define non-deterministic finite-valued semantics for a natural and very general family of canonical labelled calculi, of which many previously studied sequent and labelled calculi are particular instances. This semantics is effective, in the sense that it naturally leads to a decision procedure for these calculi. It is then applied to provide simple decidable semantic criteria for crucial syntactic properties of these calculi, namely (strong) analyticity and cut-admissibility.
UR - http://www.scopus.com/inward/record.url?scp=84863611335&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-31365-3_7
DO - 10.1007/978-3-642-31365-3_7
M3 - Conference contribution
AN - SCOPUS:84863611335
SN - 9783642313646
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 52
EP - 66
BT - Automated Reasoning - 6th International Joint Conference, IJCAR 2012, Proceedings
T2 - 6th International Joint Conference on Automated Reasoning, IJCAR 2012
Y2 - 26 June 2012 through 29 June 2012
ER -