Name
Abstract | ||
|---|---|---|
This paper concerns a goal directed proof procedure for the propo- sitional fragment of the adaptive logic ACLuN1. The procedure forms an algorithm for final derivability and may easily be generalized for the propositional fragment of all flat adaptive logics. The aim is to articulate a procedure that, if extended to the predicative level, provides criteria for final derivability. |
Year | Venue | Field |
|---|---|---|
2002 | Paraconsistent Computational Logic | Discrete mathematics,Zeroth-order logic,Mathematical proof,Decision model,Proof procedure,Well-formed formula,Predicative expression,Calculus,Propositional variable,Mathematics |
DocType | Citations | PageRank |
Conference | 2 | 0.37 |
References | Authors | |
5 | 1 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Diderik Batens | 1 | 148 | 20.23 |