multivalued semantics
Recently Published Documents


TOTAL DOCUMENTS

2
(FIVE YEARS 0)

H-INDEX

1
(FIVE YEARS 0)

2019 ◽  
Vol 13 (4) ◽  
pp. 810-828
Author(s):  
MARIO PIAZZA ◽  
GABRIELE PULCINI

AbstractThis article presents a new (multivalued) semantics for classical propositional logic. We begin by maximally extending the space of sequent proofs so as to admit proofs for any logical formula; then, we extract the new semantics by focusing on the axiomatic structure of proofs. In particular, the interpretation of a formula is given by the ratio between the number of identity axioms out of the total number of axioms occurring in any of its proofs. The outcome is an informational refinement of traditional Boolean semantics, obtained by breaking the symmetry between tautologies and contradictions.



1996 ◽  
Vol 07 (04) ◽  
pp. 359-406 ◽  
Author(s):  
JAN A. PLAZA

We consider propositional logic programs with negations. We define notions of constructive transformation and constructive completion of a program. We use these notions to characterize SLDNF-resolution in classical, intuitionistic and intermediate logics, and also to derive a characterization in modal logics of knowledge. We show that the three-valued and four-valued fix-point or declarative semantics for program P are equivalent to the two-valued semantics for the constructive version of P. We argue that it would be beneficial to replace Negation as Failure by constructive transformation, and it would be beneficial to use the semantics for the constructive version of the program instead of multivalued semantics for the original program.



Sign in / Sign up

Export Citation Format

Share Document